Binet's formula
Builds on Fibonacci sequenceGolden ratio
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 .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Fibonacci sequence example
- Golden ratio object
- Binet's formula statement
Further reading
- Web https://en.wikipedia.org/wiki/Fibonacci_sequence, Closed-form expression
About this page
| Tag | 0404D8TN7Y |
|---|---|
| URI | m2://0404D8TN7Y |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 11B39 |
| Status | This copy of the site has no build data. Run m2 status 0404D8TN7Y. |
| Uses | Fibonacci sequence, Golden ratio |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.