The answers to exercises marked [BB] can be found in the Back of the Book.
[BB] Let a1, a2, a3,… be the sequence defined by a1 = 1, a2 = 0 and, for n > 2, an = 4an−1 − 4an−2. Prove that for all 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.