Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.4.7 ($F_{m+n} = F_{m-1} F_n + F_m F_{n+1}$, and $m \mid n \Rightarrow F_m \mid F_n$)

Exercise 4.4.7 ($F_{m+n} = F_{m-1} F_n + F_m F_{n+1}$, and $m \mid n \Rightarrow F_m \mid F_n$)

Prove that F m + n = F m 1 F n + F m F n + 1 for any positive n . Then prove that F m F n if m n .

Hint. Let n = mq , and induct on q .

Answers

Proof.

(a)
As in the second proof of Problem 6, put for every positive integer n , A = ( 0 1 1 1 ) , X n = ( F n F n + 1 ) , V n = ( F n 1 F n F n F n + 1 ) .

Then, for all n , X n = A X n 1 , V n = A V n 1 and

V n = ( F n 1 F n F n F n + 1 ) = ( 0 1 1 1 ) n = A n .

(see Problem 6).

Now X n + m = A m X n , so

( F n + m F n + m + 1 ) = A m X n = V m X n = ( F m 1 F m F m F m + 1 ) ( F n F n + 1 ) = ( F m 1 F n + F m F n + 1 F m F n + F m F n + 1 ) .

In particular, for all positive integers m , n ,

F n + m = F m 1 F n + F m F n + 1 .

(Alternatively, we can reason by induction on n , but this induction is just a verification of the preceding relations.)

(b)
Let m be a positive integer. We show by induction on q 1 the property 𝒫 ( q ) : F m F qm

  • F m F m , so 𝒫 ( 1 ) is true.
  • Suppose now that F m F qm for some q 1 . Then we apply part (a) with n = qm . We obtain

    F m + qm = F m 1 F qm + F m F qm + 1 .

    By the induction hypothesis F m F qm , thus F m F m 1 F qm + F m F qm + 1 = F ( q + 1 ) m , so 𝒫 ( q + 1 ) is true.

  • The induction is done, so for all positive integers m , n ,

    m n F m F n .

User profile picture
2025-02-06 11:36
Comments