Refer to the sequence c1, c2, … defined by the equations
c1 = 0, cn = c[n/2] + n2 for all n > 1.
Prove that cn < 4n2 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.