Finally, we will investigate some properties of the Fibonacci numbers. These are defined by F₁ = 1, F₂ = 1, and F F-1+ F
Posted: Tue Jul 12, 2022 12:08 pm
Finally, we will investigate some properties of the Fibonacci numbers. These are defined by F₁ = 1, F₂ = 1, and F F-1+ Fn-2 for n ≥ 3. So the first few are given by 1, 1, 2, 3, 5, 8,.... Let a = 15 and 3 = 1; these are the two roots of the polynomial r²-x-1=0. Theorem 2. For all ne N we have Fn = Proof. Hint: this should involve no unpleasant algebra. Use the polynomial. a"-3" √5