{"year": "2008", "tier": "T4", "problem_label": "1", "problem_type": null, "exam": "HMMT", "problem": "Determine all pairs $(a, b)$ of real numbers such that $10, a, b, a b$ is an arithmetic progression.", "solution": "$(4,-2),\\left(\\frac{5}{2},-5\\right)$ Since $10, a, b$ is an arithmetic progression, we have $a=\\frac{1}{2}(10+b)$. Also, we have $a+a b=2 b$, and so $a(1+b)=2 b$. Substituting the expression for $a$ gives $(10+b)(1+b)=4 b$. Solving this quadratic equation gives the solutions $b=-2$ and $b=-5$. The corresponding values for $a$ can be found by $a=\\frac{1}{2}(10+b)$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n1. [5]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "2", "problem_type": null, "exam": "HMMT", "problem": "Given right triangle $A B C$, with $A B=4, B C=3$, and $C A=5$. Circle $\\omega$ passes through $A$ and is tangent to $B C$ at $C$. What is the radius of $\\omega$ ?", "solution": "$\\quad \\frac{25}{8}$ Let $O$ be the center of $\\omega$, and let $M$ be the midpoint of $A C$. Since $O A=O C$, $O M \\perp A C$. Also, $\\angle O C M=\\angle B A C$, and so triangles $A B C$ and $C M O$ are similar. Then, $C O / C M=$ $A C / A B$, from which we obtain that the radius of $\\omega$ is $C O=\\frac{25}{8}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n2. [5]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "3", "problem_type": null, "exam": "HMMT", "problem": "How many ways can you color the squares of a $2 \\times 2008$ grid in 3 colors such that no two squares of the same color share an edge?", "solution": "$2 \\cdot 3^{2008}$ Denote the colors $A, B, C$. The left-most column can be colored in 6 ways. For each subsequent column, if the $k$ th column is colored with $A B$, then the $(k+1)$ th column can only be colored with one of $B A, B C, C A$. That is, if we have colored the first $k$ columns, then there are 3 ways to color the $(k+1)$ th column. It follows that the number of ways of coloring the board is $6 \\times 3^{2007}$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n3. [5]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "4", "problem_type": null, "exam": "HMMT", "problem": "Find the real solution(s) to the equation $(x+y)^{2}=(x+1)(y-1)$.", "solution": "$(-1,1)$ Set $p=x+1$ and $q=y-1$, then we get $(p+q)^{2}=p q$, which simplifies to $p^{2}+p q+q^{2}=0$. Then we have $\\left(p+\\frac{q}{2}\\right)^{2}+\\frac{3 q^{2}}{4}$, and so $p=q=0$. Thus $(x, y)=(-1,1)$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n4. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "5", "problem_type": null, "exam": "HMMT", "problem": "A Vandal and a Moderator are editing a Wikipedia article. The article originally is error-free. Each day, the Vandal introduces one new error into the Wikipedia article. At the end of the day, the moderator checks the article and has a $2 / 3$ chance of catching each individual error still in the article. After 3 days, what is the probability that the article is error-free?", "solution": "$\\frac{416}{729}$ Consider the error that was introduced on day 1. The probability that the Moderator misses this error on all three checks is $1 / 3^{3}$, so the probability that this error gets removed is $1-\\frac{1}{3^{3}}$. Similarly, the probability that the moderator misses the other two errors are $1-\\frac{1}{3^{2}}$ and $1-\\frac{1}{3}$. So the probability that the article is error-free is\n\n$$\n\\left(1-\\frac{1}{3^{3}}\\right)\\left(1-\\frac{1}{3^{2}}\\right)\\left(1-\\frac{1}{3}\\right)=\\frac{416}{729}\n$$", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n5. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "6", "problem_type": null, "exam": "HMMT", "problem": "Determine the number of non-degenerate rectangles whose edges lie completely on the grid lines of the following figure.\n![](https://cdn.mathpix.com/cropped/2025_01_24_9a76de2a5218f0b823e5g-02.jpg?height=286&width=286&top_left_y=231&top_left_x=963)", "solution": "297 First, let us count the total number of rectangles in the grid without the hole in the middle. There are $\\binom{7}{2}=21$ ways to choose the two vertical boundaries of the rectangle, and there are 21 ways to choose the two horizontal boundaries of the rectangles. This makes $21^{2}=441$ rectangles. However, we must exclude those rectangles whose boundary passes through the center point. We can count these rectangles as follows: the number of rectangles with the center of the grid lying in the interior of its south edge is $3 \\times 3 \\times 3=27$ (there are three choices for each of the three other edges); the number of rectangles whose south-west vertex coincides with the center is $3 \\times 3=9$. Summing over all 4 orientations, we see that the total number of rectangles to exclude is $4(27+9)=144$. Therefore, the answer is $441-144=297$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n6. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "7", "problem_type": null, "exam": "HMMT", "problem": "Given that $x+\\sin y=2008$ and $x+2008 \\cos y=2007$, where $0 \\leq y \\leq \\pi / 2$, find the value of $x+y$.", "solution": "$2007+\\frac{\\pi}{2}$ Subtracting the two equations gives $\\sin y-2008 \\cos y=1$. But since $0 \\leq y \\leq \\pi / 2$, the maximum of $\\sin y$ is 1 and the minimum of $\\cos y$ is 0 , so we must have $\\sin y=1$, so $y=\\pi / 2$ and $x+y=2007+\\frac{\\pi}{2}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n7. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "8", "problem_type": null, "exam": "HMMT", "problem": "Trodgor the dragon is burning down a village consisting of 90 cottages. At time $t=0$ an angry peasant arises from each cottage, and every 8 minutes ( 480 seconds) thereafter another angry peasant spontaneously generates from each non-burned cottage. It takes Trodgor 5 seconds to either burn a peasant or to burn a cottage, but Trodgor cannot begin burning cottages until all the peasants around him have been burned. How many seconds does it take Trodgor to burn down the entire village?", "solution": "1920 We look at the number of cottages after each wave of peasants. Let $A_{n}$ be the number of cottages remaining after $8 n$ minutes. During each 8 minute interval, Trodgor burns a total of $480 / 5=96$ peasants and cottages. Trodgor first burns $A_{n}$ peasants and spends the remaining time burning $96-A_{n}$ cottages. Therefore, as long as we do not reach negative cottages, we have the recurrence relation $A_{n+1}=A_{n}-\\left(96-A_{n}\\right)$, which is equivalent to $A_{n+1}=2 A_{n}-96$. Computing the first few terms of the series, we get that $A_{1}=84, A_{2}=72, A_{3}=48$, and $A_{4}=0$. Therefore, it takes Trodgor 32 minutes, which is 1920 seconds.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n8. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "9", "problem_type": null, "exam": "HMMT", "problem": "Consider a circular cone with vertex $V$, and let $A B C$ be a triangle inscribed in the base of the cone, such that $A B$ is a diameter and $A C=B C$. Let $L$ be a point on $B V$ such that the volume of the cone is 4 times the volume of the tetrahedron $A B C L$. Find the value of $B L / L V$.", "solution": "$\\sqrt{\\frac{\\pi}{4-\\pi}}$ Let $R$ be the radius of the base, $H$ the height of the cone, $h$ the height of the pyramid and let $B L / L V=x / y$. Let [•] denote volume. Then [cone] $=\\frac{1}{3} \\pi R^{2} H$ and $[A B C L]=\\frac{1}{3} \\pi R^{2} h$ and $h=\\frac{x}{x+y} H$. We are given that $[$ cone $]=4[A B C L]$, so $x / y=\\frac{\\pi}{4-\\pi}$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n9. [6]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "10", "problem_type": null, "exam": "HMMT", "problem": "Find the number of subsets $S$ of $\\{1,2, \\ldots 63\\}$ the sum of whose elements is 2008 .", "solution": "6 Note that $1+2+\\cdots+63=2016$. So the problem is equivalent to finding the number of subsets of $\\{1,2, \\cdots 63\\}$ whose sum of elements is 8 . We can count this by hand: $\\{8\\},\\{1,7\\},\\{2,6\\}$, $\\{3,5\\},\\{1,2,5\\},\\{1,3,4\\}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n10. [7]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "11", "problem_type": null, "exam": "HMMT", "problem": "Let $f(r)=\\sum_{j=2}^{2008} \\frac{1}{j^{r}}=\\frac{1}{2^{r}}+\\frac{1}{3^{r}}+\\cdots+\\frac{1}{2008^{r}}$. Find $\\sum_{k=2}^{\\infty} f(k)$.", "solution": "$\\frac{2007}{2008}$ We change the order of summation:\n$$\n\\sum_{k=2}^{\\infty} \\sum_{j=2}^{2008} \\frac{1}{j^{k}}=\\sum_{j=2}^{2008} \\sum_{k=2}^{\\infty} \\frac{1}{j^{k}}=\\sum_{j=2}^{2008} \\frac{1}{j^{2}\\left(1-\\frac{1}{j}\\right)}=\\sum_{j=2}^{2008} \\frac{1}{j(j-1)}=\\sum_{j=2}^{2008}\\left(\\frac{1}{j-1}-\\frac{1}{j}\\right)=1-\\frac{1}{2008}=\\frac{2007}{2008}\n$$", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n11. [7]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "12", "problem_type": null, "exam": "HMMT", "problem": "Suppose we have an (infinite) cone $\\mathcal{C}$ with apex $A$ and a plane $\\pi$. The intersection of $\\pi$ and $\\mathcal{C}$ is an ellipse $\\mathcal{E}$ with major axis $B C$, such that $B$ is closer to $A$ than $C$, and $B C=4, A C=5, A B=3$. Suppose we inscribe a sphere in each part of $\\mathcal{C}$ cut up by $\\mathcal{E}$ with both spheres tangent to $\\mathcal{E}$. What is the ratio of the radii of the spheres (smaller to larger)?", "solution": "$\\sqrt{\\frac{1}{3}}$ It can be seen that the points of tangency of the spheres with $E$ must lie on its major axis due to symmetry. Hence, we consider the two-dimensional cross-section with plane $A B C$. Then the two spheres become the incentre and the excentre of the triangle $A B C$, and we are looking for the ratio of the inradius to the exradius. Let $s, r, r_{a}$ denote the semiperimeter, inradius, and exradius (opposite to $A$ ) of the triangle $A B C$. We know that the area of $A B C$ can be expressed as both $r s$ and $r_{a}(s-|B C|)$, and so $\\frac{r}{r_{a}}=\\frac{s-|B C|}{s}$. For the given triangle, $s=6$ and $a=4$, so the required ratio is $\\frac{1}{3}$.\n$11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n12. [7]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "13", "problem_type": null, "exam": "HMMT", "problem": "Let $P(x)$ be a polynomial with degree 2008 and leading coefficient 1 such that\n\n$$\nP(0)=2007, P(1)=2006, P(2)=2005, \\ldots, P(2007)=0 .\n$$\n\nDetermine the value of $P(2008)$. You may use factorials in your answer.", "solution": "$2008!-1$ Consider the polynomial $Q(x)=P(x)+x-2007$. The given conditions\n![](https://cdn.mathpix.com/cropped/2025_01_24_9a76de2a5218f0b823e5g-03.jpg?height=50&width=1557&top_left_y=1463&top_left_x=325) we know that $Q(x)$ is also a polynomial with degree 2008 and leading coefficient 1 . It follows that $Q(x)=x(x-1)(x-2)(x-3) \\cdots(x-2007)$. Thus\n\n$$\nP(x)=x(x-1)(x-2)(x-3) \\cdots(x-2007)-x+2007 .\n$$\n\nSetting $x=2008$ gives the answer.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n13. [8]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "14", "problem_type": null, "exam": "HMMT", "problem": "Evaluate the infinite sum $\\sum_{n=1}^{\\infty} \\frac{n}{n^{4}+4}$.", "solution": "| $\\frac{3}{8}$ |\n| :---: |\n| We have |\n\n$$\n\\begin{aligned}\n\\sum_{n=1}^{\\infty} \\frac{n}{n^{4}+4} & =\\sum_{n=1}^{\\infty} \\frac{n}{\\left(n^{2}+2 n+2\\right)\\left(n^{2}-2 n+2\\right)} \\\\\n& =\\frac{1}{4} \\sum_{n=1}^{\\infty}\\left(\\frac{1}{n^{2}-2 n+2}-\\frac{1}{n^{2}+2 n+2}\\right) \\\\\n& =\\frac{1}{4} \\sum_{n=1}^{\\infty}\\left(\\frac{1}{(n-1)^{2}+1}-\\frac{1}{(n+1)^{2}+1}\\right)\n\\end{aligned}\n$$\n\nObserve that the sum telescopes. From this we find that the answer is $\\frac{1}{4}\\left(\\frac{1}{0^{2}+1}+\\frac{1}{1^{2}+1}\\right)=\\frac{3}{8}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n14. [8]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "15", "problem_type": null, "exam": "HMMT", "problem": "In a game show, Bob is faced with 7 doors, 2 of which hide prizes. After he chooses a door, the host opens three other doors, of which one is hiding a prize. Bob chooses to switch to another door. What is the probability that his new door is hiding a prize?", "solution": "| $\\frac{5}{21}$ | If Bob initially chooses a door with a prize, then he will not find a prize by switching. |\n| :---: | :---: | :---: | With probability $5 / 7$ his original door does not hide the prize. After the host opens the three doors, the remaining three doors have equal probability of hiding the prize. Therefore, the probability that Bob finds the prize is $\\frac{5}{7} \\times \\frac{1}{3}=\\frac{5}{21}$.\n\nRemark: This problem can be easily recognized as a variation of the classic Monty Hall problem.\n$11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n15. [8]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "16", "problem_type": null, "exam": "HMMT", "problem": "Point $A$ lies at $(0,4)$ and point $B$ lies at $(3,8)$. Find the $x$-coordinate of the point $X$ on the $x$-axis maximizing $\\angle A X B$.", "solution": "$\\quad 5 \\sqrt{2}-3$ Let $X$ be a point on the $x$-axis and let $\\theta=\\angle A X B$. We can easily see that the circle with diameter $A B$ does not meet the $x$-axis, so $\\theta \\leq \\pi$. Thus, maximizing $\\theta$ is equivalent to maximizing $\\sin \\theta$. By the Law of Sines, this in turn is equivalent to minimizing the circumradius of triangle $A B X$. This will occur when the circumcircle of $A B X$ is the smaller of the two circles through $A$ and $B$ tangent to the $x$-axis. So let $X$ now be this point of tangency. Extend line $A B$ to meet the $x$-axis at $C=(-3,0)$; by Power of a Point $C X^{2}=C A \\cdot C B=50$ so $C X=5 \\sqrt{2}$. Clearly $X$ has larger $x$-coordinate than $C$, so the $x$-coordinate of $X$ is $5 \\sqrt{2}-3$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n16. [9]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "17", "problem_type": null, "exam": "HMMT", "problem": "Solve the equation\n\n$$\n\\sqrt{x+\\sqrt{4 x+\\sqrt{16 x+\\sqrt{\\ldots+\\sqrt{4^{2008} x+3}}}}}-\\sqrt{x}=1\n$$\n\nExpress your answer as a reduced fraction with the numerator and denominator written in their prime factorization.", "solution": "$\\frac{1}{2^{4016}}$ Rewrite the equation to get\n\n$$\n\\sqrt{x+\\sqrt{4 x+\\sqrt{16 x+\\sqrt{\\ldots+\\sqrt{4^{2008} x+3}}}}}=\\sqrt{x}+1\n$$\n\nSquaring both sides yields\n\n$$\n\\sqrt{4 x+\\sqrt{\\ldots+\\sqrt{4^{2008} x+3}}}=2 \\sqrt{x}+1\n$$\n\nSquaring again yields\n\n$$\n\\sqrt{16 x+\\sqrt{\\ldots+\\sqrt{4^{2008} x+3}}}=4 \\sqrt{x}+1\n$$\n\nOne can see that by continuing this process one gets\n\n$$\n\\sqrt{4^{2008} x+3}=2^{2008} \\sqrt{x}+1\n$$\n\nso that $2 \\cdot 2^{2008} \\sqrt{x}=2$. Hence $x=4^{-2008}$. It is also easy to check that this is indeed a solution to the original equation.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n17. [9]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "18", "problem_type": null, "exam": "HMMT", "problem": "Let $A B C$ be a right triangle with $\\angle A=90^{\\circ}$. Let $D$ be the midpoint of $A B$ and let $E$ be a point on segment $A C$ such that $A D=A E$. Let $B E$ meet $C D$ at $F$. If $\\angle B F C=135^{\\circ}$, determine $B C / A B$.", "solution": "$\\frac{\\sqrt{13}}{2}$ Let $\\alpha=\\angle A D C$ and $\\beta=\\angle A B E$. By exterior angle theorem, $\\alpha=\\angle B F D+\\beta=$ $45^{\\circ}+\\beta$. Also, note that $\\tan \\beta=A E / A B=A D / A B=1 / 2$. Thus,\n\n$$\n1=\\tan 45^{\\circ}=\\tan (\\alpha-\\beta)=\\frac{\\tan \\alpha-\\tan \\beta}{1+\\tan \\alpha \\tan \\beta}=\\frac{\\tan \\alpha-\\frac{1}{2}}{1+\\frac{1}{2} \\tan \\alpha}\n$$\n\nSolving for $\\tan \\alpha$ gives $\\tan \\alpha=3$. Therefore, $A C=3 A D=\\frac{3}{2} A B$. Using Pythagorean Theorem, we find that $B C=\\frac{\\sqrt{13}}{2} A B$. So the answer is $\\frac{\\sqrt{13}}{2}$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n18. [9]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "19", "problem_type": null, "exam": "HMMT", "problem": "Let $A B C D$ be a regular tetrahedron, and let $O$ be the centroid of triangle $B C D$. Consider the point $P$ on $A O$ such that $P$ minimizes $P A+2(P B+P C+P D)$. Find $\\sin \\angle P B O$.", "solution": "| $\\frac{1}{6}$ |\n| :---: |\n| We translate the problem into one about 2-D geometry. Consider the right triangle | $A B O$, and $P$ is some point on $A O$. Then, the choice of $P$ minimizes $P A+6 P B$. Construct the line $\\ell$ through $A$ but outside the triangle $A B O$ so that $\\sin \\angle(A O, \\ell)=\\frac{1}{6}$. For whichever $P$ chosen, let $Q$ be the projection of $P$ onto $\\ell$, then $P Q=\\frac{1}{6} A P$. Then, since $P A+6 P B=6(P Q+P B)$, it is equivalent to minimize $P Q+P B$. Observe that this sum is minimized when $B, P, Q$ are collinear and the line through them is perpendicular to $\\ell$ (so that $P Q+P B$ is simply the distance from $B$ to $\\ell$ ). Then, $\\angle A Q B=90^{\\circ}$, and since $\\angle A O B=90^{\\circ}$ as well, we see that $A, Q, P, B$ are concyclic. Therefore, $\\angle P B O=\\angle O P A=\\angle(A O, \\ell)$, and the sine of this angle is therefore $\\frac{1}{6}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n19. [10]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "20", "problem_type": null, "exam": "HMMT", "problem": "For how many ordered triples $(a, b, c)$ of positive integers are the equations $a b c+9=a b+b c+c a$ and $a+b+c=10$ satisfied?", "solution": "21 Subtracting the first equation from the second, we obtain $1-a-b-c+a b+b c+c a-a b c=$ $(1-a)(1-b)(1-c)=0$. Since $a, b$, and $c$ are positive integers, at least one must equal 1 . Note that $a=b=c=1$ is not a valid triple, so it suffices to consider the cases where exactly two or one of $a, b, c$ are equal to 1 . If $a=b=1$, we obtain $c=8$ and similarly for the other two cases, so this gives 3 ordered triples. If $a=1$, then we need $b+c=9$, which has 6 solutions for $b, c \\neq 1$; a similar argument for $b$ and $c$ gives a total of 18 such solutions. It is easy to check that all the solutions we found are actually solutions to the original equations. Adding, we find $18+3=21$ total triples.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n20. [10]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "21", "problem_type": null, "exam": "HMMT", "problem": "Let $A B C$ be a triangle with $A B=5, B C=4$ and $A C=3$. Let $\\mathcal{P}$ and $\\mathcal{Q}$ be squares inside $A B C$ with disjoint interiors such that they both have one side lying on $A B$. Also, the two squares each have an edge lying on a common line perpendicular to $A B$, and $\\mathcal{P}$ has one vertex on $A C$ and $\\mathcal{Q}$ has one vertex on $B C$. Determine the minimum value of the sum of the areas of the two squares.\n![](https://cdn.mathpix.com/cropped/2025_01_24_9a76de2a5218f0b823e5g-05.jpg?height=351&width=682&top_left_y=1592&top_left_x=762)", "solution": "$\\frac{144}{49}$ Let the side lengths of $\\mathcal{P}$ and $\\mathcal{Q}$ be $a$ and $b$, respectively. Label two of the vertices of $\\mathcal{P}$ as $D$ and $E$ so that $D$ lies on $A B$ and $E$ lies on $A C$, and so that $D E$ is perpendicular to $A B$. The triangle $A D E$ is similar to $A C B$. So $A D=\\frac{3}{4} a$. Using similar arguments, we find that\n\n$$\n\\frac{3 a}{4}+a+b+\\frac{4 b}{3}=A B=5\n$$\n\nso\n\n$$\n\\frac{a}{4}+\\frac{b}{3}=\\frac{5}{7}\n$$\n\nUsing Cauchy-Schwarz inequality, we get\n\n$$\n\\left(a^{2}+b^{2}\\right)\\left(\\frac{1}{4^{2}}+\\frac{1}{3^{2}}\\right) \\geq\\left(\\frac{a}{4}+\\frac{b}{3}\\right)^{2}=\\frac{25}{49}\n$$\n\nIt follows that\n\n$$\na^{2}+b^{2} \\geq \\frac{144}{49}\n$$\n\nEquality occurs at $a=\\frac{36}{35}$ and $b=\\frac{48}{35}$.\n\n$$\n11^{\\text {th }} \\text { HARVARD-MIT MATHEMATICS TOURNAMENT, } 23 \\text { FEBRUARY } 2008 \\text { - GUTS ROUND }\n$$", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n21. [10]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "22", "problem_type": null, "exam": "HMMT", "problem": "For a positive integer $n$, let $\\theta(n)$ denote the number of integers $0 \\leq x<2010$ such that $x^{2}-n$ is divisible by 2010. Determine the remainder when $\\sum_{n=0}^{2009} n \\cdot \\theta(n)$ is divided by 2010.", "solution": "335 Let us consider the sum $\\sum_{n=0}^{2009} n \\cdot \\theta(n)(\\bmod 2010)$ in a another way. Consider the sum $0^{2}+1^{2}+2^{2}+\\cdots+2007^{2}(\\bmod 2010)$. For each $0 \\leq n<2010$, in the latter sum, the term $n$ appears $\\theta(n)$ times, so the sum is congruent to $\\sum_{n=0}^{2009} n \\cdot \\theta(n)$. In other words,\n\n$$\n\\sum_{n=0}^{2009} n \\cdot \\theta(n)=\\sum_{n=0}^{2009} n^{2}=\\frac{(2009)(2009+1)(2 \\cdot 2009+1)}{6} \\equiv(-1) \\cdot \\frac{2010}{6} \\cdot(-1)=335 \\quad(\\bmod 2010)\n$$", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n22. [10]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "23", "problem_type": null, "exam": "HMMT", "problem": "Two mathematicians, Kelly and Jason, play a cooperative game. The computer selects some secret positive integer $n<60$ (both Kelly and Jason know that $n<60$, but that they don't know what the value of $n$ is). The computer tells Kelly the unit digit of $n$, and it tells Jason the number of divisors of $n$. Then, Kelly and Jason have the following dialogue:\nKelly: I don't know what $n$ is, and I'm sure that you don't know either. However, I know that $n$ is divisible by at least two different primes.\nJason: Oh, then I know what the value of $n$ is.\nKelly: Now I also know what $n$ is.\nAssuming that both Kelly and Jason speak truthfully and to the best of their knowledge, what are all the possible values of $n$ ?", "solution": "10 The only way in which Kelly can know that $n$ is divisible by at least two different primes is if she is given 0 as the unit digit of $n$, since if she received anything else, then there is some number with that unit digit and not divisible by two primes (i.e., $1,2,3,4,5,16,7,8,9$ ). Then, after Kelly says the first line, Jason too knows that $n$ is divisible by 10 .\nThe number of divisors of $10,20,30,40,50$ are $4,6,8,8,6$, respectively. So unless Jason received 4 , he cannot otherwise be certain of what $n$ is. It follows that Jason received 4 , and thus $n=10$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n23. [10]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "24", "problem_type": null, "exam": "HMMT", "problem": "Suppose that $A B C$ is an isosceles triangle with $A B=A C$. Let $P$ be the point on side $A C$ so that $A P=2 C P$. Given that $B P=1$, determine the maximum possible area of $A B C$.", "solution": "$\\sqrt{\\frac{9}{10}}$ Let $Q$ be the point on $A B$ so that $A Q=2 B Q$, and let $X$ be the intersection of $B P$ and $C Q$. The key observation that, as we will show, $B X$ and $C X$ are fixed lengths, and the ratio of areas $[A B C] /[B C X]$ is constant. So, to maximize $[A B C]$, it is equivalent to maximize $[B C X]$.\nUsing Menelaus' theorem on $A B P$, we have\n\n$$\n\\frac{B X \\cdot P C \\cdot A Q}{X P \\cdot C A \\cdot Q B}=1\n$$\n\nSince $P C / C A=1 / 3$ and $A Q / Q B=2$, we get $B X / X P=3 / 2$. It follows that $B X=3 / 5$. By symmetry, $C X=3 / 5$.\nAlso, we have\n\n$$\n[A B C]=3[B P C]=3 \\cdot \\frac{5}{3}[B X C]=5[B X C]\n$$\n\nNote that $[B X C]$ is maximized when $\\angle B X C=90^{\\circ}$ (one can check that this configuration is indeed possible). Thus, the maximum value of $[B X C]$ is $\\frac{1}{2} B X \\cdot C X=\\frac{1}{2}\\left(\\frac{3}{5}\\right)^{2}=\\frac{9}{50}$. It follows that the maximum value of $[A B C]$ is $\\frac{9}{10}$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n24. [10]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "25", "problem_type": null, "exam": "HMMT", "problem": "Alice and the Cheshire Cat play a game. At each step, Alice either (1) gives the cat a penny, which causes the cat to change the number of (magic) beans that Alice has from $n$ to $5 n$ or (2) gives the cat a nickel, which causes the cat to give Alice another bean. Alice wins (and the cat disappears) as soon as the number of beans Alice has is greater than 2008 and has last two digits 42 . What is the minimum number of cents Alice can spend to win the game, assuming she starts with 0 beans?", "solution": "35 Consider the number of beans Alice has in base 5 . Note that $2008=31013_{5}, 42=132_{5}$, and $100=400_{5}$. Now, suppose Alice has $d_{k} \\cdots d_{2} d_{1}$ beans when she wins; the conditions for winning mean that these digits must satisfy $d_{2} d_{1}=32, d_{k} \\cdots d_{3} \\geq 310$, and $d_{k} \\cdots d_{3}=4 i+1$ for some $i$. To gain these $d_{k} \\cdots d_{2} d_{1}$ beans, Alice must spend at least $5\\left(d_{1}+d_{2}+\\cdots+d_{k}\\right)+k-1$ cents (5 cents to get each bean in the \"units digit\" and $k-1$ cents to promote all the beans). We now must have $k \\geq 5$ because $d_{k} \\cdots d_{2} d_{1}>2008$. If $k=5$, then $d_{k} \\geq 3$ since $d_{k} \\cdots d_{3} \\geq 3100$; otherwise, we have $d_{k} \\geq 1$. Therefore, if $k=5$, we have $5\\left(d_{1}+d_{2}+\\cdots+d_{k}\\right)+k-1 \\geq 44>36$; if $k>5$, we have $5\\left(d_{1}+d_{2}+\\cdots+d_{k}\\right)+k-1 \\geq 30+k-1 \\geq 35$. But we can attain 36 cents by taking $d_{k} \\cdots d_{3}=1000$, so this is indeed the minimum.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n25. [12]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "26", "problem_type": null, "exam": "HMMT", "problem": "Let $\\mathcal{P}$ be a parabola, and let $V_{1}$ and $F_{1}$ be its vertex and focus, respectively. Let $A$ and $B$ be points on $\\mathcal{P}$ so that $\\angle A V_{1} B=90^{\\circ}$. Let $\\mathcal{Q}$ be the locus of the midpoint of $A B$. It turns out that $\\mathcal{Q}$ is also a parabola, and let $V_{2}$ and $F_{2}$ denote its vertex and focus, respectively. Determine the ratio $F_{1} F_{2} / V_{1} V_{2}$.", "solution": "$\\frac{7}{8}$ Since all parabolas are similar, we may assume that $\\mathcal{P}$ is the curve $y=x^{2}$. Then, if $A=\\left(a, a^{2}\\right)$ and $B=\\left(b, b^{2}\\right)$, the condition that $\\angle A V_{1} B=90^{\\circ}$ gives $a b+a^{2} b^{2}=0$, or $a b=-1$. Then, the midpoint of $A B$ is\n\n$$\n\\frac{A+B}{2}=\\left(\\frac{a+b}{2}, \\frac{a^{2}+b^{2}}{2}\\right)=\\left(\\frac{a+b}{2}, \\frac{(a+b)^{2}-2 a b}{2}\\right)=\\left(\\frac{a+b}{2}, \\frac{(a+b)^{2}}{2}+1\\right) .\n$$\n\n(Note that $a+b$ can range over all real numbers under the constraint $a b=-1$.) It follows that the locus of the midpoint of $A B$ is the curve $y=2 x^{2}+1$.\nRecall that the focus of $y=a x^{2}$ is $\\left(0, \\frac{1}{4 a}\\right)$. We find that $V_{1}=(0,0), V_{2}=(0,1), F_{1}=\\left(0, \\frac{1}{4}\\right)$, $F_{2}=\\left(0,1+\\frac{1}{8}\\right)$. Therefore, $F_{1} F_{2} / V_{1} V_{2}=\\frac{7}{8}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n26. [12]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "27", "problem_type": null, "exam": "HMMT", "problem": "Cyclic pentagon $A B C D E$ has a right angle $\\angle A B C=90^{\\circ}$ and side lengths $A B=15$ and $B C=20$. Supposing that $A B=D E=E A$, find $C D$.", "solution": "7 By Pythagoras, $A C=25$. Since $\\overline{A C}$ is a diameter, angles $\\angle A D C$ and $\\angle A E C$ are also right, so that $C E=20$ and $A D^{2}+C D^{2}=A C^{2}$ as well. Beginning with Ptolemy's theorem,\n\n$$\n\\begin{aligned}\n& (A E \\cdot C D+A C \\cdot D E)^{2}=A D^{2} \\cdot E C^{2}=\\left(A C^{2}-C D^{2}\\right) E C^{2} \\\\\n& \\quad \\Longrightarrow C D^{2}\\left(A E^{2}+E C^{2}\\right)+2 \\cdot C D \\cdot A E^{2} \\cdot A C+A C^{2}\\left(D E^{2}-E C^{2}\\right)=0 \\\\\n& \\quad \\Longrightarrow C D^{2}+2 C D\\left(\\frac{A E^{2}}{A C}\\right)+D E^{2}-E C^{2}=0\n\\end{aligned}\n$$\n\nIt follows that $C D^{2}+18 C D-175=0$, from which $C D=7$.\nRemark: A simple trigonometric solution is possible. One writes $\\alpha=\\angle A C E=\\angle E C D \\Longrightarrow \\angle D A C=$ $90^{\\circ}-2 \\alpha$ and applies double angle formula.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n27. [12]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "28", "problem_type": null, "exam": "HMMT", "problem": "Let $P$ be a polyhedron where every face is a regular polygon, and every edge has length 1. Each vertex of $P$ is incident to two regular hexagons and one square. Choose a vertex $V$ of the polyhedron. Find the volume of the set of all points contained in $P$ that are closer to $V$ than to any other vertex.", "solution": "$\\quad \\frac{\\sqrt{2}}{3}$ Observe that $P$ is a truncated octahedron, formed by cutting off the corners from a regular octahedron with edge length 3 . So, to compute the value of $P$, we can find the volume of the octahedron, and then subtract off the volume of truncated corners. Given a square pyramid where each triangular face an equilateral triangle, and whose side length is $s$, the height of the pyramid is $\\frac{\\sqrt{2}}{2} s$, and thus the volume is $\\frac{1}{3} \\cdot s^{2} \\cdot \\frac{\\sqrt{2}}{2} s=\\frac{\\sqrt{2}}{6} s^{3}$. The side length of the octahedron is 3 , and noting that the octahedron is made up of two square pyramids, its volume must be is $2 \\cdot \\frac{\\sqrt{2}(3)^{3}}{6}=9 \\sqrt{2}$. The six \"corners\" that we remove are all square pyramids, each with volume $\\frac{\\sqrt{2}}{6}$, and so the resulting polyhedron $P$ has volume $9 \\sqrt{2}-6 \\cdot \\frac{\\sqrt{2}}{6}=8 \\sqrt{2}$.\nFinally, to find the volume of all points closer to one particular vertex than any other vertex, note that due to symmetry, every point in $P$ (except for a set with zero volume), is closest to one of the 24 vertices. Due to symmetry, it doesn't matter which $V$ is picked, so we can just divide the volume of $P$ by 24 to obtain the answer $\\frac{\\sqrt{2}}{3}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n28. [15]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "29", "problem_type": null, "exam": "HMMT", "problem": "Let $(x, y)$ be a pair of real numbers satisfying\n\n$$\n56 x+33 y=\\frac{-y}{x^{2}+y^{2}}, \\quad \\text { and } \\quad 33 x-56 y=\\frac{x}{x^{2}+y^{2}}\n$$\n\nDetermine the value of $|x|+|y|$.", "solution": "$\\frac{11}{65}$ Observe that\n\n$$\n\\frac{1}{x+y i}=\\frac{x-y i}{x^{2}+y^{2}}=33 x-56 y+(56 x+33 y) i=(33+56 i)(x+y i)\n$$\n\nSo\n\n$$\n(x+y i)^{2}=\\frac{1}{33+56 i}=\\frac{1}{(7+4 i)^{2}}=\\left(\\frac{7-4 i}{65}\\right)^{2}\n$$\n\nIt follows that $(x, y)= \\pm\\left(\\frac{7}{65},-\\frac{4}{65}\\right)$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n29. [15]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "30", "problem_type": null, "exam": "HMMT", "problem": "Triangle $A B C$ obeys $A B=2 A C$ and $\\angle B A C=120^{\\circ}$. Points $P$ and $Q$ lie on segment $B C$ such that\n\n$$\n\\begin{aligned}\nA B^{2}+B C \\cdot C P & =B C^{2} \\\\\n3 A C^{2}+2 B C \\cdot C Q & =B C^{2}\n\\end{aligned}\n$$\n\nFind $\\angle P A Q$ in degrees.", "solution": "$40^{\\circ}$ We have $A B^{2}=B C(B C-C P)=B C \\cdot B P$, so triangle $A B C$ is similar to triangle $P B A$. Also, $A B^{2}=B C(B C-2 C Q)+A C^{2}=(B C-C Q)^{2}-C Q^{2}+A C^{2}$, which rewrites as $A B^{2}+C Q^{2}=$ $B Q^{2}+A C^{2}$. We deduce that $Q$ is the foot of the altitude from $A$. Thus, $\\angle P A Q=90^{\\circ}-\\angle Q P A=90^{\\circ}-$ $\\angle A B P-\\angle B A P$. Using the similar triangles, $\\angle P A Q=90^{\\circ}-\\angle A B C-\\angle B C A=\\angle B A C-90^{\\circ}=40^{\\circ}$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n30. [15]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "31", "problem_type": null, "exam": "HMMT", "problem": "Let $\\mathcal{C}$ be the hyperbola $y^{2}-x^{2}=1$. Given a point $P_{0}$ on the $x$-axis, we construct a sequence of points $\\left(P_{n}\\right)$ on the $x$-axis in the following manner: let $\\ell_{n}$ be the line with slope 1 passing passing\nthrough $P_{n}$, then $P_{n+1}$ is the orthogonal projection of the point of intersection of $\\ell_{n}$ and $\\mathcal{C}$ onto the $x$-axis. (If $P_{n}=0$, then the sequence simply terminates.)\nLet $N$ be the number of starting positions $P_{0}$ on the $x$-axis such that $P_{0}=P_{2008}$. Determine the remainder of $N$ when divided by 2008.", "solution": "254 Let $P_{n}=\\left(x_{n}, 0\\right)$. Then the $\\ell_{n}$ meet $\\mathcal{C}$ at $\\left(x_{n+1}, x_{n+1}-x_{n}\\right)$. Since this point lies on the hyperbola, we have $\\left(x_{n+1}-x_{n}\\right)^{2}-x_{n+1}^{2}=1$. Rearranging this equation gives\n\n$$\nx_{n+1}=\\frac{x_{n}^{2}-1}{2 x_{n}}\n$$\n\nChoose a $\\theta_{0} \\in(0, \\pi)$ with $\\cot \\theta_{0}=x_{0}$, and define $\\theta_{n}=2^{n} \\theta_{0}$. Using the double-angle formula, we have\n\n$$\n\\cot \\theta_{n+1}=\\cot \\left(2 \\theta_{n}\\right)=\\frac{\\cot ^{2} \\theta_{n}-1}{2 \\cot \\theta_{n}}\n$$\n\nIt follows by induction that $x_{n}=\\cot \\theta_{n}$. Then, $P_{0}=P_{2008}$ corresponds to $\\cot \\theta_{0}=\\cot \\left(2^{2008} \\theta_{0}\\right)$ (assuming that $P_{0}$ is never at the origin, or equivalently, $2^{n} \\theta$ is never an integer multiple of $\\pi$ ). So, we need to find the number of $\\theta_{0} \\in(0, \\pi)$ with the property that $2^{2008} \\theta_{0}-\\theta_{0}=k \\pi$ for some integer $k$. We have $\\theta_{0}=\\frac{k \\pi}{2^{2008}-1}$, so $k$ can be any integer between 1 and $2^{2008}-2$ inclusive (and note that since the denominator is odd, the sequence never terminates). It follows that the number of starting positions is $N=2^{2008}-2$.\nFinally, we need to compute the remainder when $N$ is divided by 2008 . We have $2008=2^{3} \\times 251$. Using Fermat's Little Theorem with 251 , we get $2^{2008} \\equiv\\left(2^{250}\\right)^{4} \\cdot 256 \\equiv 1^{4} \\cdot 5=5(\\bmod 251)$. So we have $N \\equiv 3(\\bmod 251)$ and $N \\equiv-2(\\bmod 8)$. Using Chinese Remainder Theorem, we get $N \\equiv 254$ $(\\bmod 2008)$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n31. [18]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "32", "problem_type": null, "exam": "HMMT", "problem": "Cyclic pentagon $A B C D E$ has side lengths $A B=B C=5, C D=D E=12$, and $A E=14$. Determine the radius of its circumcircle.", "solution": "$\\frac{225 \\sqrt{11}}{88}$ Let $C^{\\prime}$ be the point on minor arc $B C D$ such that $B C^{\\prime}=12$ and $C^{\\prime} D=5$, and write $A C^{\\prime}=B D=C^{\\prime} E=x, A D=y$, and $B D=z$. Ptolemy applied to quadrilaterals $A B C^{\\prime} D, B C^{\\prime} D E$, and $A B D E$ gives\n\n$$\n\\begin{aligned}\n& x^{2}=12 y+5^{2} \\\\\n& x^{2}=5 z+12^{2} \\\\\n& y z=14 x+5 \\cdot 12\n\\end{aligned}\n$$\n\nThen\n\n$$\n\\left(x^{2}-5^{2}\\right)\\left(x^{2}-12^{2}\\right)=5 \\cdot 12 y z=5 \\cdot 12 \\cdot 14 x+5^{2} \\cdot 12^{2}\n$$\n\nfrom which $x^{3}-169 x-5 \\cdot 12 \\cdot 14=0$. Noting that $x>13$, the rational root theorem leads quickly to the root $x=15$. Then triangle $B C D$ has area $\\sqrt{16 \\cdot 1 \\cdot 4 \\cdot 11}=8 \\sqrt{11}$ and circumradius $R=\\frac{5 \\cdot 12 \\cdot 15}{4 \\cdot 8 \\sqrt{11}}=$ $\\frac{225 \\sqrt{11}}{88}$.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n32. [18]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "33", "problem_type": null, "exam": "HMMT", "problem": "Let $a, b, c$ be nonzero real numbers such that $a+b+c=0$ and $a^{3}+b^{3}+c^{3}=a^{5}+b^{5}+c^{5}$. Find the value of $a^{2}+b^{2}+c^{2}$.", "solution": "$\\quad \\frac{6}{5}$ Let $\\sigma_{1}=a+b+c, \\sigma_{2}=a b+b c+c a$ and $\\sigma_{3}=a b c$ be the three elementary symmetric polynomials. Since $a^{3}+b^{3}+c^{3}$ is a symmetric polynomial, it can be written as a polynomial in $\\sigma_{1}, \\sigma_{2}$ and $\\sigma_{3}$. Now, observe that $\\sigma_{1}=0$, and so we only need to worry about the terms not containing $\\sigma_{1}$. By considering the degrees of the terms, we see that the only possibility is $\\sigma_{3}$. That is, $a^{3}+b^{3}+c^{3}=k \\sigma_{3}$ for some constant $k$. By setting $a=b=1, c=-2$, we see that $k=3$.\nBy similar reasoning, we find that $a^{5}+b^{5}+c^{5}=h \\sigma_{2} \\sigma_{3}$ for some constant $h$. By setting $a=b=1$ and $c=-2$, we get $h=-5$.\n\nSo, we now know that $a+b+c=0$ implies\n\n$$\na^{3}+b^{3}+c^{3}=3 a b c \\quad \\text { and } \\quad a^{5}+b^{5}+c^{5}=-5 a b c(a b+b c+c a)\n$$\n\nThen $a^{3}+b^{3}+c^{3}=a^{5}+b^{5}+c^{5}$ implies that $3 a b c=-5 a b c(a b+b c+c a)$. Given that $a, b, c$ are nonzero, we get $a b+b c+c a=-\\frac{3}{5}$. Then, $a^{2}+b^{2}+c^{2}=(a+b+c)^{2}-2(a b+b c+c a)=\\frac{6}{5}$.\n\n## $11^{\\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 23 FEBRUARY 2008 - GUTS ROUND", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n33. [18]", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "34", "problem_type": null, "exam": "HMMT", "problem": "Who Wants to Be a Millionaire. In 2000, the Clay Mathematics Institute named seven Millennium Prize Problems, with each carrying a prize of $\\$ 1$ Million for its solution. Write down the name of ONE of the seven Clay Millennium Problems. If your submission is incorrect or misspelled, then your submission is disqualified. If another team wrote down the same Millennium Problem as you, then you get 0 points, otherwise you get 20 points.", "solution": "The seven Millennium Prize Problems are:\n(a) Birch and Swinnerton-Dyer Conjecture\n(b) Hodge Conjecture\n(c) Navier-Stokes Equations\n(d) P vs NP\n(e) Poincaré Conjecture\n(f) Riemann Hypothesis\n(g) Yang-Mills Theory\n\nMore information can be found on its official website http://www.claymath.org/millennium/.\nAs far as this as an HMMT problem goes, it's probably a good idea to submit something that you think is least likely for another team to think of (or to spell correctly). Though, this may easily turn into a contest of who can still remember the names of the user ranks from the Art of Problem Solving forum.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n34. ", "solution_match": "\nSolution: "}}
{"year": "2008", "tier": "T4", "problem_label": "35", "problem_type": null, "exam": "HMMT", "problem": "NUMB3RS. The RSA Factoring Challenge, which ended in 2007, challenged computational mathematicians to factor extremely large numbers that were the product of two prime numbers. The largest number successfully factored in this challenge was RSA-640, which has 193 decimal digits and carried a prize of $\\$ 20,000$. The next challenge number carried prize of $\\$ 30,000$, and contains $N$ decimal digits. Your task is to submit a guess for $N$. Only the team(s) that have the closest guess(es) receives points. If $k$ teams all have the closest guesses, then each of them receives $\\left\\lceil\\frac{20}{k}\\right\\rceil$ points.", "solution": "212 For more information, see the Wikipedia entry at http://en.wikipedia.org/wiki/ RSA_Factoring_Challenge.\nRSA-640 was factored in November 2005, and the effort took approximately 302.2 GHz -Opteron-CPU years over five months of calendar time.", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n35. ", "solution_match": "\nAnswer: "}}
{"year": "2008", "tier": "T4", "problem_label": "36", "problem_type": null, "exam": "HMMT", "problem": "The History Channel. Below is a list of famous mathematicians. Your task is to list a subset of them in the chronological order of their birth dates. Your submission should be a sequence of letters. If your sequence is not in the correct order, then you get 0 points. Otherwise your score will be $\\min \\{\\max \\{5(N-4), 0\\}, 25\\}$, where $N$ is the number of letters in your sequence.\n(A) Niels Abel (B) Arthur Cayley (C) Augustus De Morgan (D) Gustav Dirichlet (E) Leonhard Euler (F) Joseph Fourier (G) Évariste Galois (H) Carl Friedrich Gauss (I) Marie-Sophie Germain (J) Joseph Louis Lagrange (K) Pierre-Simon Laplace (L) Henri Poincaré (N) Bernhard Riemann", "solution": "any subsequence of EJKFIHADCGBNL The corresponding birth dates are listed below:\n(A) Niels Abel (1802-1829)\n(B) Arthur Cayley (1821-1895)\n(C) Augustus De Morgan (1806-1871)\n(D) Gustav Dirichlet (1805-1859)\n(E) Leonhard Euler (1707-1783)\n(F) Joseph Fourier (1768-1830)\n(G) Évariste Galois (1811-1832)\n(H) Carl Friedrich Gauss (1777-1855)\n(I) Marie-Sophie Germain (1776-1831)\n(J) Joseph Louis Lagrange (1736-1813)\n(K) Pierre-Simon Laplace (1749-1827)\n(L) Henri Poincaré (1854-1912)\n(N) Bernhard Riemann (1826-1866)", "metadata": {"resource_path": "HarvardMIT/segmented/en-112-2008-feb-guts-solutions.jsonl", "problem_match": "\n36. ", "solution_match": "\nAnswer: "}}