2006 AIME I Problems/Problem 15

Revision as of 14:41, 25 August 2006 by JBL (talk | contribs)

Problem

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

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also