MOMC IOQM Mock Donut 2

Instructions:

• All answers are in the integer range of 00 − 99. Although there is a non-zero chance of an intentional
bonus.
• Problems 1 − 10 are 2 Markers, 11 − 20 are 3 Markers and 21 − 30 are 5 Markers.

• Total time is 3 Hours.

• The test begins from the next page. So only proceed to the next page if you are starting the test!
• Mock Compiled by Agamjeet Singh
• The problems are credited to their respective sources (which can be found in the answer key PDF).

• After finishing the mock and checking your answers, be sure to fill in this form about the mock.
I will really appreciate it!
• Good luck!

1
 1. Equilateral triangles ABF and BCG are constructed outside regular pentagon ABCDE. Compute
∠F EG.

2. Find the greatest two-digit positive integer x such that for all three-digit (base 10) positive integers
abc, if abc is a multiple of x, then the three-digit (base 10) number bca is also a multiple of x.

3. Let ABCD be a cyclic quadrilateral, with AB = 7, BC = 11, CD = 13, and DA = 17. Let the
incircle of ABD hit BD at R and the incircle of CBD hit BD at S. What is RS?

4. Positive integers a, b, and c have the property that ab , bc , and ca end in 4, 2 and 9, respectively. Find
the minimum possible value of a + b + c.

5. Let A1 A2 . . . A19 be a regular nonadecagon. Lines A1 A5 and A3 A4 meet at X. Find the integer
nearest to ∠A7 XA5 .

SPACE FOR ROUGH WORK

2
 6. In triangle ABC, points M and N are the midpoints of AB and AC, respectively, and points P and
Q trisect BC.
√
Given that A, M, N, P , and Q lie on a circle and BC = 1, let the area of triangle ABC be
written as nm where m, n are positive integers such that m, n are relatively prime. Find m + n.

7. Let the number of quadruples (a, b, c, d) of positive integers satisfying

12a + 21b + 28c + 84d = 2024

be M . Find the largest prime factor of M .

8. Let (x, y) be the unique ordered pair of real numbers satisfying the system of equations
x 1 y 1
p − = 7 and p + = 4.
x2 + y2 x x2 + y2 y

If |x| = rs and |y| = t

u where r, s, t, u are positive integers such that gcd(r, s) = 1 and gcd(t, u) = 1, find
r + s − t − u.

SPACE FOR ROUGH WORK

3
 9. Let ABC be a triangle with ∠BAC = 90◦ . Let D, E, and F be the feet of altitude, angle bisector,
and median from A to BC, respectively. If DE = 3 and EF = 5, compute the length of BC.

10. 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
7 × 7 grid. Find the maximum number of cells it can visit without visiting the same cell twice (including its
starting cell).

11. An ordered pair (a, b) of positive integers is called spicy if gcd(a + b, ab + 1) = 1. Find the number
of positive integers n < 100 such that both (99, n) and (101, n) are spicy.

12. Let ℓ and m be two non-coplanar lines in space, and let P1 be a point on ℓ. Let P2 be the point on
m closest to P1 , P3 be the point on ℓ closest to P2 , P4 be the point on m closest to P3 , and P
√5
be the point
m
on ℓ closest to P4 . Given that P1 P2 = 5, P2 P3 = 3, and P3 P4 = 2, let P4 P5 be written as n where m, n
are positive integers such that m, n are relatively prime. Find m + n.

SPACE FOR ROUGH WORK

4
 13. Let ABC be a triangle. Let X be the point on side AB such that ∠BXC = 60◦ . Let P be √
the point
on segment CX such that BP ⊥ AC. Given that AB = 6, AC = 7, and BP = 4, let CP = a − b where
a, b are positive integers. Find a + b.

14. Find the number of ways there are to assemble 2 red unit cubes and 25 white unit cubes into a
3 × 3 × 3 cube such that red is visible on exactly 4 faces of the larger cube. (Rotations and reflections are
considered distinct.)

15. 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. Let the probability that
Charlie wins regardless be mn where m, n are relatively prime positive integers. Find m + n.

16. In triangle ABC, a circle ω with center O passes through B and C and intersects segments AB and
AC again at B ′ and C ′ , respectively. Suppose that the circles with diameters BB ′ and CC ′ are externally
tangent to each other at T . If AB = 18, AC = 36, and AT = 12, let AO = m n where m, n are relatively
prime positive integers. Find m + n.

SPACE FOR ROUGH WORK

5
 17. a ↑↑ b is given by the recurrence
(
a b=1
a ↑↑ b =
aa↑↑(b−1) b≥2

What is the remainder of 3 ↑↑ (3 ↑↑ (3 ↑↑ 3)) when divided by 60?

18. Let ABCD be a convex trapezoid such that ∠DAB = ∠ABC = 90◦ , DA = 2, AB = 3, and BC = 8.
Let ω be a circle passing √
through A and tangent to segment CD at point T . Suppose that the center of ω lies
on line BC. Let CT = a b − c where a, b, c are positive integers such that a + b + c is minimal. Find a + b + c.

19. Let φ(n) be the number of positive integers less than or equal to n that are coprime to n. Let
φk (n) = (φ ◦ · · · ◦ φ)(n) be φ composed with itself k times. Define θ(n) = min k ∈ N | φk (n) = 1 . For
| {z }
k
example,
φ1 (13) = φ(13) = 12
φ2 (13) = φ(φ(13)) = 4
φ3 (13) = φ(φ(φ(13))) = 2
φ4 (13) = φ(φ(φ(φ(13)))) = 1
so θ(13) = 4. Let f (r) = θ (13r ). Find the greatest positive integer N such that f (N ) < 100.

SPACE FOR ROUGH WORK

6
 20. There exists a unique polynomial P in two variables such that for all positive integers m and n,
m X
X n
P (m, n) = (i + j)7 .
i=1 j=1

Let |P (3, −3)| = M . Find the sum of digits of M .

21. 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. Find the sum of digits of the number of ways HMMTLand could
have constructed the roads.

22. In each cell of a 4 × 4 grid, one of the two diagonals is drawn uniformly at random. Let pq be 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 where p, q are relatively prime positive integers. Find the sum of digits
of p + q.




23. Let P (n) = n − 13 n − 23 . . . n − 403 for positive integers n. Suppose that d is the largest
positive integer that divides P (n) for every integer n > 2023. If d is a product of m (not necessarily distinct)
prime numbers, compute m.

SPACE FOR ROUGH WORK

7
 24. Nine distinct positive integers summing to 74 are put into a 3 × 3 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. Find the greatest positive integer
that could have been originally in the center of the grid.

25. Let a, b, c, d, (a + b + c + 18 + d), (a + b + c + 18 − d), (b + c), and (c + d) be distinct prime numbers

such that a + b + c = 2010, a, b, c, d ̸= 3, and d ≤ 50. Find the sum of square of digits of the maximum value
of the difference between two of these prime numbers.

26. You are at one vertex of a equilateral triangle with side length 1. All of the edges of the equilateral
triangle will reflect the laser beam perfectly (angle of incidence is equal to angle of reflection). Given that
the laser beam bounces off exactly 137 edges and returns to the original vertex without touching any other
vertices, let M be the maximum possible distance the beam could have traveled, √ and m be the minimum
possible distance the beam could have traveled. Find the integer closest to M 2 − m2 .

27. Let ABT CD be a convex pentagon with area 22 such that AB = CD and the circumcircles of
triangles T AB and T CD are internally tangent. Given that ∠AT D = 90◦ , ∠BT C = 120◦ , BT = 4, and
CT = 5, compute the integer nearest to the area of triangle T AD.

SPACE FOR ROUGH WORK

8
 28. For each prime p, a polynomial P (x) with rational coefficients is called p-good if and only if there
exist three integers a, b, and c such that 0 ≤ a < b < c < p3 and p divides all the numerators of P (a), P (b),
and P (c), when written in simplest form. Find the number of ordered pairs (r, s) of rational numbers such
that the polynomial x3 + 10x2 + rx + s is p-good for infinitely many primes p.

29. Each lattice point with nonnegative coordinates is labeled with a nonnegative integer in such a
way that the point (0, 0) is labeled by 0, and for every x, y ≥ 0, the set of numbers labeled on the points
(x, y), (x, y + 1), and (x + 1, y) is {n, n + 1, n + 2} for some nonnegative
p integer n. Let S be the set of all
possible labels for the point (2000, 2024). Find the integer nearest to |S| where |S| represents the number
of elements in the set S.

30. Suppose point P is inside quadrilateral ABCD such that

∠P AB = ∠P DA,
∠P AD = ∠P DC,
∠P BA = ∠P CB, and
∠P BC = ∠P CD.

If P A = 4, P B = 5, and P C = 10, find the integer nearest to the perimeter of ABCD.

SPACE FOR ROUGH WORK