{"status": "success", "data": {"description_md": "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}|$.\n___\nLeading zeroes must be inputted, so if your answer is `34`, then input `034`. Full credit goes to [MAA](https://maa.org/) for authoring these problems. These problems were taken on the [AOPS](https://artofproblemsolving.com/) website.", "description_html": "<p>Given that a sequence satisfies <span class=\"katex--inline\">x_0=0</span> and <span class=\"katex--inline\">|x_k|=|x_{k-1}+3|</span> for all integers <span class=\"katex--inline\">k\\ge 1,</span> find the minimum possible value of <span class=\"katex--inline\">|x_1+x_2+\\cdots+x_{2006}|</span>.</p>&#10;<hr><p>Leading zeroes must be inputted, so if your answer is <code>34</code>, then input <code>034</code>. Full credit goes to <a href=\"https://maa.org/\">MAA</a> for authoring these problems. These problems were taken on the <a href=\"https://artofproblemsolving.com/\">AOPS</a> website.</p>", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 6, "problem_name": "2006 AIME I Problem 15", "can_next": false, "can_prev": true, "nxt": "", "prev": "/problem/06_aime_I_p14"}}