{"year": "2008", "tier": "T4", "problem_label": "1", "problem_type": null, "exam": "HMMT", "problem": "Four students from Harvard, one of them named Jack, and five students from MIT, one of them named Jill, are going to see a Boston Celtics game. However, they found out that only 5 tickets remain, so 4 of them must go back. Suppose that at least one student from each school must go see the game, and at least one of Jack and Jill must go see the game, how many ways are there of choosing which 5 people can see the game?", "solution": "104 Let us count the number of way of distributing the tickets so that one of the conditions is violated. There is 1 way to give all the tickets to MIT students, and $\\binom{7}{5}$ ways to give all the tickets to the 7 students other than Jack and Jill. Therefore, the total number of valid ways is $\\binom{9}{5}-1-\\binom{7}{5}=104$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n1. [2]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "2", "problem_type": null, "exam": "HMMT", "problem": "Let $A B C$ be an equilateral triangle. Let $\\Omega$ be a circle inscribed in $A B C$ and let $\\omega$ be a circle tangent externally to $\\Omega$ as well as to sides $A B$ and $A C$. Determine the ratio of the radius of $\\Omega$ to the radius of $\\omega$.", "solution": "3 Same as Geometry Test problem 2.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n2. [2]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "3", "problem_type": null, "exam": "HMMT", "problem": "A $3 \\times 3 \\times 3$ cube composed of 27 unit cubes rests on a horizontal plane. Determine the number of ways of selecting two distinct unit cubes (order is irrelevant) from a $3 \\times 3 \\times 1$ block with the property that the line joining the centers of the two cubes makes a $45^{\\circ}$ angle with the horizontal plane.", "solution": "60 Same as Combinatorics Test problem 1.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n3. [3]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "4", "problem_type": null, "exam": "HMMT", "problem": "Suppose that $a, b, c, d$ are real numbers satisfying $a \\geq b \\geq c \\geq d \\geq 0, a^{2}+d^{2}=1, b^{2}+c^{2}=1$, and $a c+b d=1 / 3$. Find the value of $a b-c d$.", "solution": "$\\frac{2 \\sqrt{2}}{3}$ We have\n\n$$\n(a b-c d)^{2}=\\left(a^{2}+d^{2}\\right)\\left(b^{2}+c^{2}\\right)-(a c+b d)^{2}=(1)(1)-\\left(\\frac{1}{3}\\right)^{2}=\\frac{8}{9}\n$$\n\nSince $a \\geq b \\geq c \\geq d \\geq 0, a b-c d \\geq 0$, so $a b-c d=\\frac{2 \\sqrt{2}}{3}$.\nComment: Another way to solve this problem is to use the trigonometric substitutions $a=\\sin \\theta$, $b=\\sin \\phi, c=\\cos \\phi, d=\\cos \\theta$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n4. [3]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "5", "problem_type": null, "exam": "HMMT", "problem": "Kermit the frog enjoys hopping around the infinite square grid in his backyard. It takes him 1 Joule of energy to hop one step north or one step south, and 1 Joule of energy to hop one step east or one step west. He wakes up one morning on the grid with 100 Joules of energy, and hops till he falls asleep with 0 energy. How many different places could he have gone to sleep?", "solution": "10201 Same as Combinatorics Test problem 4.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n5. [4]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "6", "problem_type": null, "exam": "HMMT", "problem": "Determine all real numbers $a$ such that the inequality $\\left|x^{2}+2 a x+3 a\\right| \\leq 2$ has exactly one solution in $x$.", "solution": "1,2 Same as Algebra Test problem 3.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n6. [4]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "7", "problem_type": null, "exam": "HMMT", "problem": "A root of unity is a complex number that is a solution to $z^{n}=1$ for some positive integer $n$. Determine the number of roots of unity that are also roots of $z^{2}+a z+b=0$ for some integers $a$ and $b$.", "solution": "8 Same as Algebra Test problem 6.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n7. [5]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "8", "problem_type": null, "exam": "HMMT", "problem": "A piece of paper is folded in half. A second fold is made such that the angle marked below has measure $\\phi\\left(0^{\\circ}<\\phi<90^{\\circ}\\right)$, and a cut is made as shown below.\n![](https://cdn.mathpix.com/cropped/2025_01_24_ce90a631897bfd172843g-2.jpg?height=242&width=831&top_left_y=237&top_left_x=687)\n\nWhen the piece of paper is unfolded, the resulting hole is a polygon. Let $O$ be one of its vertices. Suppose that all the other vertices of the hole lie on a circle centered at $O$, and also that $\\angle X O Y=144^{\\circ}$, where $X$ and $Y$ are the the vertices of the hole adjacent to $O$. Find the value(s) of $\\phi$ (in degrees).", "solution": "$81^{\\circ}$ Same as Geometry Test problem 5.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n8. [5]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "9", "problem_type": null, "exam": "HMMT", "problem": "Let $A B C$ be a triangle, and $I$ its incenter. Let the incircle of $A B C$ touch side $B C$ at $D$, and let lines $B I$ and $C I$ meet the circle with diameter $A I$ at points $P$ and $Q$, respectively. Given $B I=$ $6, C I=5, D I=3$, determine the value of $(D P / D Q)^{2}$.", "solution": "$\\frac{75}{64}$ Same as Geometry Test problem 9.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n9. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "10", "problem_type": null, "exam": "HMMT", "problem": "Determine the number of 8-tuples of nonnegative integers ( $a_{1}, a_{2}, a_{3}, a_{4}, b_{1}, b_{2}, b_{3}, b_{4}$ ) satisfying $0 \\leq$ $a_{k} \\leq k$, for each $k=1,2,3,4$, and $a_{1}+a_{2}+a_{3}+a_{4}+2 b_{1}+3 b_{2}+4 b_{3}+5 b_{4}=19$.", "solution": "1540 Same as Combinatorics Test problem 10.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-gen2-solutions.jsonl", "problem_match": "\n10. [6]", "solution_match": "\nAnswer: "}}