{"status": "success", "data": {"description_md": "There are $100$ players in a single tennis tournament. The tournament is single elimination, meaning that a player who loses a match is eliminated. In the first round, the strongest $28$ players are given a bye, and the remaining $72$ players are paired off to play. After each round, the remaining players play in the next round. The tournament continues until only one player remains unbeaten. The total number of matches played is\n\n$\\textbf{(A) } \\text{a prime number} \\qquad\\textbf{(B) } \\text{divisible by 2} \\qquad\\textbf{(C) } \\text{divisible by 5} \\qquad\\textbf{(D) } \\text{divisible by 7} \\qquad\\textbf{(E) } \\text{divisible by 11}$", "description_html": "<p>There are  <span class=\"katex--inline\">100</span>  players in a single tennis tournament. The tournament is single elimination, meaning that a player who loses a match is eliminated. In the first round, the strongest  <span class=\"katex--inline\">28</span>  players are given a bye, and the remaining  <span class=\"katex--inline\">72</span>  players are paired off to play. After each round, the remaining players play in the next round. The tournament continues until only one player remains unbeaten. The total number of matches played is</p>\n<p> <span class=\"katex--inline\">\\textbf{(A) } \\text{a prime number} \\qquad\\textbf{(B) } \\text{divisible by 2} \\qquad\\textbf{(C) } \\text{divisible by 5} \\qquad\\textbf{(D) } \\text{divisible by 7} \\qquad\\textbf{(E) } \\text{divisible by 11}</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": "2003 AMC 10B Problem 15", "can_next": true, "can_prev": true, "nxt": "/problem/03_amc10B_p16", "prev": "/problem/03_amc10B_p14"}}