{"status": "success", "data": {"description_md": "Functions $f$ and $g$ are quadratic, $g(x) = - f(100 - x)$, and the graph of $g$ contains the vertex of the graph of $f$. The four $x$-intercepts on the two graphs have $x$-coordinates $x_1$, $x_2$, $x_3$, and $x_4$, in increasing order, and $x_3 - x_2 = 150$. Then $x_4 - x_1 = m + n\\sqrt p$, where $m$, $n$, and $p$ are positive integers, and $p$ is not divisible by the square of any prime. What is $m + n + p$?\n\n$\\textbf{(A)}\\ 602\\qquad \\textbf{(B)}\\ 652\\qquad \\textbf{(C)}\\ 702\\qquad \\textbf{(D)}\\ 752 \\qquad \\textbf{(E)}\\ 802$\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>Functions  <span class=\"katex--inline\">f</span>  and  <span class=\"katex--inline\">g</span>  are quadratic,  <span class=\"katex--inline\">g(x) = - f(100 - x)</span> , and the graph of  <span class=\"katex--inline\">g</span>  contains the vertex of the graph of  <span class=\"katex--inline\">f</span> . The four  <span class=\"katex--inline\">x</span> -intercepts on the two graphs have  <span class=\"katex--inline\">x</span> -coordinates  <span class=\"katex--inline\">x_1</span> ,  <span class=\"katex--inline\">x_2</span> ,  <span class=\"katex--inline\">x_3</span> , and  <span class=\"katex--inline\">x_4</span> , in increasing order, and  <span class=\"katex--inline\">x_3 - x_2 = 150</span> . Then  <span class=\"katex--inline\">x_4 - x_1 = m + n\\sqrt p</span> , where  <span class=\"katex--inline\">m</span> ,  <span class=\"katex--inline\">n</span> , and  <span class=\"katex--inline\">p</span>  are positive integers, and  <span class=\"katex--inline\">p</span>  is not divisible by the square of any prime. What is  <span class=\"katex--inline\">m + n + p</span> ?</p>&#10;<p> <span class=\"katex--inline\">\\textbf{(A)}\\ 602\\qquad \\textbf{(B)}\\ 652\\qquad \\textbf{(C)}\\ 702\\qquad \\textbf{(D)}\\ 752 \\qquad \\textbf{(E)}\\ 802</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": 5, "problem_name": "2009 AMC 12A Problem 23", "can_next": true, "can_prev": true, "nxt": "/problem/09_amc12A_p24", "prev": "/problem/09_amc12A_p22"}}