- Algebra and Number Theory
- Answer
Compute the sum of the positive divisors (including 1) of 9! that have units digit 1.
Harvard-MIT Mathematics Tournament 2025.
Compute the sum of the positive divisors (including 1) of 9! that have units digit 1.
Mark writes the expression on the board, where is a four-digit number and . Derek, a toddler, decides to move the , changing Mark's expression to . Surprisingly, these two expressions are equal. Compute the only possible four-digit number .
Given that , , and are positive real numbers such that
compute the smallest possible value of .
Let denote the greatest integer less than or equal to . Compute
Let be the set of all nonconstant monic polynomials with integer coefficients satisfying . If is an element of with minimal degree, compute the only possible value of .
Let be the remainder when is divided by 2025!. Compute . (Note that 2017 is prime.)
There exists a unique triple of positive real numbers that satisfies the equations
Compute .
Define to be 1 when is positive, when is negative, and 0 when is 0. Compute
(The arguments to sin are in radians.)
Let be the unique polynomial of degree at most 2026 such that for all
Suppose that is the coefficient of in , where and are integers such that . Compute the unique integer between 0 and 2026 (inclusive) such that is divisible by 2027. (Note that 2027 is prime.)
Let , , and be pairwise distinct complex numbers such that
Compute the two possible values of
Equilateral triangles and are drawn such that points , , , and lie on a line in this order, and point lies inside triangle . If , , and , compute .
In a two-dimensional cave with a parallel floor and ceiling, two stalactites of lengths 16 and 36 hang perpendicularly from the ceiling, while two stalagmites of heights 25 and 49 grow perpendicularly from the ground. If the tips of these four structures form the vertices of a square in some order, compute the height of the cave.
Point lies inside square such that the areas of , , , and are 1, 2, 3, and 4, in some order. Compute .
A semicircle is inscribed in another semicircle if the smaller semicircle's diameter is a chord of the larger semicircle, and the smaller semicircle's arc is tangent to the diameter of the larger semicircle.
Semicircle is inscribed in a semicircle , which is inscribed in another semicircle . The radii of and are 1 and 10, respectively, and the diameters of and are parallel. The endpoints of the diameter of are and , and 's arc is tangent to at . Compute .

Let be an equilateral triangle with side length 6. Let be a point inside triangle such that . The circle with diameter meets the circumcircle of again at . Given that , compute .
Trapezoid , with , has side lengths , , , and . Compute the area of the convex quadrilateral whose vertices are the circumcenters of , , , and .
Point is inside triangle such that . Given that , , , and , compute .
(Here, denotes the area of ).
Let be an isosceles trapezoid such that . Let be a point on line such that and lies between and . Let be the midpoint of . Given that points , , , , and lie on a circle with radius 5, compute .
Let be a rectangle with . Point lies inside the rectangle such that . Given that triangles and are both acute and have circumradii 13 and 15, respectively, compute .
A plane intersects a rectangular prism at a hexagon which has side lengths 45, 66, 63, 55, 54, and 77, in that order. Compute the distance from the center of the rectangular prism to .
Compute the number of ways to arrange the numbers 1, 2, 3, 4, 5, 6, and 7 around a circle such that the product of every pair of adjacent numbers on the circle is at most 20. (Rotations and reflections count as different arrangements.)
Kelvin the frog is on the bottom-left lily pad of a grid of lily pads, and his home is at the topright lily pad. He can only jump between two lily pads which are horizontally or vertically adjacent. Compute the number of ways to remove 4 of the lily pads so that the bottom-left and top-right lily pads both remain, but Kelvin cannot get home.
Ben has 16 balls labeled 1, 2, 3, ..., 16, as well as 4 indistinguishable boxes. Two balls are neighbors if their labels differ by 1. Compute the number of ways for him to put 4 balls in each box such that each ball is in the same box as at least one of its neighbors. (The order in which the balls are placed does not matter.)
Sophie is at on a coordinate grid and would like to get to . If Sophie is at , in a single step she can move to one of , , , or . She cannot revisit any points along her path, and neither her - coordinate nor her - coordinate can ever be less than 0 or greater than 3. Compute the number of ways for Sophie to reach .
In an grid of cells, each pair of edge-adjacent cells is connected by a door. Karthik wants to walk a path in this grid. He can start in any cell, but he must end in the same cell he started in, and he cannot go through any door more than once (not even in opposite directions). Compute the maximum number of doors he can go through in such a path.
Compute the number of ways to pick two rectangles in a grid of squares such that the edges of the rectangles lie on the lines of the grid and the rectangles do not overlap at their interiors, edges, or vertices. The order in which the rectangles are chosen does not matter.
Compute the number of ways to arrange 3 copies of each of the 26 lowercase letters of the English alphabet such that for any two distinct letters and , the number of 's between the first and second occurrences of equals the number of 's between the second and third occurrences of .
Albert writes 2025 numbers , ..., in a circle on a blackboard. Initially, each of the numbers is uniformly and independently sampled at random from the interval . Then, each second, he simultaneously replaces with for all (where and ). Compute the expected value of the number of distinct values remaining after 100 seconds.
Two points are selected independently and uniformly at random inside a regular hexagon. Compute the probability that a line passing through both of the points intersects a pair of opposite edges of the hexagon.
The circumference of a circle is divided into 45 arcs, each of length 1. Initially, there are 15 snakes, each of length 1, occupying every third arc. Every second, each snake independently moves either one arc left or one arc right, each with probability . If two snakes ever touch, they merge to form a single snake occupying the arcs of both of the previous snakes, and the merged snake moves as one snake. Compute the expected number of seconds until there is only one snake left.
Let , , and be pairwise distinct positive integers such that , , is an increasing arithmetic sequence in that order. Prove that .
A polyomino is a connected figure constructed by joining one or more unit squares edge-to-edge. Determine, with proof, the number of non-congruent polyominoes with no holes, perimeter 180, and area 2024.
Let and be two circles intersecting at distinct points and . Point varies along , and point on is chosen such that bisects the angle . Prove that as varies along , the circumcenter of (if it exists) varies along a fixed line.
Jerry places at most one rook in each cell of a grid of cells. A rook attacks another rook if the two rooks are in the same row or column and there are no other rooks between them.
Determine, with proof, the maximum number of rooks Jerry can place on the grid such that no rook attacks 4 other rooks.
Let be an acute triangle with orthocenter . Points and are on segments and , respectively, such that . Let be the foot of the altitude from to . Prove that .
Complex numbers , ..., each have magnitude 1. Let be a complex number distinct from , ..., such that
Prove that
Determine, with proof, whether a square can be dissected into finitely many (not necessarily congruent) triangles, each of which has interior angles , , and .
Let be a triangle with incenter . The incircle of triangle touches at . Let be the midpoint of , and let line meet the circumcircle of triangle again at . Let be the circle centered at tangent to and . If intersects segment at point , prove that .
Let be the set of integers. Determine, with proof, all primes for which there exists a function such that for any integer ,
and divides .
Determine, with proof, all possible values of across all triples of positive integers .
Call a 9-digit number a cassowary if it uses each of the digits 1 through 9 exactly once. Compute the number of cassowaries that are prime.
Compute
Jacob rolls two fair six-sided dice. If the outcomes of these dice rolls are the same, he rolls a third fair six-sided die. Compute the probability that the sum of outcomes of all the dice he rolls is even.
Let be an equilateral triangle with side length 4. Across all points inside triangle satisfying , compute the minimum possible length of .
(Here, denotes the area of triangle .)
Compute the largest possible radius of a circle contained in the region defined by in the coordinate plane.
Let be an equilateral triangle. Point lies on segment such that and . Points and lie on rays and , respectively, such that is the midpoint of . Compute .
The number
is an integer. Compute the sum of its prime factors.
A checkerboard is a rectangular grid of cells colored black and white such that the top-left corner is black and no two cells of the same color share an edge. Two checkerboards are distinct if and only if they have a different number of rows or columns. For example, a checkerboard and a checkerboard are considered distinct.
Compute the number of distinct checkerboards that have exactly 41 black cells.
Let and be points selected uniformly and independently at random inside a regular hexagon . Compute the probability that segment is entirely contained in at least one of the quadrilaterals , , , , , or .
A square of side length 1 is dissected into two congruent pentagons. Compute the least upper bound of the perimeter of one of these pentagons.
Let . Compute the remainder when is divided by .
Holden has a collection of polygons. He writes down a list containing the measure of each interior angle of each of his polygons. He writes down the list , , , , , , , , and , in some order. Compute .
A number is upwards if its digits in base 10 are nondecreasing when read from left to right. Compute the number of positive integers less than that are both upwards and multiples of 11.
A parallelogram can be folded over a straight line so that the resulting shape is a regular pentagon with side length 1. Compute the perimeter of .
Right triangle with and is inscribed in equilateral triangle such that , , and lie on segments , , and , respectively. Given that and , compute .
The Cantor set is defined as the set of real numbers such that and the digit 1 does not appear in the base-3 expansion of . Two numbers are uniformly and independently selected at random from the Cantor set. Compute the expected value of their absolute difference.
(Formally, one can pick a number uniformly at random from the Cantor set by first picking a real number uniformly at random from the interval , writing it out in binary, reading its digits as if they were in base- 3, and setting to 2 times the result.)
Let be a quadratic polynomial with real coefficients, and let , , , ... be a geometric progression of real numbers. Define . Given that , , , , and are equal to 1, 2, 3, 14, and 16, respectively, compute .
Let be a permutation chosen uniformly at random from the 9! possible permutations. Compute the expected value of .
A subset of is called balanced if for all elements and both in , there exists an element in such that 2025 divides . Compute the number of nonempty balanced subsets.
Compute the 100th smallest positive multiple of 7 whose digits in base 10 are all strictly less than 3.
Compute the unique 5-digit positive integer such that , , and
Let , , and be real numbers such that , , and . Given that there are three possible values for , compute the minimum possible value of .
Regular hexagon has side length 2. Circle lies inside the hexagon and is tangent to segments and . There exist two perpendicular lines tangent to that pass through and , respectively. Given that these two lines do not intersect on line , compute the radius of .
For any integer , let
A positive integer is chosen such that is divisible by . Compute the remainder when is divided by .
Let be a trapezoid such that , , , , and . Point lies inside the trapezoid such that and . Compute .
Isabella has a bag with 20 blue diamonds and 25 purple diamonds. She repeats the following process 44 times: she removes a diamond from the bag uniformly at random, then puts one blue diamond and one purple diamond into the bag. Compute the expected number of blue diamonds in the bag after all 44 repetitions.
Compute the number of ordered pairs of odd positive integers both less than 80 such that
Let be a function from nonnegative integers to nonnegative integers such that and
for all positive integers . Compute
(Here, is the greatest integer less than or equal to , and is the least positive integer greater than or equal to .)
Points and lie on circle with center . Let be a point inside . Suppose that , , , and . Points and are on such that and triangles and are similar with the same orientation. Compute .
Let , , and be real numbers satisfying the system of equations
Compute .
There exists a unique circle that is both tangent to the parabola at two points and tangent to the curve . Compute the radius of this circle.
In the coordinate plane, a closed lattice loop of length is a sequence of lattice points such that and are both the origin and for each . A closed lattice loop of length 2026 is chosen uniformly at random from all such loops. Let be the maximum integer such that the line with equation passes through at least one point of the loop. Compute the expected number of indices such that and lies on .
(A lattice point is a point with integer coordinates.)
Estimate the total number of pages that teams submitted to the Team Round this year. (All pages associated to at least one problem number count as submitted pages, even blank cover sheets for a problem.)
Submit a positive integer . If the correct answer is , you will receive points.
On the perimeter of a unit circle, 12 points are chosen uniformly and independently at random. Estimate the expected value of the area of the convex 12-gon formed by these points.
Submit a positive number written in decimal. If the correct answer is , you will receive round points.
Call an 8-digit number a flamingo if it uses each of the digits 2 through 9 exactly once. Estimate the number of flamingos that are prime.
Submit a positive integer . If the correct answer is , you will receive round points.
Ethan initially writes some numbers on a blackboard, each of which is either a 3 or a 5. He then repeatedly picks two numbers and replaces them with their sum, difference, product, or quotient (if the divisor is nonzero). Let denote the minimum number of numbers Ethan must initially write for him to be able to eventually write the number . For example, because Ethan could start with 3, 3, 3, 3, 5, and 5 on the board, then repeatedly multiply two numbers at a time to eventually get 2025.
Submit a comma- separated ordered 8- tuple of integers corresponding to the values of , , , , , , , and , in that order, or an X for any value you wish to leave blank. For instance, if you think and , you should submit "9, X, X, 8, X,
X, X, X". You will earn points, where is the number of correct answers you submit and is the number of incorrect (non- blank) answers.