{"status": "success", "data": {"description_md": "Several sets of prime numbers, such as $\\{7,83,421,659\\}$ use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?\n\n$\\text{(A) }193<br>\\qquad<br>\\text{(B) }207<br>\\qquad<br>\\text{(C) }225<br>\\qquad<br>\\text{(D) }252<br>\\qquad<br>\\text{(E) }447$\n___\nFull 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>Several sets of prime numbers, such as  <span class=\"katex--inline\">\\{7,83,421,659\\}</span>  use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?</p>&#10;<p> <span class=\"katex--inline\">\\text{(A) }193\\qquad\\text{(B) }207\\qquad\\text{(C) }225\\qquad\\text{(D) }252\\qquad\\text{(E) }447</span> </p>&#10;<hr><p>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": "2002 AMC 12A Problem 17", "can_next": true, "can_prev": true, "nxt": "/problem/02_amc12A_p18", "prev": "/problem/02_amc12A_p16"}}