Difference between revisions of "Calculate the Fibonacci Sequence"

Kipkis (Kipkis | contribs)
m (Update ref tag)
Kipkis (Kipkis | contribs)
m (Text replacement - "[[Category:A" to "[[Category: A")
Line 1: Line 1:
 
The Fibonacci sequence is a pattern of numbers generated by summing the previous two numbers in the sequence. The numbers in the sequence are frequently seen in nature and in art, represented by spirals and the golden ratio. The easiest way to calculate the sequence is by setting up a table; however, this is impractical if you are looking for, for example, the 100th term in the sequence, in which case Binet’s formula can be used.  
 
The Fibonacci sequence is a pattern of numbers generated by summing the previous two numbers in the sequence. The numbers in the sequence are frequently seen in nature and in art, represented by spirals and the golden ratio. The easiest way to calculate the sequence is by setting up a table; however, this is impractical if you are looking for, for example, the 100th term in the sequence, in which case Binet’s formula can be used.  
  
[[Category:Algebra]]
+
[[Category: Algebra]]
  
 
== Steps ==
 
== Steps ==