{"status": "success", "data": {"description_md": "Call a number \"prime-looking\" if it is composite but not divisible by 2, 3, or 5. The three smallest prime-looking numbers are 49, 77, and 91. There are 168 prime numbers less than 1000. How many prime-looking numbers are there less than 1000?\n\n$(\\mathrm {A}) \\ 100 \\qquad (\\mathrm {B}) \\ 102 \\qquad (\\mathrm {C})\\ 104 \\qquad (\\mathrm {D}) \\ 106 \\qquad (\\mathrm {E})\\ 108$\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>Call a number &#8220;prime-looking&#8221; if it is composite but not divisible by 2, 3, or 5. The three smallest prime-looking numbers are 49, 77, and 91. There are 168 prime numbers less than 1000. How many prime-looking numbers are there less than 1000?</p>&#10;<p> <span class=\"katex--inline\">(\\mathrm {A}) \\ 100 \\qquad (\\mathrm {B}) \\ 102 \\qquad (\\mathrm {C})\\ 104 \\qquad (\\mathrm {D}) \\ 106 \\qquad (\\mathrm {E})\\ 108</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": "2005 AMC 12A Problem 18", "can_next": true, "can_prev": true, "nxt": "/problem/05_amc12A_p19", "prev": "/problem/05_amc12A_p17"}}