{"year": "2007", "tier": "T4", "problem_label": "1", "problem_type": null, "exam": "HMMT", "problem": "A cube of edge length $s>0$ has the property that its surface area is equal to the sum of its volume and five times its edge length. Compute all possible values of $s$.", "solution": "1,5. Same as Geometry \\#1.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n1. [2]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "2", "problem_type": null, "exam": "HMMT", "problem": "A parallelogram has 3 of its vertices at $(1,2),(3,8)$, and $(4,1)$. Compute the sum of all possible $x$ coordinates of the 4th vertex.", "solution": "8. There are three possibilities: the 4th vertex must be opposite one of the three given vertices. These three possibilities have as a medial triangle the three given vertices, so the sum of their $x$ coordinates is the same as the sum of the $x$ coordinates of the given triangle.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n2. [2]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "3", "problem_type": null, "exam": "HMMT", "problem": "Compute\n\n$$\n\\left\\lfloor\\frac{2007!+2004!}{2006!+2005!}\\right\\rfloor\n$$\n\n(Note that $\\lfloor x\\rfloor$ denotes the greatest integer less than or equal to $x$.)", "solution": "2006. Same as Algebra \\#1.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n3. [3]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "4", "problem_type": null, "exam": "HMMT", "problem": "Three brothers Abel, Banach, and Gauss each have portable music players that can share music with each other. Initially, Abel has 9 songs, Banach has 6 songs, and Gauss has 3 songs, and none of these songs are the same. One day, Abel flips a coin to randomly choose one of his brothers and he adds all of that brother's songs to his collection. The next day, Banach flips a coin to randomly choose one of his brothers and he adds all of that brother's collection of songs to his collection. Finally, each brother randomly plays a song from his collection with each song in his collection being equally likely to be chosen. What is the probability that they all play the same song?", "solution": "$\\frac{\\mathbf{1}}{\\mathbf{2 8 8}}$. If Abel copies Banach's songs, this can never happen. Therefore, we consider only the cases where Abel copies Gauss's songs. Since all brothers have Gauss's set of songs, the probability that they play the same song is equivalent to the probability that they independently match whichever song Gauss chooses. Case 1: Abel copies Gauss and Banach copies Gauss (1/4 chance) - The probability of songs matching is then $1 / 12 \\cdot 1 / 9$. Case 2: Abel copies Gauss and Banach copies Abel ( $1 / 4$ probability) - The probability of songs matching is then $1 / 12 \\cdot 1 / 18$. We add the two probabilities together to get $1 / 4 \\cdot 1 / 12 \\cdot(1 / 9+1 / 18)=1 / 288$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n4. [3]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "5", "problem_type": null, "exam": "HMMT", "problem": "A best of 9 series is to be played between two teams. That is, the first team to win 5 games is the winner. One of the teams, the Mathletes, has a $2 / 3$ chance of winning any given game. What is the probability that the winner is determined in the 7th game?", "solution": "| $\\mathbf{2 0}$ |\n| :---: |\n| $\\mathbf{8 1}$ | . If the Mathletes are the winners, they must win the 7 th game and have won exactly four of the previous 6 games. The probability of this occurring is\n\n$$\n\\left((2 / 3)^{4} \\cdot(1 / 3)^{2} \\cdot\\binom{6}{2}\\right) \\cdot(2 / 3)\n$$\n\nAnalogously, the other team wins with probability $\\left((1 / 3)^{4} \\cdot(2 / 3)^{2} \\cdot\\binom{6}{2}\\right) \\cdot(1 / 3)$. Summing, the probability is\n\n$$\n\\frac{\\binom{6}{2} \\cdot 2^{2} \\cdot\\left(2^{3} \\cdot 1^{2}+1^{5}\\right)}{3^{7}}=\\frac{5 \\cdot 4}{3^{4}}=\\frac{20}{81}\n$$", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n5. [4]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "6", "problem_type": null, "exam": "HMMT", "problem": "Circle $\\omega$ has radius 5 and is centered at $O$. Point $A$ lies outside $\\omega$ such that $O A=13$. The two tangents to $\\omega$ passing through $A$ are drawn, and points $B$ and $C$ are chosen on them (one on each\ntangent), such that line $B C$ is tangent to $\\omega$ and $\\omega$ lies outside triangle $A B C$. Compute $A B+A C$ given that $B C=7$.", "solution": "17. Same as Geometry \\#4.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n6. [4]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "7", "problem_type": null, "exam": "HMMT", "problem": "My friend and I are playing a game with the following rules: If one of us says an integer $n$, the opponent then says an integer of their choice between $2 n$ and $3 n$, inclusive. Whoever first says 2007 or greater loses the game, and their opponent wins. I must begin the game by saying a positive integer less than 10 . With how many of them can I guarantee a win?", "solution": "6. We assume optimal play and begin working backward. I win if I say any number between 1004 and 2006. Thus, by saying such a number, my friend can force a win for himself if I ever say a number between 335 and 1003. Then I win if I say any number between 168 and 334 , because my friend must then say one of the losing numbers just considered. Similarly, I lose by saying 56 through 167 , win by saying 28 through 55 , lose with 10 through 17 , win with 5 through 9 , lose with 2 through 4 , and win with 1 .", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n7. [4]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "8", "problem_type": null, "exam": "HMMT", "problem": "Compute the number of sequences of numbers $a_{1}, a_{2}, \\ldots, a_{10}$ such that\n\n$$\n\\begin{aligned}\n& \\text { I. } a_{i}=0 \\text { or } 1 \\text { for all } i \\\\\n& \\text { II. } a_{i} \\cdot a_{i+1}=0 \\text { for } i=1,2, \\ldots, 9 \\\\\n& \\text { III. } a_{i} \\cdot a_{i+2}=0 \\text { for } i=1,2, \\ldots, 8\n\\end{aligned}\n$$", "solution": "60. Call such a sequence \"good,\" and let $A_{n}$ be the number of good sequences of length $n$. Let $a_{1}, a_{2}, \\ldots, a_{n}$ be a good sequence. If $a_{1}=0$, then $a_{1}, a_{2}, \\ldots, a_{n}$ is a good sequence if and only if $a_{2}, \\ldots, a_{n}$ is a good sequence, so there are $A_{n-1}$ of them. If $a_{1}=1$, then we must have $a_{2}=a_{3}=0$, and in this case, $a_{1}, a_{2}, \\ldots, a_{n}$ is a good sequence if and only if $a_{4}, a_{5}, \\ldots, a_{n}$ is a good sequence, so there are $A_{n-3}$ of them. We thus obtain the recursive relation $A_{n}=A_{n-1}+A_{n-3}$. Note that $A_{1}=2, A_{2}=3, A_{3}=4$. Plugging these into the recursion eventually yields $A_{10}=60$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n8. [5]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "9", "problem_type": null, "exam": "HMMT", "problem": "Let $A:=\\mathbb{Q} \\backslash\\{0,1\\}$ denote the set of all rationals other than 0 and 1. A function $f: A \\rightarrow \\mathbb{R}$ has the property that for all $x \\in A$,\n\n$$\nf(x)+f\\left(1-\\frac{1}{x}\\right)=\\log |x|\n$$\n\nCompute the value of $f(2007)$.", "solution": "$\\log (\\mathbf{2 0 0 7} / \\mathbf{2 0 0 6})$. Same as Algebra \\#8.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n9. [6]", "solution_match": "\nAnswer: "}}
{"year": "2007", "tier": "T4", "problem_label": "10", "problem_type": null, "exam": "HMMT", "problem": "$A B C D$ is a convex quadrilateral such that $A B=2, B C=3, C D=7$, and $A D=6$. It also has an incircle. Given that $\\angle A B C$ is right, determine the radius of this incircle.", "solution": "$\\frac{1+\\sqrt{13}}{3}$. Same as Geometry $\\# 10$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl", "problem_match": "\n10. [7]", "solution_match": "\nAnswer: "}}