A sequence c0, c1, c2, ... is defined by letting c0 = 3 and ck = (ck–1)2 for all integers k ≥ 1. Show that cn = 32n 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.