{"year": "2010", "tier": "T4", "problem_label": "1", "problem_type": null, "exam": "HMMT", "problem": "Below is pictured a regular seven-pointed star. Find the measure of angle $a$ in radians.\n![](https://cdn.mathpix.com/cropped/2025_01_24_773496e1b1d917b2f621g-1.jpg?height=296&width=288&top_left_y=546&top_left_x=967)", "solution": "| $\\frac{3 \\pi}{7}$ |\n| :---: | The measure of the interior angle of a point of the star is $\\frac{\\pi}{7}$ because it is an inscribed angle on the circumcircle which intercepts a seventh of the circle ${ }^{1}$\n\n![](https://cdn.mathpix.com/cropped/2025_01_24_773496e1b1d917b2f621g-1.jpg?height=308&width=291&top_left_y=1055&top_left_x=966)\n\nConsider the triangle shown above in bold. Because the sum of the angles in any triangle is $\\pi$,\n\n$$\n2 \\varphi+3\\left(\\frac{\\pi}{7}\\right)=\\pi=2 \\varphi+a\n$$\n\nCanceling the $2 \\varphi$ on the right-hand side and on the left-hand side, we obtain\n\n$$\na=\\frac{3 \\pi}{7} .\n$$", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n1. [3]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "2", "problem_type": null, "exam": "HMMT", "problem": "The rank of a rational number $q$ is the unique $k$ for which $q=\\frac{1}{a_{1}}+\\cdots+\\frac{1}{a_{k}}$, where each $a_{i}$ is the smallest positive integer such that $q \\geq \\frac{1}{a_{1}}+\\cdots+\\frac{1}{a_{i}}$. Let $q$ be the largest rational number less than $\\frac{1}{4}$ with rank 3 , and suppose the expression for $q$ is $\\frac{1}{a_{1}}+\\frac{1}{a_{2}}+\\frac{1}{a_{3}}$. Find the ordered triple $\\left(a_{1}, a_{2}, a_{3}\\right)$.", "solution": "$(5,21,421)$ Suppose that $A$ and $B$ were rational numbers of rank 3 less than $\\frac{1}{4}$, and let $a_{1}, a_{2}, a_{3}, b_{1}, b_{2}, b_{3}$ be positive integers so that $A=\\frac{1}{a_{1}}+\\frac{1}{a_{2}}+\\frac{1}{a_{3}}$ and $B=\\frac{1}{b_{1}}+\\frac{1}{b_{2}}+\\frac{1}{b_{3}}$ are the expressions for $A$ and $B$ as stated in the problem. If $b_{1}<a_{1}$ then $A<\\frac{1}{a_{1}-1} \\leq \\frac{1}{b_{1}}<B$. In other words, of all the rationals less than $\\frac{1}{4}$ with rank 3 , those that have $a_{1}=5$ are greater than those that have $a_{1}=6,7,8, \\ldots$ Therefore we can \"build\" $q$ greedily, adding the largest unit fraction that keeps $q$ less than $\\frac{1}{4}$ :\n$\\frac{1}{5}$ is the largest unit fraction less than $\\frac{1}{4}$, hence $a_{1}=5$;\n$\\frac{1}{27}$ is the largest unit fraction less than $\\frac{1}{4}-\\frac{1}{5}$, hence $a_{2}=21$;\n$\\frac{1}{421}$ is the largest unit fraction less than $\\frac{1}{4}-\\frac{1}{5}-\\frac{1}{21}$, hence $a_{3}=421$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n2. [3]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "3", "problem_type": null, "exam": "HMMT", "problem": "How many positive integers less than or equal to 240 can be expressed as a sum of distinct factorials? Consider 0 ! and 1 ! to be distinct.", "solution": "39 Note that $1=0!, 2=0!+1!, 3=0!+2$ !, and $4=0!+1!+2$ !. These are the only numbers less than 6 that can be written as the sum of factorials. The only other factorials less than 240 are $3!=6,4!=24$, and $5!=120$. So a positive integer less than or equal to 240 can only contain $3!, 4!, 5$ !, and/or one of $1,2,3$, or 4 in its sum. If it contains any factorial larger than 5 !, it will be larger than 240 . So a sum less than or equal to 240 will will either include 3 ! or not ( 2 ways), 4 ! or not ( 2 ways), 5 ! or not ( 2 ways), and add an additional $0,1,2,3$ or 4 ( 5 ways). This gives $2 \\cdot 2 \\cdot 2 \\cdot 5=40$ integers less than 240 . However, we want only positive integers, so we must not count 0 . So there are 39 such positive integers.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n3. [4]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "4", "problem_type": null, "exam": "HMMT", "problem": "For $0 \\leq y \\leq 2$, let $D_{y}$ be the half-disk of diameter 2 with one vertex at $(0, y)$, the other vertex on the positive $x$-axis, and the curved boundary further from the origin than the straight boundary. Find the area of the union of $D_{y}$ for all $0 \\leq y \\leq 2$.", "solution": "$\\pi$\n![](https://cdn.mathpix.com/cropped/2025_01_24_773496e1b1d917b2f621g-2.jpg?height=502&width=530&top_left_y=909&top_left_x=841)\n\nFrom the picture above, we see that the union of the half-disks will be a quarter-circle with radius 2 , and therefore area $\\pi$. To prove that this is the case, we first prove that the boundary of every half-disk intersects the quarter-circle with radius 2 , and then that the half-disk is internally tangent to the quarter-circle at that point. This is sufficient because it is clear from the diagram that we need not worry about covering the interior of the quarter-circle.\nLet $O$ be the origin. For a given half-disk $D_{y}$, label the vertex on the $y$-axis $A$ and the vertex on the $x$-axis $B$. Let $M$ be the midpoint of line segment $\\overline{A B}$. Draw segment $O M$, and extend it until it intersects the curved boundary of $D_{y}$. Label the intersection point $C$. This construction is shown in the diagram below.\n![](https://cdn.mathpix.com/cropped/2025_01_24_773496e1b1d917b2f621g-2.jpg?height=503&width=505&top_left_y=1879&top_left_x=859)\n\nWe first prove that $C$ lies on the quarter-circle, centered at the origin, with radius 2 . Since $M$ is the midpoint of $\\overline{A B}$, and $A$ is on the $y$-axis, $M$ is horizontally halfway between $B$ and the $y$-axis. Since\n$O$ and $B$ are on the $x$-axis (which is perpendicular to the $y$-axis), segments $\\overline{O M}$ and $\\overline{M B}$ have the same length. Since $M$ is the midpoint of $\\overline{A B}$, and $A B=2, O M=1$. Since $D_{y}$ is a half-disk with radius 1 , all points on its curved boundary are 1 away from its center, $M$. Then $C$ is 2 away from the origin, and the quarter-circle consists of all points which are 2 away from the origin. Thus, $C$ is an intersection of the half-disk $D_{y}$ with the positive quarter-circle of radius 2 .\nIt remains to show that the half-disk $D_{y}$ is internally tangent to the quarter-circle. Since $\\overline{O C}$ is a radius of the quarter-circle, it is perpendicular to the tangent of the quarter-circle at $C$. Since $\\overline{M C}$ is a radius of the half-disk, it is perpendicular to the tangent of the half-disk at $C$. Then the tangents lines of the half-disk and the quarter-circle coincide, and the half-disk is tangent to the quarter-circle. It is obvious from the diagram that the half-disk lies at least partially inside of the quarter-circle, the half-disk $D_{y}$ is internally tangent to the quarter-circle.\nThen the union of the half-disks is be a quarter-circle with radius 2 , and has area $\\pi$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n4. [4]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "5", "problem_type": null, "exam": "HMMT", "problem": "Suppose that there exist nonzero complex numbers $a, b, c$, and $d$ such that $k$ is a root of both the equations $a x^{3}+b x^{2}+c x+d=0$ and $b x^{3}+c x^{2}+d x+a=0$. Find all possible values of $k$ (including complex values).", "solution": "$1,-1, i,-i$ Let $k$ be a root of both polynomials. Multiplying the first polynomial by $k$ and subtracting the second, we have $a k^{4}-a=0$, which means that $k$ is either $1,-1, i$, or $-i$. If $a=b=c=d=1$, then $-1, i$, and $-i$ are roots of both polynomials. If $a=b=c=1$ and $d=-3$, then 1 is a root of both polynomials. So $k$ can be $1,-1, i$, and $-i$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n5. [5]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "6", "problem_type": null, "exam": "HMMT", "problem": "Let $A B C D$ be an isosceles trapezoid such that $A B=10, B C=15, C D=28$, and $D A=15$. There is a point $E$ such that $\\triangle A E D$ and $\\triangle A E B$ have the same area and such that $E C$ is minimal. Find $E C$.", "solution": "| $\\frac{216}{\\sqrt{145}}$ |\n| :---: |\n\n![](https://cdn.mathpix.com/cropped/2025_01_24_773496e1b1d917b2f621g-3.jpg?height=611&width=1075&top_left_y=1386&top_left_x=563)\n\nThe locus of points $E$ such that $[A E D]=[A E B]$ forms a line, since area is a linear function of the coordinates of $E$; setting the areas equal gives a linear equation in the coordinates $E^{2}$. Note that $A$ and $M$, the midpoint of $\\overline{D B}$, are on this line; $A$ because both areas are 0 , and $M$ because the triangles share an altitude, and bases $\\overline{D M}$ and $\\overline{M B}$ are equal in length. Then $\\overline{A M}$ is the set of points satisfying the area condition. The point $E$, then, is such that $\\triangle A E C$ is a right angle (to make the distance minimal) and $E$ lies on $\\overline{A M}$.\nLet $X$ be the point of intersection of $\\overline{A M}$ and $\\overline{C D}$. Then $\\triangle A M B \\sim \\triangle X M D$, and since $M D=B M$, they are in fact congruent. Thus $D X=A B=10$, and $X C=18$. Similarly, $B X=15$, so $A B X D$ is a parallelogram. Let $Y$ be the foot of the perpendicular from $A$ to $\\overline{D C}$, so that $D Y=\\frac{D C-A B}{2}=9$. Then\n\n[^1]$A Y=\\sqrt{A D^{2}-D Y^{2}}=\\sqrt{225-81}=12$. Then $Y X=D X-D Y=1$ and $A X=\\sqrt{A Y^{2}+Y X^{2}}=$ $\\sqrt{144+1}=\\sqrt{145}$. Since both $\\triangle A X Y$ and $\\triangle C X E$ have a right angle, and $\\angle E X C$ and $\\angle Y X A$ are congruent because they are vertical angles, $\\triangle A X Y \\sim \\triangle C X E$. Then $\\frac{C E}{A Y}=\\frac{C X}{A X}$, so $C E=12 \\cdot \\frac{18}{\\sqrt{145}}=$ $\\frac{216}{\\sqrt{145}}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n6. [5]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "7", "problem_type": null, "exam": "HMMT", "problem": "Suppose that $x$ and $y$ are complex numbers such that $x+y=1$ and that $x^{20}+y^{20}=20$. Find the sum of all possible values of $x^{2}+y^{2}$.", "solution": "-90 We have $x^{2}+y^{2}+2 x y=1$. Define $a=2 x y$ and $b=x^{2}+y^{2}$ for convenience. Then $a+b=1$ and $b-a=x^{2}+y^{2}-2 x y=(x-y)^{2}=2 b-1$ so that $x, y=\\frac{\\sqrt{2 b-1} \\pm 1}{2}$. Then\n\\[\n\n$$\n\\begin{aligned}\nx^{20}+y^{20} & =\\left(\\frac{\\sqrt{2 b-1}+1}{2}\\right)^{20}+\\left(\\frac{\\sqrt{2 b-1}-1}{2}\\right)^{20} \\\\\n& =\\frac{1}{2^{20}}\\left[(\\sqrt{2 b-1}+1)^{20}+(\\sqrt{2 b-1}-1)^{20}\\right] \\\\\n& =\\frac{2}{2^{20}}\\left[(\\sqrt{2 b-1})^{20}+\\binom{20}{2}(\\sqrt{2 b-1})^{18}+\\binom{20}{4}(\\sqrt{2 b-1})^{16}+\\ldots\\right] \\\\\n& =\\frac{2}{2^{20}}\\left[(2 b-1)^{10}+\\binom{20}{2}(2 b-1)^{9}+\\binom{20}{4}(2 b-1)^{8}+\\ldots\\right] \\\\\n& =20\n\\end{aligned}\n$$\n\\]\n\nWe want to find the sum of distinct roots of the above polynomial in $b$; we first prove that the original polynomial is square-free. The conditions $x+y=1$ and $x^{20}+y^{20}=20$ imply that $x^{20}+(1-x)^{20}-20=0$; let $p(x)=x^{20}+(1-x)^{20}-20 . p$ is square-free if and only if $G C D\\left(p, p^{\\prime}\\right)=c$ for some constant $c$ :\n\n$$\n\\begin{aligned}\nG C D\\left(p, p^{\\prime}\\right) & =G C D\\left(x^{20}+(1-x)^{20}-20,20\\left(x^{19}-(1-x)^{19}\\right)\\right) \\\\\n& =G C D\\left(x^{20}-x(1-x)^{19}+(1-x)^{19}-20,20\\left(x^{19}-(1-x)^{19}\\right)\\right) \\\\\n& =G C D\\left((1-x)^{19}-20, x^{19}-(1-x)^{19}\\right) \\\\\n& =G C D\\left((1-x)^{19}-20, x^{19}-20\\right)\n\\end{aligned}\n$$\n\nThe roots of $x^{19}-20$ are $\\sqrt[19]{20^{k}} \\exp \\left(\\frac{2 \\pi i k}{19}\\right)$ for some $k=0,1, \\ldots, 18$; the roots of $(1-x)^{19}-20$ are $1-\\sqrt[19]{20^{k}} \\exp \\left(\\frac{2 \\pi i k}{19}\\right)$ for some $k=0,1, \\ldots, 18$. If $x^{19}-20$ and $(1-x)^{19}-20$ share a common root, then there exist integers $m$, $n$ such that $\\sqrt[19]{20^{m}} \\exp \\left(\\frac{2 \\pi i m}{19}\\right)=1-\\sqrt[19]{20^{n}} \\exp \\left(\\frac{2 \\pi i n}{19}\\right)$; since the imaginary parts of both sides must be the same, we have $m=n$ and $\\sqrt[19]{20^{m}} \\exp \\left(\\frac{2 \\pi i m}{19}\\right)=\\frac{1}{2} \\Longrightarrow 20^{m}=\\frac{1}{2^{19}}$, a contradiction. Thus we have proved that the polynomial in $x$ has no double roots. Since for each $b$ there exists a unique pair $(x, y)$ (up to permutations) that satisfies $x^{2}+y^{2}=b$ and $(x+y)^{2}=1$, the polynomial in $b$ has no double roots.\nLet the coefficient of $b^{n}$ in the above equation be $\\left[b^{n}\\right]$. By Vieta's Formulas, the sum of all possible values of $b=x^{2}+y^{2}$ is equal to $-\\frac{\\left[b^{9}\\right]}{\\left[b^{10}\\right]} . \\quad\\left[b^{10}\\right]=\\frac{2}{2^{20}}\\left(2^{10}\\right)$ and $\\left[b^{9}\\right]=\\frac{2}{2^{20}}\\left(-\\binom{10}{1} 2^{9}+\\binom{20}{2} 2^{9}\\right)$; thus $-\\frac{\\left[b^{9}\\right]}{\\left[b^{10}\\right]}=-\\frac{\\binom{10}{1} 2^{9}-\\binom{20}{2} 2^{9}}{2^{10}}=-90$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n7. [5]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "8", "problem_type": null, "exam": "HMMT", "problem": "An ant starts out at $(0,0)$. Each second, if it is currently at the square $(x, y)$, it can move to $(x-1, y-1),(x-1, y+1),(x+1, y-1)$, or $(x+1, y+1)$. In how many ways can it end up at $(2010,2010)$ after 4020 seconds?", "solution": "\\( \\binom{4020}{1005}^2 \\). Note that each of the coordinates either increases or decreases the x and y- coordinates by 1. In order to reach 2010 after 4020 steps, each of the coordinates must be increased 3015 times and decreased 1005 times. A permutation of 3015 plusses and 1005 minuses for each of $x$ and $y$ uniquely corresponds to a path the ant could take to $(2010,2010)$, because we can take ordered pairs from the two lists and match them up to a valid step the ant can take. So the number of ways the ant can end up at $(2010,2010)$ after 4020 seconds is equal to the number of ways to arrange plusses and minuses for both $x$ and $y$, or $\\left(\\binom{4020}{1005}\\right)^{2}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n8. [6]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "9", "problem_type": null, "exam": "HMMT", "problem": "You are standing in an infinitely long hallway with sides given by the lines $x=0$ and $x=6$. You start at $(3,0)$ and want to get to $(3,6)$. Furthermore, at each instant you want your distance to $(3,6)$ to either decrease or stay the same. What is the area of the set of points that you could pass through on your journey from $(3,0)$ to $(3,6)$ ?", "solution": "$9 \\sqrt{3}+\\frac{21 \\pi}{2}$\n![](https://cdn.mathpix.com/cropped/2025_01_24_773496e1b1d917b2f621g-5.jpg?height=999&width=739&top_left_y=582&top_left_x=739)\n\nIf you draw concentric circles around the destination point, the condition is equivalent to the restriction that you must always go inwards towards the destination. In the diagram above, the regions through which you might pass are shaded.\nWe find the areas of regions $\\mathrm{A}, \\mathrm{B}$, and C separately, and add them up (doubling the area of region A, because there are two of them).\nThe hypotenuse of triangle A is of length 6 , and the base is of length 3 , so it is a $\\frac{\\pi}{6}-\\frac{\\pi}{3}-\\frac{\\pi}{2}$ triangle (30-60-90 triangle) with area $\\frac{9 \\sqrt{3}}{2}$. Then the total area of the regions labeled A is $9 \\sqrt{3}$.\nSince the angle of triangle A nearest the center of the circle (the destination point) is $\\frac{\\pi}{3}$, sector B has central angle $\\frac{\\pi}{3}$. Then the area of sector B is $\\frac{1}{2} r^{2} \\theta=\\frac{1}{2} \\cdot 36 \\cdot \\frac{\\pi}{3}=6 \\pi$.\nRegion C is a half-disc of radius 3 , so its area is $\\frac{9 \\pi}{2}$.\nThus, the total area is $9 \\sqrt{3}+\\frac{21 \\pi}{2}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n9. [7]", "solution_match": "\nAnswer: "}}
{"year": "2010", "tier": "T4", "problem_label": "10", "problem_type": null, "exam": "HMMT", "problem": "In a $16 \\times 16$ table of integers, each row and column contains at most 4 distinct integers. What is the maximum number of distinct integers that there can be in the whole table?", "solution": "49 First, we show that 50 is too big. Assume for sake of contradiction that a labeling with at least 50 distinct integers exists. By the Pigeonhole Principle, there must be at least one row, say the first row, with at least 4 distinct integers in it; in this case, that is exactly 4 , since that is the maximum number of distinct integers in one row. Then, in the remaining 15 rows there must be at\nleast 46 distinct integers (these 46 will also be distinct from the 4 in the first row). Using Pigeonhole again, there will be another row, say the second row, with 4 distinct integers in it. Call the set of integers in the first and second rows $S$. Because the 4 distinct integers in the second row are distinct from the 4 in the first row, there are 8 distinct values in the first two rows, so $|S|=8$. Now consider the subcolumns containing the cells in rows 3 to 16 . In each subcolumn, there are at most 2 values not in $S$, because there are already two distinct values in that column from the cells in the first two rows. So, the maximum number of distinct values in the table is $16 \\cdot 2+8=40$, a contradiction. So a valid labeling must have fewer than 50 distinct integers. Below, we show by example that 49 is attainable.\n\n| 1 | 17 | 33 | - | - | - | - | - | - | - | - | - | - | - | - | - |\n| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |\n| - | 2 | 18 | 34 | - | - | - | - | - | - | - | - | - | - | - | - |\n| - | - | 3 | 19 | 35 | - | - | - | - | - | - | - | - | - | - | - |\n| - | - | - | 4 | 20 | 36 | - | - | - | - | - | - | - | - | - | - |\n| - | - | - | - | 5 | 21 | 37 | - | - | - | - | - | - | - | - | - |\n| - | - | - | - | - | 6 | 22 | 38 | - | - | - | - | - | - | - | - |\n| - | - | - | - | - | - | 7 | 23 | 39 | - | - | - | - | - | - | - |\n| - | - | - | - | - | - | - | 8 | 24 | 40 | - | - | - | - | - | - |\n| - | - | - | - | - | - | - | - | 9 | 25 | 41 | - | - | - | - | - |\n| - | - | - | - | - | - | - | - | - | 10 | 26 | 42 | - | - | - | - |\n| - | - | - | - | - | - | - | - | - | - | 11 | 27 | 43 | - | - | - |\n| - | - | - | - | - | - | - | - | - | - | - | 12 | 28 | 44 | - | - |\n| - | - | - | - | - | - | - | - | - | - | - | - | 13 | 29 | 45 | - |\n| - | - | - | - | - | - | - | - | - | - | - | - | - | 14 | 30 | 46 |\n| 47 | - | - | - | - | - | - | - | - | - | - | - | - | - | 15 | 31 |\n| 32 | 48 | - | - | - | - | - | - | - | - | - | - | - | - | - | 16 |\n\nCells that do not contain a number are colored with color 49 .\n\n\n[^0]:    1/http://en.wikipedia.org/wiki/Inscribed_angle_theorem\n\n[^1]:    ${ }^{2}$ The notation $\\left[A_{1} A_{2} \\ldots A_{n}\\right]$ means the area of polygon $A_{1} A_{2} \\ldots A_{n}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-132-2010-feb-gen2-solutions.jsonl", "problem_match": "\n10. [8]", "solution_match": "\nAnswer: "}}