{"status": "success", "data": {"description_md": "Ms. Math's kindergarten class has $16$ registered students. The classroom has a very large number, $N$, of play blocks which satisfies the conditions:<br><br>(a) If $16$, $15$, or $14$ students are present, then in each case all the blocks can be distributed in equal numbers to each student, and<br>(b) There are three integers $0 < x < y < z < 14$ such that when $x$, $y$, or $z$ students are present and the blocks are distributed in equal numbers to each student, there are exactly three blocks left over.<br><br>Find the sum of the distinct prime divisors of the least possible value of $N$ satisfying the above conditions.\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>Ms. Math&#8217;s kindergarten class has <span class=\"katex--inline\">16</span> registered students. The classroom has a very large number, <span class=\"katex--inline\">N</span>, of play blocks which satisfies the conditions:<br/><br/>(a) If <span class=\"katex--inline\">16</span>, <span class=\"katex--inline\">15</span>, or <span class=\"katex--inline\">14</span> students are present, then in each case all the blocks can be distributed in equal numbers to each student, and<br/>(b) There are three integers <span class=\"katex--inline\">0 &lt; x &lt; y &lt; z &lt; 14</span> such that when <span class=\"katex--inline\">x</span>, <span class=\"katex--inline\">y</span>, or <span class=\"katex--inline\">z</span> students are present and the blocks are distributed in equal numbers to each student, there are exactly three blocks left over.<br/><br/>Find the sum of the distinct prime divisors of the least possible value of <span class=\"katex--inline\">N</span> satisfying the above conditions.</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": 5, "problem_name": "2013 AIME I Problem 11", "can_next": true, "can_prev": true, "nxt": "/problem/13_aime_I_p12", "prev": "/problem/13_aime_I_p10"}}