- Algebra and Number Theory
Suppose , and are nonzero reals such that the polynomial has and as roots, and the polynomial has 5 as a root. Compute .
Harvard-MIT Mathematics Tournament 2024.
Suppose , and are nonzero reals such that the polynomial has and as roots, and the polynomial has 5 as a root. Compute .
Suppose and are positive integers. Isabella and Vidur both fill up an table. Isabella fills it up with numbers , putting the numbers in the first row, in the second row, and so on. Vidur fills it up like a multiplication table, putting in the cell in row and column . (Examples are shown for a table below.)
| 1 | 2 | 3 | 4 |
|---|---|---|---|
| 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 |
Isabella's Grid
| 1 | 2 | 3 | 4 | |
|---|---|---|---|---|
| 2 | 4 | 6 | 8 | |
| 3 | 6 | 9 | 12 | |
| Vidur's Grid |
Isabella sums up the numbers in her grid, and Vidur sums up the numbers in his grid; the difference between these two quantities is 1200 . Compute .
Compute the sum of all two-digit positive integers such that for all three-digit (base 10) positive integers , if is a multiple of , then the three-digit (base 10) number is also a multiple of .
Let be a quotient of two quadratic polynomials. Given that for all , compute .
Compute the unique ordered pair of real numbers satisfying the system of equations
Compute the sum of all positive integers such that and does not divide .
Let for positive integers . Suppose that is the largest positive integer that divides for every integer . If is a product of (not necessarily distinct) prime numbers, compute .
Let . Suppose are positive integers satisfying
Compute the smallest possible value of .
Suppose , and are complex numbers satisfying
Compute all possible values of .
A polynomial is called splitty if and only if for every prime , there exist polynomials with and all coefficients of are divisible by . Compute the sum of all positive integers such that the polynomial is splitty.
Inside an equilateral triangle of side length 6 , three congruent equilateral triangles of side length with sides parallel to the original equilateral triangle are arranged so that each has a vertex on a side of the larger triangle, and a vertex on another one of the three equilateral triangles, as shown below.

A smaller equilateral triangle formed between the three congruent equilateral triangles has side length 1. Compute .
Let be a triangle with . Let , and be the feet of altitude, angle bisector, and median from to , respectively. If and , compute the length of .
Let and be circles with radii 123 and 61 , respectively, such that the center of lies on . A chord of is cut by into three segments, whose lengths are in the ratio in that order. Given that this chord is not a diameter of , compute the length of this chord.
Let be a square, and let be a line passing through the midpoint of segment that intersects segment . Given that the distances from and to are 4 and 7 , respectively, compute the area of .
Let be a convex trapezoid such that , and . Let be a circle passing through and tangent to segment at point . Suppose that the center of lies on line . Compute .
In triangle , a circle with center passes through and and intersects segments and again at and , respectively. Suppose that the circles with diameters and are externally tangent to each other at . If , and , compute .
Let be an acute triangle. Let , and be the feet of altitudes from , and to sides , , and , respectively, and let be the foot of altitude from to line . Given that , , and , compute the perimeter of triangle .
Let be a convex pentagon with area 22 such that and the circumcircles of triangles and are internally tangent. Given that , and , compute the area of triangle .
Let be a triangle. Let be the point on side such that . Let be the point on segment such that . Given that , and , compute .
Suppose point is inside quadrilateral such that
If , and , compute the perimeter of .
Compute the number of ways to divide a rectangle into rectangles. (Rotations and reflections are considered distinct.)
A lame king is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).
Compute the number of ways there are to assemble 2 red unit cubes and 25 white unit cubes into a cube such that red is visible on exactly 4 faces of the larger cube. (Rotations and reflections are considered distinct.)
Sally the snail sits on the lattice of points for all and . She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point in the lattice exactly one unit away. Given that Sally starts at , compute the number of possible paths Sally can take.
The country of HMMTLand has 8 cities. Its government decides to construct several two-way roads between pairs of distinct cities. After they finish construction, it turns out that each city can reach exactly 3 other cities via a single road, and from any pair of distinct cities, either exactly 0 or 2 other cities can be reached from both cities by a single road. Compute the number of ways HMMTLand could have constructed the roads.
In each cell of a grid, one of the two diagonals is drawn uniformly at random. Compute the probability that the resulting 32 triangular regions can be colored red and blue so that any two regions sharing an edge have different colors.
There is a grid of height 2 stretching infinitely in one direction. Between any two edge-adjacent cells of the grid, there is a door that is locked with probability independent of all other doors. Philip starts in a corner of the grid (in the starred cell). Compute the expected number of cells that Philip can reach, assuming he can only travel between cells if the door between them is unlocked.

Rishabh has 2024 pairs of socks in a drawer. He draws socks from the drawer uniformly at random, without replacement, until he has drawn a pair of identical socks. Compute the expected number of unpaired socks he has drawn when he stops.
Compute the number of triples of permutations on such that
for all .
A peacock is a ten-digit positive integer that uses each digit exactly once. Compute the number of peacocks that are exactly twice another peacock.
Let be integers such that
Determine, with proof, the maximum possible value of .
Nine distinct positive integers summing to 74 are put into a grid. Simultaneously, the number in each cell is replaced with the sum of the numbers in its adjacent cells. (Two cells are adjacent if they share an edge.) After this, exactly four of the numbers in the grid are 23. Determine, with proof, all possible numbers that could have been originally in the center of the grid.
Let be a scalene triangle and be the midpoint of . Let be the point such that and . Prove that bisects .
Each lattice point with nonnegative coordinates is labeled with a nonnegative integer in such a way that the point is labeled by 0 , and for every , the set of numbers labeled on the points , and is for some nonnegative integer . Determine, with proof, all possible labels for the point .
Determine, with proof, whether there exist positive integers and such that , and are all perfect squares.
Let be the set of rational numbers. Given a rational number , find, with proof, all functions satisfying the equation
for all .
Let be a regular hexagon with as a point in its interior. Prove that of the three values , and , two of them sum to the third one.
Let be a point in the interior of quadrilateral such that the circumcircles of triangles , and are pairwise distinct but congruent. Let the lines and meet at . If is the circumcenter of triangle , prove that .
On each cell of a grid, we place a car, which faces in one of the four cardinal directions. In a move, one chooses a car that does not have a car immediately in front of it, and slides it one cell forward. If a move would cause a car to exit the grid, the car is removed instead. The cars are placed so that there exists a sequence of moves that eventually removes all the cars from the grid. Across all such starting configurations, determine the maximum possible number of moves to do so.
Across all polynomials such that is an integer for all integers , determine, with proof, all possible values of , where .
Compute the sum of all integers such that is a perfect square.
Jerry and Neil have a 3 -sided die that rolls the numbers 1,2 , and 3 , each with probability . Jerry rolls first, then Neil rolls the die repeatedly until his number is at least as large as Jerry's. Compute the probability that Neil's final number is 3 .
Compute the number of even positive integers such that can be split into pairs, and the sum of the numbers in each pair is a multiple of 3.
Equilateral triangles and are constructed outside regular pentagon . Compute .
Let , and be real numbers such that
Compute all possible values of .
In triangle , points and are the midpoints of and , respectively, and points and trisect . Given that , and lie on a circle and , compute the area of triangle .
Positive integers , and have the property that , and end in 4,2 , and 9 , respectively. Compute the minimum possible value of .
Three points, , and , are selected independently and uniformly at random from the interior of a unit square. Compute the expected value of .
Compute the sum of all positive integers such that is a perfect square.
Alice, Bob, and Charlie are playing a game with 6 cards numbered 1 through 6 . Each player is dealt 2 cards uniformly at random. On each player's turn, they play one of their cards, and the winner is the person who plays the median of the three cards played. Charlie goes last, so Alice and Bob decide to tell their cards to each other, trying to prevent him from winning whenever possible. Compute the probability that Charlie wins regardless.
Let be a rectangle such that and . Point lies inside such that triangles and have areas 20 and 24, respectively. Compute all possible areas of triangle .
Compute the number of quadruples of positive integers satisfying
Mark has a cursed six-sided die that never rolls the same number twice in a row, and all other outcomes are equally likely. Compute the expected number of rolls it takes for Mark to roll every number at least once.
Compute the smallest positive integer such that, no matter how you rearrange its digits (in base ten), the resulting number is a multiple of 63 .
Let . Compute the remainder when is divided by 100 . Proposed by: Rishabh Das
Let be an acute isosceles triangle with orthocenter . Let and be the midpoints of sides and , respectively. The circumcircle of triangle intersects line at two points and . Given , compute .
The numbers are put into a hat. Claire draws two numbers from the hat uniformly at random, , and then puts them back into the hat. Then, William draws two numbers from the hat uniformly at random, . Let denote the number of integers that satisfy exactly one of and . Compute the probability is even.
An ordered pair of positive integers is called spicy if . Compute the probability that both and are spicy when is chosen from ! uniformly at random.
Let be a regular nonadecagon. Lines and meet at . Compute . Proposed by: Nithid Anchaleenukoon
Compute , given that it is an integer.
Kelvin the frog currently sits at in the coordinate plane. If Kelvin is at , either he can walk to any of , or , or he can jump to any of or . Walking and jumping from to are considered distinct actions. Compute the number of ways Kelvin can reach .
Let be positive real numbers such that
Compute .
Let and be two non-coplanar lines in space, and let be a point on . Let be the point on closest to be the point on closest to be the point on closest to , and be the point on closest to . Given that , and , compute .
A circle is tangent to both branches of the hyperbola as well as the -axis. Compute the area of this circle.
Point is inside a square such that , and . Compute the area of this square.
It can be shown that there exists a unique polynomial in two variables such that for all positive integers and ,
Compute .
A deck of 100 cards is labeled from top to bottom. The top two cards are drawn; one of them is discarded at random, and the other is inserted back at the bottom of the deck. This process is repeated until only one card remains in the deck. Compute the expected value of the label of the remaining card.
Given that the 32-digit integer
is the product of 6 consecutive primes, compute the sum of these 6 primes.
For each prime , a polynomial with rational coefficients is called -good if and only if there exist three integers , and such that and divides all the numerators of , , and , when written in simplest form. Compute the number of ordered pairs of rational numbers such that the polynomial is -good for infinitely many primes .
Let be an equilateral triangle with side length 1 . Points lie inside triangle such that are collinear, are collinear, are collinear, and triangle is equilateral. Suppose that there exists a unique equilateral triangle with on side on side , and on side such that lies on side lies on side , and lies on side . Compute .
Ash and Gary independently come up with their own lineups of 15 fire, grass, and water monsters. Then, the first monster of both lineups will fight, with fire beating grass, grass beating water, and water beating fire. The defeated monster is then substituted with the next one from their team's lineup; if there is a draw, both monsters get defeated. Gary completes his lineup randomly, with each monster being equally likely to be any of the three types. Without seeing Gary's lineup, Ash chooses a lineup that maximizes the probability that his monsters are the last ones standing. Compute .
Over all pairs of complex numbers satisfying the equations
compute the minimum possible real part of .
Let denote the proportion of teams, out of all participating teams, who submitted a negative response to problem 5 of the Team round (e.g. "there are no such integers"). Estimate . An estimate of earns points. If you have forgotten, problem 5 of the Team round was the following: "Determine, with proof, whether there exist positive integers and such that , and are all perfect squares."
Estimate the number of positive integers such that has a prime factor greater than . Submit a positive integer . If the correct answer is , you will receive max points.
Barry picks infinitely many points inside a unit circle, each independently and uniformly at random, Compute the expected value of , where is the smallest integer such that is inside the convex hull formed by the points .
Submit a positive real number . If the correct answer is , you will receive points.
Let be a triangle. The following diagram contains points , which are the following triangle centers of triangle in some order:

Note that the triangle is not shown. Compute which triangle centers corresponds to for . Your answer should be a seven-character string containing , or for blank. For instance, if you think and , you would answer . If you attempt to identify points and get them all correct, then you will receive points. Otherwise, you will receive 0 points.