Suppose b1, b2, b3, ... is a sequence defined as follows:
b1 = 4, b2 = 12
bk = bk–2 + bk–1 for all integers k ≥ 3.
Prove that bn is divisible by 4 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.