Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.4.8 (New proof of $L_n = \lambda^n + \mu^n$ ($\lambda, \mu$ roots of $x^2 - x -1$))

Exercise 4.4.8 (New proof of $L_n = \lambda^n + \mu^n$ ($\lambda, \mu$ roots of $x^2 - x -1$))

By induction on n , prove that L n = F n 1 + F n + 1 for all positive n . Then use (4.6) to give a second proof of (4.7).

Answers

Proof.

(a)
By definition of these two sequences, F 0 = 0 , F 1 = 1 , n , F n + 2 = F n + 1 + F n , L 0 = 2 , L 1 = 1 , n , L n + 2 = L n + 1 + L n .

We prove by induction on n 1 the property

𝒫 ( n ) : L n = F n 1 + F n + 1 .

  • F 0 + F 2 = 1 = L 1 , and F 1 + F 3 = 3 = L 2 , so 𝒫 ( 1 ) and 𝒫 ( 2 ) are true.
  • Suppose now that for some n 1 , 𝒫 ( n ) and 𝒫 ( n + 1 ) are true, so that

    L n = F n 1 + F n + 1 , L n + 1 = F n + F n + 2 .

    Then

    L n + 2 = L n + L n + 1 = ( F n 1 + F n + 1 ) + ( F n + F n + 2 ) = ( F n 1 + F n ) + ( F n + 1 + F n + 2 ) = F n + 1 + F n + 3 .

    This shows that 𝒫 ( n + 2 ) is true, and the induction is done.

  • In conclusion,

    n , L n = F n 1 + F n + 1 .

(b)
With the same notations as in the preceding problems, λ = 1 5 2 , μ = 1 + 5 2 ,

We know by (4.6) that for all n ,

F n = μ n λ n μ λ .

Since λ , μ are the roots of x 2 x 1 ,

λμ = 1 .

By part (a), for all n 1 ,

L n = F n 1 + F n + 1 = μ n + 1 λ n + 1 + μ n 1 λ n 1 μ λ = ( μ λ ) ( λ n + μ n ) + ( 1 + μλ ) ( μ n 1 λ n 1 ) μ λ = ( μ λ ) ( λ n + μ n ) μ λ ( since  λμ = 1 ) = λ n + μ n .

This shows anew (4.7):

L n = λ n + μ n = ( 1 + 5 2 ) n + ( 1 5 2 ) n ( n ) .

User profile picture
2025-02-07 09:40
Comments