{"status": "success", "data": {"description_md": "Suppose that $|x_i| < 1$ for $i = 1, 2, \\ldots, n$. Suppose further that<br>\n$$ |x_1| + |x_2| + \\ldots + |x_n| = 19 + |x_1 + x_2 + \\ldots + x_n|. $$ What is the smallest possible value of $n$?\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>Suppose that <span class=\"katex--inline\">|x_i| &lt; 1</span> for <span class=\"katex--inline\">i = 1, 2, \\ldots, n</span>. Suppose further that<br/><span class=\"katex--display\"> |x_1| + |x_2| + \\ldots + |x_n| = 19 + |x_1 + x_2 + \\ldots + x_n|. </span><br/>What is the smallest possible value of <span class=\"katex--inline\">n</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": 3, "problem_name": "1988 AIME Problem 4", "can_next": true, "can_prev": true, "nxt": "/problem/88_aime_p05", "prev": "/problem/88_aime_p03"}}