{"status": "success", "data": {"description_md": "There are $52$ people in a room.  What is the largest value of $n$ such that the statement \"At least $n$ people in this room have birthdays falling in the same month\" is always true?\n\n$\\textbf{(A)}\\ 2 \\qquad\\textbf{(B)}\\ 3 \\qquad\\textbf{(C)}\\ 4 \\qquad\\textbf{(D)}\\ 5 \\qquad\\textbf{(E)}\\ 12$", "description_html": "<p>There are  <span class=\"katex--inline\">52</span>  people in a room.  What is the largest value of  <span class=\"katex--inline\">n</span>  such that the statement &#8220;At least  <span class=\"katex--inline\">n</span>  people in this room have birthdays falling in the same month&#8221; is always true?</p>\n<p> <span class=\"katex--inline\">\\textbf{(A)}\\ 2 \\qquad\\textbf{(B)}\\ 3 \\qquad\\textbf{(C)}\\ 4 \\qquad\\textbf{(D)}\\ 5 \\qquad\\textbf{(E)}\\ 12</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": 3, "problem_name": "2011 AMC 10B Problem 11", "can_next": true, "can_prev": true, "nxt": "/problem/11_amc10B_p12", "prev": "/problem/11_amc10B_p10"}}