2006 AIME I Problem 15

Attempt Problem 15 of the 2006 AIME I below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2006 AIME I solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

15.

Given that a sequence satisfies x0=0x_0 = 0 and xk=xk1+3|x_k| = |x_{k-1} + 3| for all integers k1,k \ge 1, find the minimum possible value of x1+x2++x2006.|x_1 + x_2 + \cdots + x_{2006}|.

Answer: 27
Concepts:recursiontelescopingparityoptimization
Difficulty rating: 3370
Solution:

Squaring the recurrence gives xk2=(xk1+3)2x_k^2 = (x_{k-1} + 3)^2 =xk12+6xk1+9.= x_{k-1}^2 + 6 x_{k-1} + 9. Summing for k=1k = 1 to 20072007 telescopes: x20072=x02+6k=02006xk+92007,x_{2007}^2 = x_0^2 + 6 \sum_{k=0}^{2006} x_k + 9 \cdot 2007, so with x0=0,x_0 = 0, x1+x2++x2006=x20072180636. \begin{aligned} &x_1 + x_2 + \cdots + x_{2006} \\ &= \frac{x_{2007}^2 - 18063}{6}. \end{aligned}

Induction shows each xkx_k is a multiple of 33 whose parity matches that of k,k, so x2007x_{2007} is an odd multiple of 3.3. To minimize x2007218063,\left|x_{2007}^2 - 18063\right|, take the odd multiple of 33 whose square is nearest 18063:18063: that is ±135,\pm 135, with 1352=18225,135^2 = 18225, giving 18225180636=27\frac{18225 - 18063}{6} = 27 (the neighbors 129129 and 141141 give 237237 and 303303).

This value is attained: take xk=3kx_k = 3k for k45,k \le 45, and thereafter alternate xk=138x_k = -138 for even kk and xk=135x_k = 135 for odd k;k; then x2007=135x_{2007} = 135 and the sum is 27.27. So the minimum is 27.27.

← Problem 14#14
Full Exam

Problem 15 in Other Years