Suppose that f0, f1, f2, ... is a sequence defined as follows:
f0 = 5, f1 = 16
fk = 7 fk–1 – 10 fk–2 for all integers k ≥ 2.
Prove that fn = 3•2n + 2•5n for all integers n ≥ 0.
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.