statement theorem
Binet's formula
Statement
Let be a natural number, and let be the -th Fibonacci number. Let be the golden ratio and let . Then
Remarks
The proof uses the characteristic polynomial of the recurrence. Its roots are and , so and are solutions, and the initial values fix the coefficients. Because , is the integer nearest to .
Explanations
L1 human
Fibonacci numbers are integers, but this formula uses , and the irrational parts cancel. The term with is very small, so is close to .
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Fibonacci sequence example
- Golden ratio object
- Binet's formula statement
Sources
- Web https://en.wikipedia.org/wiki/Fibonacci_sequence, Closed-form expression
What links here
No node links to this node yet.