{"year": "2009", "tier": "T4", "problem_label": "1", "problem_type": null, "exam": "HMMT", "problem": "Evaluate the sum:\n\n$$\n11^{2}-1^{2}+12^{2}-2^{2}+13^{2}-3^{2}+\\ldots+20^{2}-10^{2}\n$$", "solution": "2100 This sum can be written as $\\sum_{a=1}^{10}(a+10)^{2}-a^{2}=\\sum_{a=1}^{10} 10(2 a+10)=10 * 10 *$ $11+10 * 10 * 10=2100$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n1. [2]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "2", "problem_type": null, "exam": "HMMT", "problem": "Given that $a+b+c=5$ and that $1 \\leq a, b, c \\leq 2$, what is the minimum possible value of $\\frac{1}{a+b}+\\frac{1}{b+c}$ ?", "solution": "| $\\frac{4}{7}$ | If $a>1$ and $b<2$, we can decrease the sum by decreasing $a$ and increasing $b$. You can |\n| :---: | :---: | follow a similar procedure if $c>1$ and $b<2$. Therefore, the sum is minimized when $b=2$. We can then cross-multiply the two fractions and see that we are trying to minimize $\\frac{a+c+4}{(a+2)(c+2)}=\\frac{7}{(a+2)(c+2)}$. The product of two numbers with a fixed sum is maximized when those two numbers are equal, so $\\frac{7}{(a+2)(c+2)}$ is minimized for $a=c=\\frac{3}{2}$, which gives us an answer of $\\frac{4}{7}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n2. [3]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "3", "problem_type": null, "exam": "HMMT", "problem": "What is the period of the function $f(x)=\\cos (\\cos (x))$ ?", "solution": "$\\pi$ Since $f(x)$ never equals $\\cos (1)$ for $x \\in(0, \\pi)$ but $f(0)=\\cos (1)$, the period is at least $\\pi$. However, $\\cos (x+\\pi)=-\\cos (x)$, so $\\cos (\\cos (x+\\pi))=\\cos (\\cos (x))$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n3. [3]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "4", "problem_type": null, "exam": "HMMT", "problem": "How many subsets $A$ of $\\{1,2,3,4,5,6,7,8,9,10\\}$ have the property that no two elements of $A$ sum to 11 ?", "solution": "243 For each element listed, there is exactly one other element such that the two elements sum to 11. Thus, we can list all the 10 numbers above as 5 pairs of numbers, such that each pair sums to 11. The problem then can be solved as follows: in any given subset with no two elements summing to 11 , at most one element from each pair can be present. Thus, there are 3 ways in which each pair can contribute to a given subset (no element, the first element in the pair, or the second element in the pair). Since there are 5 pairs, the total number of ways to construct a subset with no two elements summing to 11 is $3^{5}=243$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n4. [4]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "5", "problem_type": null, "exam": "HMMT", "problem": "A polyhedron has faces that are all either triangles or squares. No two square faces share an edge, and no two triangular faces share an edge. What is the ratio of the number of triangular faces to the number of square faces?", "solution": "| $\\frac{4}{3}$ | Let $s$ be the number of square faces and $t$ be the number of triangular faces. Every |\n| :---: | :---: | :---: | edge is adjacent to exactly one square face and one triangular face. Therefore, the number of edges is equal to $4 s$, and it is also equal to $3 t$. Thus $4 s=3 t$ and $\\frac{t}{s}=\\frac{4}{3}$", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n5. [5]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "6", "problem_type": null, "exam": "HMMT", "problem": "Find the maximum value of $x+y$, given that $x^{2}+y^{2}-3 y-1=0$.", "solution": "$\\frac{\\sqrt{26}+3}{2}$ We can rewrite $x^{2}+y^{2}-3 y-1=0$ as $x^{2}+\\left(y-\\frac{3}{2}\\right)^{2}=\\frac{13}{4}$. We then see that the set of solutions to $x^{2}-y^{2}-3 y-1=0$ is the circle of radius $\\frac{\\sqrt{13}}{2}$ and center $\\left(0, \\frac{3}{2}\\right)$. This can be written as $x=\\frac{\\sqrt{13}}{2} \\cos (\\theta)$ and $y=\\frac{\\sqrt{13}}{2} \\sin (\\theta)+\\frac{3}{2}$. Thus, $x+y=\\frac{3}{2}+\\frac{\\sqrt{13}}{2}(\\cos (\\theta)+\\sin (\\theta))=\\frac{3}{2}+\\frac{\\sqrt{13}}{2} \\sqrt{2} \\sin \\left(\\theta+45^{\\circ}\\right)$, which is maximized for $\\theta=45^{\\circ}$ and gives $\\frac{\\sqrt{26}+3}{2}$. (We could also solve this geometrically by noting that if $x+y$ attains a maximum value of $s$ then the line $x+y=s$ is tangent to the circle.)", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n6. [5]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "7", "problem_type": null, "exam": "HMMT", "problem": "There are 15 stones placed in a line. In how many ways can you mark 5 of these stones so that there are an odd number of stones between any two of the stones you marked?", "solution": "77 Number the stones 1 through 15 in order. We note that the condition is equivalent to stipulating that the stones have either all odd numbers or all even numbers. There are $\\binom{8}{5}$ ways to choose 5 odd-numbered stones, and $\\binom{7}{5}$ ways to choose all even-numbered stones, so the total number\nof ways to pick the stones is $\\binom{8}{5}+\\binom{7}{5}=77$. $\\binom{n}{k}$ is the number of ways to choose $k$ out of $n$ items. It equals $\\left.\\frac{n!}{k!(n-k)!}\\right)$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n7. [6]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "8", "problem_type": null, "exam": "HMMT", "problem": "Let $\\triangle A B C$ be an equilateral triangle with height 13 , and let $O$ be its center. Point $X$ is chosen at random from all points inside $\\triangle A B C$. Given that the circle of radius 1 centered at $X$ lies entirely inside $\\triangle A B C$, what is the probability that this circle contains $O$ ?", "solution": "$\\frac{\\sqrt{3} \\pi}{100}$ The set of points $X$ such that the circle of radius 1 centered at $X$ lies entirely inside $\\triangle A B C$ is itself a triangle, $A^{\\prime} B^{\\prime} C^{\\prime}$, such that $A B$ is parallel to $A^{\\prime} B^{\\prime}, B C$ is parallel to $B^{\\prime} C^{\\prime}$, and $C A$ is parallel to $C^{\\prime} A^{\\prime}$, and furthermore $A B$ and $A^{\\prime} B^{\\prime}, B C$ and $B^{\\prime} C^{\\prime}$, and $C A$ and $C^{\\prime} A^{\\prime}$ are all 1 unit apart. We can use this to calculate that $A^{\\prime} B^{\\prime} C^{\\prime}$ is an equilateral triangle with height 10, and hence has area $\\frac{100}{\\sqrt{3}}$. On the other hand, the set of points $X$ such that the circle of radius 1 centered at $X$ contains $O$ is a circle of radius 1 , centered at $O$, and hence has area $\\pi$. The probability that the circle centered at $X$ contains $O$ given that it also lies in $A B C$ is then the ratio of the two areas, that is, $\\frac{\\pi}{\\frac{100}{\\sqrt{3}}}=\\frac{\\sqrt{3} \\pi}{100}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n8. [7]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "9", "problem_type": null, "exam": "HMMT", "problem": "A set of points is convex if the points are the vertices of a convex polygon (that is, a non-selfintersecting polygon with all angles less than or equal to $180^{\\circ}$ ). Let $S$ be the set of points $(x, y)$ such that $x$ and $y$ are integers and $1 \\leq x, y \\leq 26$. Find the number of ways to choose a convex subset of $S$ that contains exactly 98 points.", "solution": "4958 For this problem, let $n=26$. A convex set may be divided into four subsets: a set of points with maximal $y$ coordinate, a set of points with minimal $y$ coordinate, the points to the left of one of these subsets, and the points to the right of one of these subsets (the left, top, right, and bottom of the corresponding convex polygon). Each of these four parts contains at most $n$ points. (All points in the top or bottom have distinct $x$ coordinates while all points in the left or right have distinct $y$ coordinates.) Moreover, there are four corners each of which is contained in two of these regions. This implies that at most $4 n-4$ distinct points are in any convex set. To find a set of size $4 n-6$ we can remove 2 additional points. Either exactly one of the top, bottom, left, or right contains exactly $n-2$ points or some two of them each contain exactly $n-1$ points.\nAny of the $\\binom{100}{98}=4950$ sets of 98 points with either $x$ or $y$ coordinate either 1 or 26 have this property. Suppose instead that some of the points have $x$ coordinate and $y$ coordinate both different from 1 and from 26. In this case we can check that it is impossible for one side to have $n-2$ points. If two opposite sides (top/bottom or left/right) have $n-1$ points, then we obtain all the points on the boundary of an $n-1$ by $n$ rectangle (of which there are four). If two adjacent sides (any of the other pairs) have $n-1$ points, then we obtain the points on the boundary of an $n$ by $n$ square with the points $(1,1),(1,2)$, $(2,1)$ missing and the point $(2,2)$ added (or one of its rotations). There are an additional 4 such sets, for a total of 4958.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n9. [7]", "solution_match": "\nAnswer: "}}
{"year": "2009", "tier": "T4", "problem_label": "10", "problem_type": null, "exam": "HMMT", "problem": "Compute\n\n$$\n\\prod_{n=0}^{\\infty}\\left(1-\\left(\\frac{1}{2}\\right)^{3^{n}}+\\left(\\frac{1}{4}\\right)^{3^{n}}\\right)\n$$", "solution": "| $\\frac{2}{3}$ |\n| :---: |\n| We can rewrite each term as $\\frac{1+\\left(\\frac{1}{2}\\right)^{3^{n+1}}}{1+\\left(\\frac{1}{2}\\right)^{3^{n}}}$. In the infinite product, each term of the form | $1+\\left(\\frac{1}{2}\\right)^{3^{n}}$ with $n>0$ appears once in the numerator and once in the denominator. The only remaining term is $1+\\left(\\frac{1}{2}\\right)^{1}$ in the first denominator.", "metadata": {"resource_path": "HarvardMIT/segmented/en-131-2009-nov-gen1-solutions.jsonl", "problem_match": "\n10. [8]", "solution_match": "\nAnswer: "}}