# Question: exercise 862 proofs by strong induction explicit formulas for...

###### Question details

Exercise 8.6.2: Proofs by strong induction - explicit formulas for recurrence relations. info About Prove each of the following statements using strong induction. (a) The Fibonacci sequence is defined as follows: f0 = 0 f1 = 1 fn = fn-1 + fn-2, for n ≥ 2 Prove that for n ≥ 0, fn=15‾√[(1+5‾√2)n−(1−5‾√2)n]