{"status": "success", "data": {"description_md": "Given a positive integer $n$, let $p(n)$ be the product of the non-zero digits of $n$. (If $n$ has only one digits, then $p(n)$ is equal to that digit.) Let $$ S=p(1)+p(2)+p(3)+\\cdots+p(999). $$ What is the largest prime factor of $S$?\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 a positive integer <span class=\"katex--inline\">n</span>, let <span class=\"katex--inline\">p(n)</span> be the product of the non-zero digits of <span class=\"katex--inline\">n</span>. (If <span class=\"katex--inline\">n</span> has only one digits, then <span class=\"katex--inline\">p(n)</span> is equal to that digit.) Let <span class=\"katex--display\"> S=p(1)+p(2)+p(3)+\\cdots+p(999). </span> What is the largest prime factor of <span class=\"katex--inline\">S</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": "1994 AIME Problem 5", "can_next": true, "can_prev": true, "nxt": "/problem/94_aime_p06", "prev": "/problem/94_aime_p04"}}