The Fibonacci sequence, (fn) n∈N, is defined recursively as follows:
f0 = f1 = 1,
fn = fn-2 + fn-1 (n ≥ 2)
Demonstrate for all n ∈ N:
If n ≥ 1, then fn-1 ⋅fn + 1 = f ^ 2n - (- 1) ^ n
.
f0 = f1 = 1,
fn = fn-2 + fn-1 (n ≥ 2)
Demonstrate for all n ∈ N:
If n ≥ 1, then fn-1 ⋅fn + 1 = f ^ 2n - (- 1) ^ n
.
1 answer
3 answers
0 answers
3 answers