Math 2.0

Number theory Theorem

Binet's formula

Builds on Fibonacci sequenceGolden ratio

Statement

Let nn be a natural number, and let FnF_n be the nn-th Fibonacci number. Let φ=1+52\varphi = \frac{1 + \sqrt{5}}{2} be the golden ratio and let ψ=1−52\psi = \frac{1 - \sqrt{5}}{2}. Then Fn=φn−ψn5.F_n = \frac{\varphi^n - \psi^n}{\sqrt{5}}.

Remarks

The proof uses the characteristic polynomial x2−x−1x^2 - x - 1 of the recurrence. Its roots are φ\varphi and ψ\psi, so φn\varphi^n and ψn\psi^n are solutions, and the initial values fix the coefficients. Because ∣ψn/5∣<12|\psi^n / \sqrt{5}| < \frac{1}{2}, FnF_n is the integer nearest to φn/5\varphi^n / \sqrt{5}.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Fibonacci sequence example
  2. Golden ratio object
  3. Binet's formula statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Fibonacci_sequence, Closed-form expression
About this page
Tag0404D8TN7Y
URIm2://0404D8TN7Y
Kindstatement, theorem
WritingW1 stated
MSC11B39
StatusThis copy of the site has no build data. Run m2 status 0404D8TN7Y.
UsesFibonacci 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.