🗊Презентация Ryspekov’s Fibonacci sequence formula

Категория: Математика
Нажмите для полного просмотра!
Ryspekov’s Fibonacci sequence formula, слайд №1Ryspekov’s Fibonacci sequence formula, слайд №2Ryspekov’s Fibonacci sequence formula, слайд №3Ryspekov’s Fibonacci sequence formula, слайд №4Ryspekov’s Fibonacci sequence formula, слайд №5Ryspekov’s Fibonacci sequence formula, слайд №6Ryspekov’s Fibonacci sequence formula, слайд №7Ryspekov’s Fibonacci sequence formula, слайд №8Ryspekov’s Fibonacci sequence formula, слайд №9Ryspekov’s Fibonacci sequence formula, слайд №10Ryspekov’s Fibonacci sequence formula, слайд №11Ryspekov’s Fibonacci sequence formula, слайд №12Ryspekov’s Fibonacci sequence formula, слайд №13
Скачать
Вы можете ознакомиться и скачать презентацию на тему Ryspekov’s Fibonacci sequence formula. Доклад-сообщение содержит 13 слайдов. Презентации для любого класса можно скачать бесплатно. Если материал и наш сайт презентаций Mypresentation Вам понравились – поделитесь им с друзьями с помощью социальных кнопок и добавьте в закладки в своем браузере.

Слайды и текст этой презентации

Слайд 1


Ryspekov’s Fibonacci sequence formula Global Revival Inc. June 11, 2017.
Описание слайда:
Ryspekov’s Fibonacci sequence formula Global Revival Inc. June 11, 2017.

Слайд 2


Ryspekov’s Fibonacci sequence formula, слайд №2
Описание слайда:

Слайд 3


Ryspekov’s Fibonacci sequence formula, слайд №3
Описание слайда:

Слайд 4


Introduction Fibonacci numbers — the elements of a numerical sequence where each subsequent number is the sum of two previous numbers. The Fibonacci numbers are also called the Golden section. The Golden section is used for architecture, art, space exploration, etc. My formula will allow easy (low resource consumption at high speed) interact with and/or search the Fibonacci numbers (rational). What kind of problems with the existing formulas?
Описание слайда:
Introduction Fibonacci numbers — the elements of a numerical sequence where each subsequent number is the sum of two previous numbers. The Fibonacci numbers are also called the Golden section. The Golden section is used for architecture, art, space exploration, etc. My formula will allow easy (low resource consumption at high speed) interact with and/or search the Fibonacci numbers (rational). What kind of problems with the existing formulas?

Слайд 5


Standard formula’s problems Fn= Fn-1+Fn-2 You need to know 2 or more previous numbers So: High memory usage. If you have only one Fibonacci number, you can’t find the next and/or previous numbers using only this number.
Описание слайда:
Standard formula’s problems Fn= Fn-1+Fn-2 You need to know 2 or more previous numbers So: High memory usage. If you have only one Fibonacci number, you can’t find the next and/or previous numbers using only this number.

Слайд 6


Binet’s formula’s problems
Описание слайда:
Binet’s formula’s problems

Слайд 7


Binet’s formula’s problems Speed of search first n numbers is very slow because the formula have a lot of operations. If you have only one Fibonacci number, you can’t find the next and/or previous numbers using only this number.
Описание слайда:
Binet’s formula’s problems Speed of search first n numbers is very slow because the formula have a lot of operations. If you have only one Fibonacci number, you can’t find the next and/or previous numbers using only this number.

Слайд 8


Ryspekov’s Fibonacci sequence formula. Description. f(x) – (2ˆx)%2 g(x) – math rounding function (next slide) n – max number/count of terms b=n-1 x1=1 % - modulo operation y= %3)*(g(x)%2)+(1-f(i%3))*(f(g(x)%2))
Описание слайда:
Ryspekov’s Fibonacci sequence formula. Description. f(x) – (2ˆx)%2 g(x) – math rounding function (next slide) n – max number/count of terms b=n-1 x1=1 % - modulo operation y= %3)*(g(x)%2)+(1-f(i%3))*(f(g(x)%2))

Слайд 9


Math Rounding (towards zero)
Описание слайда:
Math Rounding (towards zero)

Слайд 10


Ryspekov’s Fibonacci sequence formula.
Описание слайда:
Ryspekov’s Fibonacci sequence formula.

Слайд 11


Ryspekov’s Fibonacci sequence formula (short example for computers) C++ programing language
Описание слайда:
Ryspekov’s Fibonacci sequence formula (short example for computers) C++ programing language

Слайд 12


Ryspekov’s Fibonacci sequence formula, слайд №12
Описание слайда:

Слайд 13


I would appreciate, if you can share this formula with others, who can utilize it. I would be happy to help them to realize it in any commercial applications. Thank you!
Описание слайда:
I would appreciate, if you can share this formula with others, who can utilize it. I would be happy to help them to realize it in any commercial applications. Thank you!

Скачать

Похожие презентации
Mypresentation.ru
Загрузить презентацию