Finally, we will investigate some properties of the Fibonacci numbers. These are defined by F₁ = 1, F₂ = 1, and FnF-1+ F
Posted: Mon Jul 11, 2022 12:48 pm
Finally, we will investigate some properties of the Fibonacci numbers. These are defined by F₁ = 1, F₂ = 1, and FnF-1+ F-2 for n ≥ 3. So the first few are given by 1,1,2,3,5,8,.... Let a = ¹+3 and 3 = 1; these are the two roots of the polynomial z²-x-1=0. Theorem 2. For all ne N we have F₁ = 27 Proof. Hint: this should involve no unpleasant algebra. Use the polynomial. Corollary 1. For all n EN, F, is the closest integer to Proof. Hint: How big can F₁-be? Example. Using the corollary, we find that Fio Lemma 6. For all n E N we have 1 + F₂+ F ++ F2n = F2n+1- Proof. ... use a computer for this 0 0