Problem of the Day

17 October 2008

Problem. Let the sequence u1 , u2 , u3 , . . . be defined by

u1 = 1 and un+1 = un + 8n for all n 1.
Prove that un = (2n 1)2 for all n 1.
Solution. The proof is by induction on n. If n = 1, then u1 = 1 =
[2(1) 1]2 . Suppose the formula holds for some integer k 1; that is,
uk = (2k 1)2 . Then, by the recursive definition of the sequence and the
inductive hypothesis, we have
uk+1 = uk + 8k = (2k 1)2 + 8k = (2k + 1)2 = [2(k + 1) 1]2 .
Thus, the formula also holds for k + 1.