In Exercises let fn denote the nth Fibonacci number.
Show that fn+m = fm fn+1 + fm − 1 fn whenever m and n are positive integers with m > 1. Use this result to show that fn ∣ fm when m and n are positive integers with n ∣ m.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.