{"status": "success", "data": {"description_md": "How many rearrangements of $abcd$ are there in which no two adjacent letters are also adjacent letters in the alphabet?  For example, no such rearrangements could include either $ab$ or $ba$.\n\n$\\textbf{(A)}\\ 0\\qquad\\textbf{(B)}\\ 1\\qquad\\textbf{(C)}\\ 2\\qquad\\textbf{(D)}\\ 3\\qquad\\textbf{(E)}\\ 4$", "description_html": "<p>How many rearrangements of  <span class=\"katex--inline\">abcd</span>  are there in which no two adjacent letters are also adjacent letters in the alphabet?  For example, no such rearrangements could include either  <span class=\"katex--inline\">ab</span>  or  <span class=\"katex--inline\">ba</span> .</p>\n<p> <span class=\"katex--inline\">\\textbf{(A)}\\ 0\\qquad\\textbf{(B)}\\ 1\\qquad\\textbf{(C)}\\ 2\\qquad\\textbf{(D)}\\ 3\\qquad\\textbf{(E)}\\ 4</span> </p>\n<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": 1, "problem_name": "2015 AMC 10A Problem 10", "can_next": true, "can_prev": true, "nxt": "/problem/15_amc10A_p11", "prev": "/problem/15_amc10A_p09"}}