Suppose that g1, g2, g3, ... is a sequence defined as follows:
g1 = 3, g2 = 5
gk = 3gk-1–2gk–2 for all integers k ≥ 3.
Prove that gn = 2n + 1 for all integers n ≥ 1.
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.