Fibonacci number: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Wlodzimierz Holsztynski
imported>Wlodzimierz Holsztynski
Line 54: Line 54:
  <math>F_n\ </math>&nbsp; is the nearest integer to&nbsp; <math>\frac{1}{\sqrt{5}}\cdot \left(\frac{1+\sqrt{5}}{2}\right)^n</math>
  <math>F_n\ </math>&nbsp; is the nearest integer to&nbsp; <math>\frac{1}{\sqrt{5}}\cdot \left(\frac{1+\sqrt{5}}{2}\right)^n</math>


for every <math>\ n=0,1,\dots</math> .
for every <math>\ n=0,1,\dots</math> . It follows that&nbsp; <math>\lim_{n\to\infty}\frac{F(n+1)}{F(n)}=A</math>;&nbsp; thus the value of the golden ratio is


::<math>\ \varphi\ =\ A\ =\ \frac{1+\sqrt{5}}{2}</math> .


== Further reading ==
== Further reading ==

Revision as of 07:23, 29 December 2007

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In mathematics, the Fibonacci numbers form a sequence defined by the following recurrence relation:

The sequence of fibonacci numbers start: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, ...

Fibonacci numbers and the rabbits

The sequence of fibonacci numbers was first used, to repesent the growth of a colony of rabbits, starting with one pair of rabbits.

Properties

  • The quotient of two consecutive fibonacci numbers converges to the golden ratio:
  • If divides then divides
  • If is a prime number, then is also a prime number.

Direct formula

Let    and   .  Let

Then:

  •     and    
  •     hence    
  •     hence    

for every . Thus   for every , i.e.


for every . Furthermore:


It follows that

  is the nearest integer to  

for every . It follows that  ;  thus the value of the golden ratio is

.

Further reading