0% found this document useful (0 votes)
2K views150 pages

IOQM Mock Espresso 2 Exam Guide

The document is a mock test containing 30 mathematical problems with varying difficulty and point values. Each problem requires answers in the integer range of 00-99, and the total time allowed for the test is 3 hours. The problems cover a range of topics including geometry, number theory, and combinatorics.

Uploaded by

srdas9494
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2K views150 pages

IOQM Mock Espresso 2 Exam Guide

The document is a mock test containing 30 mathematical problems with varying difficulty and point values. Each problem requires answers in the integer range of 00-99, and the total time allowed for the test is 3 hours. The problems cover a range of topics including geometry, number theory, and combinatorics.

Uploaded by

srdas9494
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MOMC IOQM Mock Espresso 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. Cindy has a collection of identical rectangular prisms. She stacks them, end to end, to
form 1 longer rectangular prism. Suppose that joining 11 of them will form a rectangular prism
with 3 times the surface area of an individual rectangular prism. How many will she need to join
end to end to form a rectangular prism with 9 times the surface area?

2. Let 1 = a1 < a2 < a3 < . . . < ak = n be the positive divisors of n in increasing order. If
n = a33 − a32 , what is n?

3. A point (x0 , y0 ) with integer coordinates is a primitive point of a circle if for some pair of
integers (a, b), the line ax + by = 1 intersects the circle at (x0 , y0 ). How many primitive points are
there of the circle centered at (2, −3) with radius 5?

4. Find the sum of all possible values of |m+n| where m, n are integers that satisfy m2 +2m−35 =
2n .

SPACE FOR ROUGH WORK

2
5. Elizabeth is at a candy store buying jelly beans. Elizabeth begins with 0 jellybeans. With
each scoop, she can increase her jellybean count to the next largest multiple of 30, 70 or 110.
(For example, her next scoop after 70 can increase her jellybean count to 90, 110, or 140). Let the
smallest number of jellybeans Elizabeth can collect in more than 100 different ways be S. Find
the integer nearest to S/10.

6. One of the six digits in the expression 435 · 605 can be changed so that the product is a
perfect square N 2 . Find the remainder when N is divided by 100.

7. Triangle △ABC has AB = 3, BC = 4, and AC = 5. Let M and N be the midpoints of AC


and BC, respectively. If line AN intersects the circumcircle of triangle △BM C at points X and Y ,
then XY 2 = m
n for some relatively prime positive integers m, n. Find the sum of digits of m + n.

SPACE FOR ROUGH WORK

3
8. Let ABCD be a quadrilateral with an inscribed circle ω and let P be the intersection of
its diagonals AC and BD. Let R1 , R2 , R3 , R4 be the circumradii of triangles AP B, BP C, CP D, DP A
respectively. If R1 = 31 and R2 = 24 and R3 = 12, find R4 .

9. Start by writing the integers 1, 2, 4, 6 on the blackboard. At each step, write the smallest
positive integer n that satisfies both of the following properties on the board.
• n is larger than any integer on the board currently.
• n cannot be written as the sum of 2 distinct integers on the board.
Find the largest integer less than 100 that you write on the board.

10. Let ABC be a triangle with AB = 13, BC = 14, and CA = 15. Let ℓ be a line passing through
two sides of triangle ABC. Line ℓ cuts triangle ABC into two figures, a triangle and a quadrilat-
eral, that have equal perimeter. What is the integer closest to the maximum possible area of the
triangle?

11. Positive integer n can be written in the form a2 − b2 for at least 12 pairs of positive integers
(a, b). Find the number of divisors of the smallest possible value of n.

SPACE FOR ROUGH WORK

4
12. Let P and A denote the perimeter and area respectively of a right triangle with relatively
2
prime integer side-lengths. Find the largest possible integral value of PA .

13. Let ABCD be a square. Point E is chosen inside


√ the square such that AE = 6. Point F is
chosen outside the square such that BE = BF = 2 5, ∠ABF = ∠CBE, and AEBF is cyclic. Find
the area of ABCD.

14. Let ak = ±1 for all integers 1 ≤ k ≤ 2018. The sum


X
ai aj
1≤i<j≤2018

can take on both positive and negative values. Find the smallest positive value of the sum.

15. Let A, B, C, D be points, in order, on a straight line such that AB = BC = CD. Let E be
a point closer to B than D such that BE = EC = CD and let F be the midpoint of√DE. Let AF
intersect EC at G and let BF intersect EC at H. If [BHC] + [GHF ] = 1, then AD2 = a c b where a, b,
and c are positive integers, a and c are relatively prime, and b is not divisible by the square of any
prime. Find the sum of square of digits of a + b + c.

SPACE FOR ROUGH WORK

5
16. Kelvin the Frog was bored in math class one day, so he wrote all ordered triples (a, b, c)
of positive integers such that abc = 2310 on a sheet of paper. Then he finds the sum S of all the
integers he wrote down. In other words, he finds
X
S= (a + b + c)
abc=2310
a,b,c∈N

where N denotes the positive integers. Determine the sum of all prime factors of S with multiplic-
ity. (For example, such a sum for 12 would be 2 + 2 + 3 = 7.)

17. Let ABCD be a quadrilateral with side lengths AB = 2, BC = 3, CD = 5,√ and DA = 4. Let
the maximum possible radius of a circle inscribed in quadrilateral ABCD be a c b where a, b, c are
positive integers such that a + b + c is minimal. Find a + b + c.

18. Sean is a biologist, and is looking at a string of length 66 composed of the letters A, T, C, G.
A substring of a string is a contiguous sequence of letters in the string. For example, the string
AGT C has 10 substrings: A, G, T, C, AG, GT, T C, AGT, GT C, AGT C. Let the maximum number of
distinct substrings of the string Sean is looking at be 100m + n where m, n < 100 are positive
integers. Find m + n.

SPACE FOR ROUGH WORK

6
19. Let ω and Γ by circles such that ω is internally tangent to Γ at a point P . Let AB be a
chord of Γ tangent to ω at a point Q. Let R ̸= P be the second intersection of line P Q with Γ. If
AQ
the radius of Γ is 17, the radius of ω is 7, and BQ = 3, find the integer nearest to the circumradius
of triangle AQR.

20. Find the sum of digits of the number of 5-digit numbers n that exist such that each n is
divisible by 9 and none of the digits of n are divisible by 9?

21. Let (a, b, c, d, e) be an integer solution to the system of equations

a + d = 12
b + ad + e = 57
c + bd + ae = 134
cd + be = 156
ce = 72
Find the maximal value of b + d.

22. Define a permutation of the set {1, 2, 3, . . . , n} to be sortable if upon cancelling an appro-
priate term of such permutation, the remaining n − 1 terms are in increasing order. If f (n) is the
number of sortable permutations of {1, 2, 3, . . . , n}, find the remainder when
2024
X
(−1)i · f (i)
i=1

is divided by 100. Note that the empty set is considered sortable.

SPACE FOR ROUGH WORK

7
23. In circle Ω, let AB = 65 be the diameter and let points C and D lie on the same side of
arc AB such that CD = 16, with C closer to B and D closer to A. Moreover, let AD, BC, AC, and
BD all have integer lengths. Two other circles, circles ω1 and ω2 , have AC and BD as their diam-
eters, respectively. Let circle ω1 intersect AB at a point E ̸= A and let circle ω2 intersect AB at
a point F ̸= B. Then EF = m n , for relatively prime integers m and n. Find the sum of digits of m+n.

24. In a 25 × n grid, each square is colored with a color chosen among 8 different colors. Let n
be as minimal as possible such that, independently from the coloration used, it is always possible
to select 4 coloumns and 4 rows such that the 16 squares of the intersections are all of the same
color. Find the sum of digits of n.

25. Kelvin the Frog and 10 of his relatives are at a party. Every pair of frogs is either friendly
or unfriendly. When 3 pairwise friendly frogs meet up, they will gossip about one another and
end up in a fight (but stay friendly anyway). When 3 pairwise unfriendly frogs meet up, they will
also end up in a fight. In all other cases, common ground is found and there is no fight. If all 11 3
triples of frogs meet up exactly once, what is the minimum possible number of fights?

26. The equation

(x − 1)(x − 2)(x − 4)(x − 5)(x − 7)(x − 8) = (x − 3)(x − 6)(x − 9)


has distinct roots r1 , r2 , . . . , r6 . Find the integer nearest to the square root of
6
X
(ri − 1) (ri − 2) (ri − 4)
i=1

SPACE FOR ROUGH WORK

8
27. Let P be the set of all polynomials p(x) = x4 + 2x2 + mx + n, where m and n range over the
positive reals. There exists a unique p(x) ∈ P such that p(x) has a real root, m is minimized, and
p(1) = 99. Find n.

28. Mark has six boxes lined up in a straight line. Inside each of the first three boxes are a red
ball, a blue ball, and a green ball. He randomly selects a ball from each of the three boxes and
puts them into a fourth box. Then, he randomly selects a ball from each of the four boxes and
puts them into a fifth box. Next, he randomly selects a ball from each of the five boxes and puts
them into a sixth box, arriving at three boxes with 1, 3, and 5 balls, respectively. The probability
that the box with 3 balls has each type of color is m
n , where m and n are relatively prime positive
integers. Find m + n.

29. Edward has a 3 × 3 tic-tac-toe board and wishes to color the squares using 3 colors. Sup-
pose that the number of ways in which he can color the board such that there is at least one row
whose squares have the same color and at least one column whose squares have the same color
be 100a + b where a, b < 100 are positive integers. Find |a − b|. Note that a coloring does not have
to contain all three colors and Edward cannot rotate or reflect his board.

30. Let ABC be an acute triangle with BC = 48. Let M be the midpoint of BC, and let D
and E be the feet of the altitudes drawn from B and C to AC and AB respectively. Let P be the
intersection between the line through A parallel to BC and line DE. If AP = 10, compute the
length of P M .

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Espresso 1
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. Find the number of ordered triples of positive integers (a, b, c) such that ab + c! = 28.

2. Given that C, A, T, F, I, S, and H are digits, not necessarily distinct, and that

3 · CAT · F ISH = CAT F ISH,

let the sum of square of digits of the greatest possible value of CAT F ISH be N . Find the product
of digits of N .

3. Ari repeatedly rolls a standard, fair, six-sided die. Let R(n) be the nth number rolled, and let
Q(n) = R(1) · R(2) · . . . · R(n). Let the probability that there exists an n such that Q(n) = 100 and for
all m < n, Q(m) is not a perfect square be pq where p, q are relatively prime positive integers. Find
the largest prime factor of p + q.
√ √
4. Trapezoid ARM L has AR∥M L. Given that AR = 4, RM = 26, M L = 12, and LA = 42, find
the integer nearest to AM 2 .

SPACE FOR ROUGH WORK

2
−→
5. In △ABC, ∠A = 90◦ , AC = 1, and AB = 5. Point D lies on ray AC such that ∠DBC = 2∠CBA.
Let AD = mn where m, n are relatively prime positive integers. Find m + n.

6. In triangle ABC, ∠C = 90◦ and BC = 17. Point E lies on side BC such that ∠CAE = ∠EAB.
The circumcircle of triangle ABE passes through a point F on side AC. Given that CF = 3, find
the integer nearest to AB.

7. Find the difference between the largest and the smallest 2-digit prime number p such that
there exists a prime number q for which 100q + p is a perfect square.

8. Find the number of ways to color 3 cells in a 3 × 3 grid so that no two colored cells share an
edge.

9. Sets A, B, and C satisfy |A| = 92, |B| = 35, |C| = 63, |A ∩ B| = 16, |A ∩ C| = 51, |B ∩ C| = 19.
Compute the number of possible values of |A ∩ B ∩ C|.

SPACE FOR ROUGH WORK

3
10. For any positive integer n, let τ (n) denote the number of positive divisors of n. If n is a
τ (n2 ) τ (n7 )
positive integer such that τ (n) = 3, compute τ (n) .

1
Pn−1
11. Let {an } be a sequence with a0 = 1, and for all n > 0, an = 2 i=0 ai . Find the greatest
value of n for which an < 2024.

12. Chris the frog begins on a number line at 0. Chris takes jumps of lengths 1, 2, 3, . . . , 2024,
in that order. If Chris’s current location is an even integer, he jumps in the positive direction;
otherwise, he jumps in the negative direction. Let P (n) denote Chris’s location after the nth jump.
P2024
Let S = | j=1 P (j)|. Find the largest prime factor of S.

13. Find the number of ordered pairs of integers (a, b) such that the polynomials x2 − ax + 24
and x2 − bx + 36 have one root in common.

SPACE FOR ROUGH WORK

4
14. Cube ARM LKHJC, with opposite faces ARM L and HJCK, is inscribed in a cone, such
that A is the vertex of the cone, edges AR, AL, AH lie on the surface of the cone, and vertex C,
diagonally opposite A, is on the base of the cone. Given that AR = 6, find the integer nearest to
the radius of the cone.

15. Let (a1 , a2 , . . . , a8 ) be a permutation of (1, 2, . . . , 8). Find the maximum possible number of
elements of the set
{a1 , a1 + a2 , . . . , a1 + a2 + · · · + a8 }
that can be perfect squares.

16. Given a positive integer k, let ∥k∥ denote the absolute difference between k and the nearest
perfect square. For example, ∥13∥ = 3 since the nearest perfect square to 13 is 16. Let the smallest
positive integer n such that
∥1∥ + ∥2∥ + · · · + ∥n∥
= 100
n
be N . Find the sum of digits of N .

SPACE FOR ROUGH WORK

5
17. Find the number of nonempty subsets S ⊆ {−10, −9, −8, . . . , 8, 9, 10} that satisfy |S|+min(S)·
max(S) = 0.

18. Michel starts with the string HM M T . An operation consists of either replacing an occur-
rence of H with HM , replacing an occurrence of M M with M OM , or replacing an occurrence of
T with M T . For example, the two strings that can be reached after one operation are HM M M T
and HM OM T . Find the number of distinct strings Michel can obtain after exactly 9 operations.

19. A positive integer n is loose it has six positive divisors and satisfies the property that any
two positive divisors a < b of n satisfy b ≥ 2a. Find the number of loose positive integers less than
100.

20. Let (x1 , y1 ) , . . . , (xk , yk ) be the distinct real solutions to the equation
6 4 3
x2 + y 2 = x2 − y 2 = 2x3 − 6xy 2 .
Pk
Then i=1 (xi + yi ) can be expressed as ab , where a and b are relatively prime positive integers.
Find a + b.

SPACE FOR ROUGH WORK

6
21. On July 17, 2017, the nation of Armlandia will turn n2 years old and the nation of Nysmlistan
will turn n years old. The next four anniversaries for which Nysmlistan’s age divides Armlandia’s
age will occur, in order, on July 17 in the years 2027, 2032, 2038, and M . Find the sum of square of
digits of M .

22. Rhombus ARM L has its vertices on the graph of y = ⌊x⌋ − {x}. Given that [ARM L] = 8, let
the least upper bound for tan A be m
n where m, n are relatively prime positive integers. Find the
sum of digits of m + n.

23. Find the sum of digits of the least positive N such that there exists a quadratic polynomial
f (x) with integer coefficients satisfying

f (f (1)) = f (f (5)) = f (f (7)) = f (f (11)) = N.

24. Let (x1 , y1 ) , (x2 , y2 ) , (x3 , y3 ) , (x4 , y4 ), and (x5 , y5 ) be the vertices of a regular pentagon cen-
tered at (0, 0). Find the sum of all positive integers k such that the equality
5
X 5
X
xki = yik
i=1 i=1

must hold for all possible choices of the pentagon.

SPACE FOR ROUGH WORK

7
25. The numbers 1, 2, . . . , 10 are randomly arranged in a circle. Let p be the probability that for
every positive integer k < 10, there exists an integer k ′ > k such that there is at most one number
between k and k ′ in the circle. If p can be expressed as ab for relatively prime positive integers a
and b, find the sum of square of digits of a + b.

26. Find the number of permutations π of the set {1, 2, . . . , 10} so that for all (not necessarily
distinct) m, n ∈ {1, 2, . . . , 10} where m + n is prime, π(m) + π(n) is prime.

27. Let a ̸= b be positive real numbers and m, n be positive integers. An m + n-gon P has the
property that m sides have length a and n sides have length b. Further suppose that P can be
inscribed in a circle of radius a + b. Let the number of ordered pairs (m, n), with m, n ≤ 100, for
which such a polygon P exists for some distinct values of a and b be 100p + q where p, q < 100 are
positive integers. Find p + q.

SPACE FOR ROUGH WORK

8
28. Let π be a uniformly random permutation of the set {1, 2, . . . , 100}. The probability that
π 20 (20) = 20 and π 21 (21) = 21 can be expressed as ab , where a and b are relatively prime positive
integers. Find the sum of digits of a + b. (Here, π k means π iterated k times.)

29. In the Cartesian plane, let A = (0, 0), B = (200, 100), and C = (30, 330). Find the sum of
square of digits of the number of ordered pairs (x, y) of integers so that x + 21 , y + 12 is in the
interior of triangle ABC.

30. Let S = (x, y) ∈ Z2 | 0 ≤ x ≤ 11, 0 ≤ y ≤ 9 . Find the sum of digits of the number of se-
quences (s0 , s1 , . . . , sn ) of elements in S (for any positive integer n ≥ 2 ) that satisfy the following
conditions:

• s0 = (0, 0) and s1 = (1, 0)


• s0 , s1 , . . . , sn are distinct,
• for all integers 2 ≤ i ≤ n, si is obtained by rotating si−2 about si−1 by either 90◦ or 180◦ in the
clockwise direction.

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Donut 4
Instructions:

• All answers should be in the integer range of 00 to 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 on the next page. Please proceed to the next page only if you are ready to start 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, please be sure to fill in this form about the
mock. I really appreciate it!
• Good luck!

1
1. Find the number of non-empty subsets S of {1, 2, 3, . . . , 20} for which |S| · max{S} = 18. (Note:
|S| is the number of elements of the set S.)

2. A class of 218 students takes a test. Each student’s score is an integer from 0 to 100, in-
clusive. Find the integer nearest to the greatest possible difference between the mean and the
median scores.

3. Let S be the set of points (x, y) whose coordinates satisfy x2 + y 2 ≤ 36 and (max{x, y})2 ≤ 27.
Find the greatest integer less than the perimeter of S.

4. Given that a, b, and c are positive integers such that a + bc = 20 and a + b = 18, compute the
least possible value of abc.

5. Tom writes down the integers from 1 to 100, inclusive, on a chalkboard and then erases
every number that contains a prime digit. Find the sum of the digits of the sum of the digits that
remain on the chalkboard.

SPACE FOR ROUGH WORK

2
6. Consider a permutation (a1 , a2 , a3 , a4 , a5 ) of {1, 2, 3, 4, 5}. We say the tuple (a1 , a2 , a3 , a4 , a5 ) is
flawless if for all 1 ≤ i < j < k ≤ 5, the sequence (ai , aj , ak ) is not an arithmetic progression (in
that order). Find the number of flawless 5-tuples.

7. What is the smallest positive integer n which cannot be written in any of the following forms?

• n = 1 + 2 + · · · + k for a positive integer k.


• n = pk for a prime number p and integer k.
• n = p + 1 for a prime number p.

• n = pq for some distinct prime numbers p and q


8. How many ways can the eight vertices of a three-dimensional cube be colored red and blue
such that no two points connected by an edge are both red? Rotations and reflections of a given
coloring are considered distinct.

SPACE FOR ROUGH WORK

3
9. Seven little children sit in a circle. The teacher distributes pieces of candy to the children
in such a way that the following conditions hold.
• Every little child gets at least one piece of candy.
• No two little children have the same number of pieces of candy.

• The numbers of candy pieces given to any two adjacent little children have a common factor
other than 1.
• There is no prime dividing every little child’s number of candy pieces.
What is the smallest number of pieces of candy that the teacher must have ready for the little
children?


10. Regular hexagon RAN GES has side length 6. Pentagon RAN GE is revolved √ 360 about the
line containing RE to obtain a solid. The volume of the solid is k · π. Let k = a b where a, b are
positive integers such that b is square-free. Find the largest prime factor of a.

11. A fair 12-sided die has faces numbered 1 through 12. The die is rolled twice, and the results
of the two rolls are x and y, respectively. Given that tan(2θ) = xy for some θ with 0 < θ < π2 , let the
probability that tan θ is rational be m
n where m, n are relatively prime positive integers. Find m + n.

SPACE FOR ROUGH WORK

4
12. Find the product of all positive values of x that satisfy

⌊x + 1⌋2x − 19⌊x + 1⌋x + 48 = 0.

13. Triangle ABC is inscribed in circle ω. The line containing the median from A meets ω again
at M , the line containing the angle bisector of ∠B meets ω again at R, and the line containing the
altitude from C meets ω again at L. Given that quadrilateral ARM L is a rectangle, find the degree
measure of ∠BAC.

14. Find the number of divisors of the least four-digit integer N for which N and N + 2018
contain a total of 8 distinct digits.

15. The increasing infinite arithmetic sequence of integers x1 , x2 , x3 , . . . contains the terms 17!
and 18!. Find the greatest integer X for which X! must also appear in the sequence.

16. For any positive integer x, define Accident(x) to be the set of ordered pairs (s, t) with s ∈
{0, 2, 4, 5, 7, 9, 11} and t ∈ {1, 3, 6, 8, 10} such that x + s − t is divisible by 12. For any nonnegative
integer i, let ai denote the number of x ∈ {0, 1, . . . , 11} for which | Accident(x)| = i. Find

a20 + a21 + a22 + a23 + a24 + a25 .

SPACE FOR ROUGH WORK

5
17. Let a, b, c, x be reals with (a + b)(b + c)(c + a) ̸= 0 that satisfy

a2 a2 b2 b2 c2 c2
= + 20, = + 24, and = +x
a+b a+c b+c b+a c+a c+b
Find |x|.

18. Let ABC be a triangle with AB = 5, AC = 4, BC = 6. The angle bisector of C intersects side
AB at X. Points M and N are drawn √
on sides BC and AC, respectively, such that XM ∥AC and
a b
XN ∥BC. Let the length M N be c where a, b, c are positive integers such that a + b + c is minimal
and b is square-free. Find a + b + c.

19. Suppose that x and y are positive real numbers such that x2 − xy + 2y 2 = 8. Find the
smallest integer greater than the maximum possible value of x2 + xy + 2y 2 .

20. Let ω be a circle, and let ABCD be a quadrilateral inscribed in ω. Suppose that BD and
AC intersect at a point E. The tangent to ω at B meets line AC at a point F , so that C lies between

E and F . Given that AE = 6, EC = 4, BE = 2, and BF = 12, let DA = p q where p, q are positive
integers such that q is square-free. Find p + q.

SPACE FOR ROUGH WORK

6
21. Let S be the set of points (x, y) whose coordinates satisfy the system of equations:

⌊x⌋ · ⌈y⌉ = 20
⌈x⌉ · ⌊y⌋ = 18.

Let the least upper bound of the set of distances between points in S be a b where a, b are
positive integers such that b is square-free. Find a + b.

22. Find the sum of digits of the least integer d > 0 for
√ which there exist distinct lattice
points A, B, and C in the coordinate plane, each exactly d units from the origin, satisfying
csc(∠ABC) > 2018.

23. Let Γ be a circle with diameter XY and center O, and let γ be a circle with diameter
OY . Circle ω1 passes through Y and intersects Γ and γ again at A and B, respectively. Circle
ω2 also passes through Y and intersects Γ and γ again at D and C, respectively. Given that
AB = 1, BC = 4, CD = 2, and AD = 7, find the integer nearest to the sum of the areas of ω1 and
ω2 .

SPACE FOR ROUGH WORK

7
24. Find the largest prime factor of the number of unordered collections of three integer-area
rectangles such that the three rectangles can be assembled without overlap to form one 3 × 5 rect-
angle. (For example, one such collection contains one 3 × 3 and two 1 × 3 rectangles, and another
such collection contains one 3 × 3 and two 2 × 1.5 rectangles. The latter collection is equivalent to
the collection of two 1.5 × 2 rectangles and one 3 × 3 rectangle.)

25. Let S1 = {1, 2, 3, 4}, S2 = {3, 4, 5, 6}, and S3 = {6, 7, 8}. Let 100a + b be the number of sets H
that satisfy both of the following properties:
• H ⊆ {1, 2, 3, 4, 5, 6, 7, 8};
• each of H ∩ S1 , H ∩ S2 , and H ∩ S3 is non-empty.

where a, b < 100 are positive integers. Find a + b.

26. How many lines pass through exactly two points in the following hexagonal grid?

SPACE FOR ROUGH WORK

8
27. Suppose that (a1 , . . . , a20 ) and (b1 , . . . , b20 ) are two sequences of integers such that the
sequence (a1 , . . . , a20 , b1 , . . . , b20 ) contains each of the numbers 1, . . . , 40 exactly once. Suppose the
maximum possible value of the sum
20 X
X 20
min (ai , bj )?
i=1 j=1

is 100a + b where a, b < 100 are positive integers. Find a + b.

28. Let A = {a1 , a2 , . . . , a7 } be a set of distinct positive integers such that the mean of the el-
ements of any nonempty subset of A is an integer. √ Let the smallest possible value of the sum of
the elements in A be S. Find the integer nearest to S.

29. Let a1 , a2 , . . . be an infinite sequence of integers such that ai divides ai+1 for all i ≥ 1, and
let bi be the remainder when ai is divided by 210. What is sum of digits of the maximal number of
distinct terms in the sequence b1 , b2 , . . .?

30. Let n be a positive integer. A sequence (a0 , . . . , an ) of integers is acceptable if it satisfies the
following conditions:
(a) 0 = |a0 | < |a1 | < · · · < |an−1 | < |an |.

(b) The sets {|a1 − a0 | , |a2 − a1 | , . . . , |an−1 − an−2 | , |an − an−1 |} and 1, 3, 9, . . . , 3n−1 are equal.

Let the number of acceptable sequences of integers be f (n). Find the greatest positive integer n
such that f (n) < 2024.

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Donut 3
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+ℓ)2 13
1. Let ℓ be a real number satisfying the equation 1+ℓ2 = 37 . Then

(1 + ℓ)3 m
= ,
1 + ℓ3 n
where m and n are positive coprime integers. Find m + n.

2. Construction Mayhem University has been on a mission to expand and improve its campus!
The university has recently adopted a new construction schedule where a new project begins ev-
ery two days. CMU officials claim that each project will take exactly three days to complete, but
in reality each project will take exactly one more day than the previous one to complete (so the
first project takes 3, the second takes 4, and so on.) Suppose the new schedule starts on Day 1.
On which day will there first be at least 10 projects in place at the same time?

3. Let ABC be a triangle. The angle bisector of ∠B intersects AC at point P , while the angle
bisector of ∠C intersects AB at a point Q. Suppose the area of △ABP is 27, the √area of △ACQ is
32, and the area of △ABC is 72. The length of BC can be written in the form m n where m and
n are positive integers with n as small as possible. What is m + n?

4. For a set S ⊆ N, define f (S) = {⌈ s⌉|s ∈ S}. Suppose there are 100a + b sets T such that
|f (T )| = 2 and f (f (T )) = {2}, where a, b < 100 are positive integers. Find a + b.

SPACE FOR ROUGH WORK

2
5. A line with negative slope passing through the point (18, 8) intersects the x and y axes at
(a, 0) and (0, b) respectively. What is the smallest possible value of a + b ?

6. Right isosceles triangle T is placed in the first quadrant of the coordinate plane. Suppose
that the projection of T onto the x-axis has length 6, while the projection of T onto the y-axis has
length 8. What is the greatest possible area of the triangle T ?


7. For all integers n ≥ 2, let f (n) denote the largest positive integer m such that m
n is an
integer. Find the sum of all distinct prime divisors of f (2) + f (3) + · · · + f (100).

SPACE FOR ROUGH WORK

3
8. What is the largest positive integer n < 100 for which there is a positive integer m satisfying

lcm(m, n) = 3m × gcd(m, n)?

9. Find the number of ordered triples (a, b, c) of integers that satisfy the equation

abc = 2a + 2b + 2c + 4

10. Let f (x) = x3 − 7x2 + 16x − 10. As x ranges over all integers, find the sum of distinct prime
values taken on by f (x).

11. Suppose ABCD is a convex quadrilateral satisfying AB = BC, AC = BD, ∠ABD = 80◦ , and
∠CBD = 20◦ . What is 180 − ∠BCD in degrees?

12. Suppose integers a < b < c satisfy

a + b + c = 95 and a2 + b2 + c2 = 3083.

Find c.

SPACE FOR ROUGH WORK

4
13. The Pascal Squared Triangle is defined as follows:
• In the nth row, where n ≥ 1, the first and last elements of the row equal n2
• Each other element is the sum of the two elements directly above it.

Let Sn denote the sum of the entries in the nth row. Let N denote the number of integers 1 ≤ n ≤ 106
such that Sn divisible by 13. Find the sum of digits of N .

14. Find the sum of square of digits of

X
ij(−1)i+j .
1≤i<j≤50

15. Point A lies on the circumference of a circle Ω with radius 78. Point B is placed such
that AB is tangent to the circle and AB = 65, while point C is located on Ω such that BC = 25.
Compute the length of AC.

SPACE FOR ROUGH WORK

5
16. For each integer n ≥ 1, let Sn be the set of integers k > n such that k divides 30n − 1. Find
the last two digits of the number of of elements in the set
[
S= Si = S1 ∪ S2 ∪ S3 ∪ . . .
i≥1

that are less than 2016.

17. For some positive integer n, consider the usual prime factorization
k
Y
n= pei i = pe11 pe22 . . . pekk
i=1

where k is the number of prime factors of n and pi are the prime factors of n. Define Q(n), R(n) by
k
Y k
Y
Q(n) = ppi i and R(n) = eei i .
i=1 i=1

For how many 1 ≤ n ≤ 70 does R(n) divide Q(n)?

18. Let P Q and P R be tangents to a circle ω with diameter AB so that A, Q, R, B lie on ω in


that order. Let H be the projection of P onto AB and let AR and P H intersect at S. If ∠QP H = 30◦
and ∠HP R = 20◦ , find ∠ASQ in degrees.

SPACE FOR ROUGH WORK

6
19. Let N be the number of ways to place 4 bishops on a 5 × 5 chessboard such that no 3 are on
the same diagonal. Find the remainder when N is divided by 100. (Note: the length of a diagonal
on a 5 × 5 chessboard can be 2, 3, 4, or 5.)

20. A function S(m, n) satisfies the initial conditions S(1, n) = n, S(m, 1) = 1, and the recurrence
S(m, n) = S(m−1, n)S(m, n−1) for m ≥ 2, n ≥ 2. Find the largest integer k such that 2k divides S(7, 7).

21. Let r1 , r2 , . . . , r20 be the roots of the polynomial x20 − 7x3 + 1. If


1 1 1
+ 2 + ··· + 2
r12 + 1 r2 + 1 r20 + 1
m
can be written in the form n where m and n are positive coprime integers, find the largest prime
factor of m + n.

22. Let a, b, c, and d be positive real numbers which satisfy the system of equations

(a + b)(c + d) = 143,
(a + c)(b + d) = 150
(a + d)(b + c) = 169.
s
 
Let s be the smallest possible value of a2 + b2 + c2 + d2 . Find 10 .

SPACE FOR ROUGH WORK

7
23. Let ⌊x⌋ denote the greatest integer function and {x} = x − ⌊x⌋ denote
p the fractional
p part of
x. Let 1 ≤ x1 < . . . < x24 be the 24 smallest values of x ≥ 1 such that ⌊x⌋ ⌊x3 ⌋ + {x} {x3 } = x2 .
Find
12
X 1
.
x22k − x22k−1
k=1

24. In parallelogram ABCD, angles B and D are acute while angles A and C are obtuse. The
perpendicular from C to AB and the perpendicular from A to BC intersect√at a point P inside the
parallelogram. If P B = 700 while P D = 821, what is the integer nearest to AC ?

25. Let ABC be a triangle with incenter I and incircle ω. It is given that there exist points X
and Y on the circumference of ω such that ∠BXC = ∠BY C = 90◦ . Suppose further that X, I, and
Y are collinear. If AB = 80 and AC = 97, compute the length of BC.

26. Let {x} denote the fractional part of x. For example, {5.5} = 0.5. Find the smallest prime p
such that the inequality
p2  p 
X n
> 2016
n=1
p2

holds.

SPACE FOR ROUGH WORK

8
27. Compute the number of positive integers n ≤ 50 such that there exist distinct positive
integers a, b satisfying  
a b 1 1
+ =n + .
b a a b
28. Let ℓ1 and ℓ2 be two parallel lines, a distance of 15 apart. Points A and B lie on ℓ1 while
◦ ◦
points
√ C and D lie on ℓ2 such that ∠BAC = 30 and ∠ABD = 60 . The minimum value of AD + BC
is a b, where a and b are integers and b is square-free. Find a + b.

29. Suppose there are M permutations π of {1, 2, . . . , 9} such that there exists an integer N
such that N ≡ π(i) (modi) for all integers 1 ≤ i ≤ 9. Find the sum of square of digits of M .

30. Shen, Ling, and Ru each place four slips of paper with their name on it into a bucket. They
then play the following game: slips are removed one at a time, and whoever has all of their slips
removed first wins. Shen cheats, however, and adds an extra slip of paper into the bucket, and
will win when four of his are drawn. Given that the probability that Shen wins can be expressed
as simplified fraction m
n , find |m − n|.

SPACE FOR ROUGH WORK

9
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

9
MOMC IOQM Mock Donut 1
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. The least solution to the equation 8x3 − 6x = 3 can be expressed in the form cos (k ◦ ), where
90 < k < 180. Compute 180 − k.

2. In rectangle ABCD, point E lies on AB so that BE = 8 and DE = 20. Given that [ABCD] = 288
and [AED] = 96, compute AD + AE.
√ √ √
3. Given that x + y = 697, y + z = 672, and x + z = 680, find the integer nearest to
q
√ √ √
x−y+ y−z+ x−z

4. Mabel has a fair six-sided die with faces labeled 1, 2, 3, 4, m, n, where m and n are integers with
1 ≤ m < n ≤ 6. She rolls this die twice. Let (m, n) be the ordered pair for which the probability that the
sum of the two rolls equals 6 is maximized. Find m2 + n2 .

SPACE FOR ROUGH WORK

2
5. The polynomials P (x) and Q(x) have real coefficients. When P (x) is divided by (x + 1)(x + 10), the
quotient is Q(x) and the remainder is 2x. When P (x) is divided by (x + 4)(x + 7), the quotient is Q(x) and
the remainder is 38x + 18. Let the remainder when P (x) is divided by (x − 1) be N . Find |N |.

6. Let x, y, and z be positive integers such that x + y = 20 and x + yz = 24. Compute the number of
possible ordered triples (x, y, z).

7. Suppose that rectangle ARM L with AR < RM has diagonals that intersect at X. Rectangle AXIS
[AXIS] 23
is constructed so that X, R, and S are collinear, with R between X and S. Given that [ARM L] = 24 , let
AR 2
= ab where a, b are relatively prime positive integers. Find a + b.

RM

8. An increasing sequence of 3-digit positive integers satisfies the following properties:


• Each number is a multiple of 2, 3, or 5
• Adjacent numbers differ by only one digit and are relatively prime.
What is the maximum possible length of the sequence?

SPACE FOR ROUGH WORK

3
9. Let a, b, c be positive real numbers such that a+b+c = 10 and ab+bc+ca = 25. Let m = min{ab, bc, ca}.
Let M be the largest possible value of m. Find the integer nearest to 10M .

10. Let ABC be a triangle with orthocenter H; suppose that AB = 13, BC = 14, CA = 15. Let GA be
the centroid of triangle HBC, and define GB , GC similarly. Let the area of triangle GA GB GC be m
n where
gcd(m, n) = 1. Find m + n.

11. Let (a1 , a3 , a5 , a7 ) be a permutation of (1, 4, 9, 16), and let (a2 , a4 , a6 , a8 ) be a permutation of
(1, 8, 27, 64). Determine the last two digits of the greatest possible value of

|a1 − a2 | + |a2 − a3 | + |a3 − a4 | + |a4 − a5 | + |a5 − a6 | + |a6 − a7 | + |a7 − a8 | + |a8 − a1 | .

12. Marcelo and Marta play a game in which a fair coin is flipped repeatedly. The coin either lands
heads (H) or tails (T). They play until three consecutive flips appear in the order HTH or HHH. If HTH
appears first, then Marcelo wins; otherwise, Marta wins. Compute the number of distinct sequences of coin
flips that result in Marcelo winning on the tenth flip.

SPACE FOR ROUGH WORK

4
13. Let IOW ACT Y be a regular heptagon. The lines OI and T Y intersect at P . Let

[IW Y ]2
.
[IP Y ] · [IW CY ]
m
be written as n where gcd(m, n) = 1. Find m + n.

14. Eddy and Sarah are at an ARML coaches dinner together, and the menu has 7 different dishes. Let
the number of ways that Eddy and Sarah can order dinner so that each of them orders at least one dish, no
dish can be ordered twice, and no dish is ordered by both Eddy and Sarah be 100a + b where a, b < 100 are
positive integers. Find a + b.

15. Let the number of unordered triples of distinct points in the 4 × 4 × 4 lattice grid {0, 1, 2, 3}3 that
are collinear in R3 be N (i.e. there exists a line passing through the three points). Find the largest prime
factor of N .

16. Find the maximum possible value of H · M · M · T over all ordered triples (H, M, T ) of integers such
that H · M · M · T = H + M + M + T .

SPACE FOR ROUGH WORK

5
17. Find the smallest integer n ≥ 5 for which there exists a set of n distinct pairs (x1 , y1 ) , . . . , (xn , yn )
of positive integers with 1 ≤ xi , yi ≤ 4 for i = 1, 2, . . . , n, such that for any indices r, s ∈ {1, 2, . . . , n} (not
necessarily distinct), there exists an index t ∈ {1, 2, . . . , n} such that 4 divides xr + xs − xt and yr + ys − yt .

18. In triangle ABC, AB√= 2, AC = 1 + 5, and ∠CAB = 54◦ . Suppose D lies on the extension of AC
through C such that CD = 5−1. If M is the midpoint of BD, determine the measure of ∠ACM , in degrees.

19. The arithmetic mean of two positive integers x and y, each less than 100, is 4 more than their
geometric mean. Given x > y, compute the last two digits of the sum of all possible values for x + y. (Note

that the geometric mean of x and y is defined to be xy.)

20. ABCD is a cyclic quadrilateral with sides AB = 10, BC = 8, CD = 25, and DA = 12. A circle ω is
tangent to segments DA, AB, and BC. Find the radius of ω.

SPACE FOR ROUGH WORK

6
21. Triangle ABC has AB = 13, AC = 14, and BC = 15, and point P is selected randomly and uniformly
on AC. Let m be the probability that the distance between the circumcenters of triangles ABP and BCP
√n
is at least 5 2, where m and n are relatively prime positive integers. Find m + n.

22. Let a, b, and c be distinct complex numbers such that a + b + c ̸= 0. Compute the greatest possible
number of unordered pairs of different polynomials in the set
 2
ax + bx + c, ax2 + cx + b, bx2 + cx + a, bx2 + ax + c, cx2 + ax + b, cx2 + bx + a

that have at least one common root.

23. Compute the greatest integer k such that 2k divides


     2
X 2024 2034 2024 2034
− .
i j j i
0≤i<j≤2024

24. Let the number of ordered pairs (a, b) of integers with 1 ≤ a ≤ b ≤ 42 such that ab and ba have the
same remainder when divided by 7 be N . Find the largest prime factor of N .

SPACE FOR ROUGH WORK

7
25. Let S be the set of all positive integers n such that the numbers of divisors of 8n, 9n, and 10n form
an arithmetic sequence (in some order) √ and such that n is not a multiple of 3. Let the second least element
of S be M . Find the integer nearest to M .

26. Circle γ has center O and radius 9. Circle ωA has radius 2 and is internally tangent to γ at
point A. Circle ωB has radius 3 and is internally tangent to γ at point√B. The common external tangents of
ωA and ωB meet at T . Given that T O = 2·AB, let AB be written as a c b . Find the minimal value of a+b+c.

27. In the left figure below, the cell in the fourth row and third column of a 9 × 9 grid is deleted to
obtain a set S of 80 cells. For each n = 1, 2, 3, . . . , 8, an L-shaped tile Ln consisting of 2n + 1 cells is given,
as shown in the figure at right.

Let the number of ways to tile S using these eight L-shaped tiles, each exactly once, with rotations of
tiles allowed be 100m + n where m, n < 100 are positive integers. Find m + n.

SPACE FOR ROUGH WORK

8
28. Let the least positive integer satisfying the below two properties be N .
• There exists a positive integer a such that N = a(2a − 1).
• The sum 1 + 2 + · · · + (N − 1) is divisible by k for every integer 1 ≤ k ≤ 10.

Find the number of divisors of N .

29. Let S be the set of all 3-digit numbers with all digits in the set {1, 2, 3, 4, 5, 6, 7} (so in particular, all
three digits are nonzero). For how many elements abc of S is it true that at least one of the (not necessarily
distinct) ”digit cycles”
abc, bca, cab
is divisible by 7? (Here, abc denotes the number whose base 10 digits are a, b, and c in that order.)

30. Let S = {1, 2, 4, 8, 16, 32, 64, 128, 256}. A subset P of S is called squarely if it is nonempty and the
sum of its elements is a perfect square. A squarely set Q is called super squarely if it is not a proper subset
of any squarely set. Find the number of super squarely sets. (A set A is said to be a proper subset of a set
B if A is a subset of B and A ̸= B.)

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Cake 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!
• Answer keys and sources are on the last two pages.
• Mock Compiled by Agamjeet Singh

• The problems are credited to their respective sources.


• 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 and enjoy the CAKE!!!

1
1. There are 100 people in a room with ages 1, 2, . . . , 100. A pair of people is called cute if each
of them is at least seven years older than half the age of the other person in the pair. At most how
many pairwise disjoint cute pairs can be formed in this room?

2. The pairwise products ab, bc, cd, and da of positive integers a, b, c, and d are 64, 88, 120, and
165 in some order. Find a + b + c + d.

3. Given two distinct points A, B and line ℓ that is not perpendicular to AB, what is the maxi-
mum possible number of points P on ℓ such that ABP is an isosceles triangle?

4. In the Year 0 of Cambridge there is one squirrel and one rabbit. Both animals multiply in
numbers quickly. In particular, if there are m squirrels and n rabbits in Year k, then there will be
2m + 2019 squirrels and 4n − 2 rabbits in Year k + 1. What is the first year in which there will be
strictly more rabbits than squirrels?

5. Let x and y be positive real numbers. Define a = 1 + xy and b = 1 + xy . If a2 + b2 = 15, compute


a3 + b3 .

SPACE FOR ROUGH WORK

2
6. Call a positive integer n Indian if n does not divide (n − 2)!. Determine the number of Indian
numbers between 2 and 100 inclusive.

7. What is the smallest positive integer that cannot be written as the sum of two nonnegative
palindromic integers? (An integer is palindromic if the sequence of decimal digits are the same
when read backwards.)

8. A non-negative integer is called falling if its digits are strictly decreasing from left to right.
9876543210 is the largest falling number, 0 is the smallest. If all of the falling numbers were written
in a list from smallest to largest, let the 1000th number on that list be a1 a2 · · · a2n for some positive
integer n. Let S = a1 a2 + a3 a4 + · · · + a2n−1 a2n . Find the sum of square of digits of S.

9. For a positive integer n, let p(n) be the product of the digits of n and s(n) be the sum of the
digits of n. Compute the number of values of n less than 100 such that n = p(n) + s(n).

10. Points A, B, C, D are chosen in the plane such that segments AB, BC, CD, DA have lengths
2, 7, 5, 12 , respectively. Let m be the minimum possible value of the length of segment AC and let
M be the maximum possible value of the length of segment AC. Find M 2 − m2 .

SPACE FOR ROUGH WORK

3
11. A regular hexagon P ROF IT has area 1. Every minute, greedy George places the largest
possible equilateral triangle that does not overlap with other already-placed triangles in the
hexagon, with ties broken arbitrarily. How many triangles would George need to cover at least
90% of the hexagon’s area?

12. Let a1 , a2 , . . . be an arithmetic sequence and b1 , b2 , . . . be a geometric sequence. Suppose


that a1 b1 = 20, a2 b2 = 19, and a3 b3 = 14. Find the integer nearest to the greatest possible value of
a4 b4 .

13. Compute the number of ordered triples of integers (x, y, z) such that xy − |z| = 20 and
|x + y| − z = 15

14. Define a positive integer N to be lucky if there exists a positive integer a such that a7 has
exactly N positive divisors. Compute the number of positive integers less than 100 that are lucky.

15. A deck of 3 red cards, 3 white cards, and 3 blue cards is shuffled and dealt into three rows
of three cards. In how many ways can we place the cards such that no red cards are in the first
row, no white cards are in the second row and no blue cards are in the third row?

SPACE FOR ROUGH WORK

4
16. In rectangle ABCD, points E and F lie on sides AB and CD respectively such that both
AF and CE are perpendicular to diagonal BD. Given that BF and DE separate ABCD into three
polygons with equal area, and that EF = 1, find the integer nearest to BD4 .

17. How many noncongruent triangles are there with one side of length 20, one side of length
17, and one 60◦ angle?

18. In the quadrilateral M ARE inscribed in a unit circle ω, AM is a diameter of ω, and E lies
on the angle bisector of ∠RAM . Given

that triangles RAM and REM have the same area, let the
area of quadrilateral M ARE be a c b where a, b, c are positive integers such that b is square-free
and a, c are relatively prime. Find a + b + c.

19. Triangle N AP has side lengths N A = 10, AP = 17, and N P = 21. R and S are on N P such
that AR is the altitude to segment N P and AS is the angle bisector from A to N P . Let RS = m
n
where m, n are relatively prime positve integers. Find m + n.

20. Let ABC be a triangle where AB = 9, BC = 10, CA = 17. Let Ω be its circumcircle, and let
A1 , B1 , C1 be the diametrically opposite points from A, B, C, respectively, on Ω. Find the sum of
digits of the integer nearest to the area of the convex hexagon with the vertices A, B, C, A1 , B1 , C1 .

SPACE FOR ROUGH WORK

5
21. Define P = {S, T} and let P be the set of all proper subsets of P . (A proper subset is a
subset that is not the set itself.) How many ordered pairs (S, T ) of proper subsets of P are there
such that

(a) S is not a proper subset of T and T is not a proper subset of S; and


(b) for any sets S ∈ S and T ∈ T , S is not a proper subset of T and T is not a proper subset of S?

22. Bob is coloring lattice points in the coordinate plane. Find the number of ways Bob can
color five points in {(x, y) | 1 ≤ x, y ≤ 5} blue such that the distance between any two blue points
is not an integer.

23. Five people are at a party. Each pair of them are friends, enemies, or frenemies (which is
equivalent to being both friends and enemies). It is known that given any three people A, B, C:
• If A and B are friends and B and C are friends, then A and C are friends;
• If A and B are enemies and B and C are enemies, then A and C are friends;

• If A and B are friends and B and C are enemies, then A and C are enemies.
How many possible relationship configurations are there among the five people?

24. How many ways are there to partition the set {1, 2, . . . , 11} into two sets U and V with size
4 and 7 respectively such that the probability that a number chosen from U uniformly at random
is greater than a number chosen from V uniformly at random is exactly 21 ?

25. Triangle △ABC has AB = 21, BC = 55, and CA = 56. There are two points P in the plane
of △ABC for which ∠BAP = ∠CAP and ∠BP C = 90◦ . Find the integer nearest to the distance
between them.

SPACE FOR ROUGH WORK

6
26. A 5 by 5 grid of unit squares is partitioned into 5 pairwise incongruent rectangles with
sides lying on the gridlines. Find the sum of square of digits of the maximum possible value of
the product of their areas.

27. How many ways can one tile a 2 × 10 board with 1 × 1 and 2 × 2 tiles? Rotations and
reflections of the same configuration are considered distinct.

28. Compute the number of integers n ∈ {1, 2, . . . , 300} such that n is the product of two distinct
primes, and is also the length of the longest leg of some nondegenerate right triangle with integer
side lengths.

29. For positive reals p and q, define the remainder when p is divided by q as the smallest
nonnegative real r such that p−r q √is an integer. For an ordered pair (a, b) of positive integers, let r1
√ √ √
and r2 be the remainder when a 2 + b 3 is divided √ by 2 and 3 respectively. Find the number
of pairs (a, b) such that a, b ≤ 20 and r1 + r2 = 2.

30. Square ARM L has unit side lengths and center O.D and E are√on AR, with D between A
and E. If ∠DOE = 45◦ and DE = 37 , let the largest value of ER be a+c b where a, b, c are positive
integers such that a + b + c is minimal. Find a + b + c.

SPACE FOR ROUGH WORK

7
MOMC IOQM Mock Cake 1
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!
• Answer keys and sources are on the last two pages.
• Mock Compiled by Agamjeet Singh

• The problems are credited to their respective sources.


• 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 and enjoy the CAKE!!

1
1. Consider the system of equations
jxk jy k
20 + = 103
2k
jx l y2 m
21 + = 109
2 2
where x and y are positive integers. Compute the least possible value of x + y.

2. Starting at (0, 0), a frog moves in the coordinate plane via a sequence of hops. Each hop
is either 1 unit in the x-direction or 1 unit in the y-direction. Compute the minimum number of
hops needed for the frog to land on the line 15x + 35y = 2020.

3. Compute the number of positive integers b ≥ 5 for which the base-ten number 2020 ends in
the digit 4 when it is expressed in base b.

4. A microwave accepts three digits a, b, and c, not all zero, as input. The microwave will then
run for 60a + 10b + c seconds. Find the sum of digits of the number of positive integers k such that
the microwave can run for exactly k seconds.

5. Let T RIAN GLE be an equilateral octagon with side length 10, and let α be the acute angle
whose tangent is 43 . Given that the measures of the interior angles of T RIAN GLE alternate be-
tween 180◦ − α and 90◦ + α, let the area of T RIAN GLE be A. Find the integer nearest to A/10.

6. Suppose that △ABC is a right triangle with hypotenuse 20 and legs of length at least 10.
Compute the number of possible integer values for [ABC].

7. Compute the sum of square of digits of the greatest integer that is the least common mul-
tiple of two distinct sets of four nonzero digits.

8. Compute the number of elements n of the set {1, 2, 3, . . . , 100} for which the product (n2 −
n + 3)(n2 + n + 3) is a multiple of 5.

9. Arnav draws an n-gon and notices that the degree measure of each interior angle is an
integer multiple of 54◦ and that not all interior angles have the same measure. Compute the least
possible value of n.
P10 2 p
10. The sum n=3 n(n2 −1) is equal to q where p, q are relatively prime positive integers. Find
q − p.

SPACE FOR ROUGH WORK

2
11. A circle passes through both trisection points of side AB of square ABCD and intersects
BC at points P and Q. Let the greatest possible value of tan ∠P AQ be ab where a, b are relatively
prime positive integers. Find a + b.

12. Let N be the least integer n > 2020 such that (n + 2020)n−2020 divides nn . Find N − 2020.

13. In △ABC, AB = 6, BC = 7, and CA = 8. The circle that passes through each of the vertices
of △ABC is centered at point O. The circle that passes through each of the vertices of △AOB
intersects BC at point D, different from B. Let BD = m
n where m, n are relatively prime positive
integers. Find m + n.

14. A set U has n elements. Let f (n) denote the sum of |S| over all subsets S ⊆ U. (Note: For
a finite set A, the notation |A| represents the number of elements of A.) Find the least positive
integer n such that f (n) > 2023.

15. In hexagon SQU ARE, all sides have length 10, ∠Q and ∠R are right angles, and ∠S ∼ = ∠U√∼
=
∠A ∼
= ∠E. Given that the area of SQU ARE in simplest form is uniquely expressible as p + q r,
where p and q are integers and r is a prime, find the sum of digits of p + q + r.

SPACE FOR ROUGH WORK

3
16. Let 100a + b be the remainder when 1112021 is divided by 10000, where a, b < 100 are positive
integers. Find a + b.

17. A base-b palindrome is a base-b integer whose digits read the same forwards and back-
wards and whose leftmost digit is nonzero. Let the greatest base-10 palindrome less than 500 that
is also a palindrome when converted to base-2 be mnp. Find m2 + n + p2 .

18. A circle of integer radius r has a chord P Q of length 8. There is a point X on chord P Q
such that P X = 2 and XQ = 6. Call a chord AB computational if it contains X and both AX and
XB are integers. What is the minimal possible integer r such that there exist 6 computational
chords for X ?

19. On planet MOMC, two individuals may play a game where they write the number 324000
on a whiteboard and take turns dividing the number by prime powers - numbers of the form pk
for some prime p and positive integer k. Divisions are only legal if the resulting number is an
integer. The last player to make a move wins. Determine what number the first player should
select to divide 324000 by in order to ensure a win.

20. Kartik has 50 coins that total to a value of 82 cents. Tanmay randomly steals one coin and
finds out that he took a quarter. As to not enrage Kartik, he quickly puts the coin back into the
collection. However, he is both bored and curious and decide to randomly take another coin. Let
the probability that this next coin is a penny be p. Find the integer nearest to 100p. (Every coin
is either a penny, nickel, dime or quarter).

SPACE FOR ROUGH WORK

4
21. The latus rectum of a parabola is the line segment parallel to the directrix, with endpoints
on the parabola, that passes through the focus. Define the latus nextum of a parabola to be the
line segment parallel to the directrix, with endpoints on the parabola, that is twice as long as the
latus rectum. Let the greatest possible distance between a point on the latus √rectum and a point
on the latus nextum of the parabola whose equation is y = x2 + 20x + 20 be mp n where m, n, p are
positive integers such that m + n + p is minimal. Find m + n + p.

22. Let ABCDE be a convex pentagon inscribed in a circle. The arcs AB, BC, CD, DE, and EA
have measures 32◦ , 64◦ , 84◦ , 84◦ , and 96◦ , respectively. Lines BC and AD meet at point X, lines AB
and DE meet at point Y , and point M is the midpoint of DY . The degree measure of the acute
angle formed by the intersection of lines XM and AB is T ◦ . Compute T .

23. Circle Ω1 with radius 11 and circle Ω2 with radius 5 are externally tangent. Circle Γ is
internally tangent to both Ω1 and Ω2 , and the centers of all three circles are collinear. Line ℓ is
tangent to Ω1 and Ω2 at distinct points D and E, respectively. Point F lies on Γ so that F D < F E
and m∠DF E = 90◦ . Find the integer nearest to 100 sin ∠DEF .

SPACE FOR ROUGH WORK

5
24. A finite set of distinct, nonnegative integers {a1 , . . . , ak } is called admissible if the integer
function f (n) = (n + a1 ) · · · (n + ak ) has no common divisor over all terms; that is, gcd(f (1), f (2), . . . , f (n)) =
1 for any integer n. How many admissible sets only have members of value less than 10? {4} and
{0, 2, 6} are such sets, but {4, 9} and {1, 3, 5} are not.

25. For a positive integer n, let s(n) denote the sum of the digits of n. Compute the sum of
digits of the sum of all positive integers n for which n = 37s(n).

26. Compute the number of ordered pairs (a, b) of integers such that |a| ≤ 2020, |b| ≤ 2020, and
r  a 3 b
3 a + b
= + .
2 2 2

SPACE FOR ROUGH WORK

6
27. Let a1 , a2 , a3 , a4 , . . . be the increasing sequence 4, 5, 44, 45, . . . that consists of all positive
integers each of whose digits is either 4 or 5. Find the remainder when a100 is divided by 97.

28. Find the sum of digits of the number of subsets S of {1, 2, . . . , 15} such that S has at least
two elements and no two elements of S are relatively prime.

29. Let D1 and D2 be standard, fair, six-sided dice. Let D3 be a fair six-sided die with the
numbers 1, 2, 2, 3, 3, 4 on its faces. Let D4 be a fair six-sided die such that for all integers k between
2 and 12 inclusive, the probability that the sum of a roll of D3 and D4 equals k is equal to the
probability that the sum of a roll of D1 and D2 equals k. Two of the four dice are chosen at ran-
dom. The two dice are rolled independently of one another. Let the probability that the positive
difference of the numbers rolled is 2 be m n where m, n are relatively prime positive integers. Find
|m − n|.

30. Compute the sum of square of digits of the least positive integer n such that each of 20n
and 21n has exactly 60 positive divisors.

SPACE FOR ROUGH WORK

7
MOMC IOQM Mock Blueberry 4
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!
• Answer keys and sources are on the last two pages.
• Mock Compiled by Agamjeet Singh

• The problems are credited to their respective sources.


• 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. Find the number of ways to color a 2 × 2 grid of squares with 4 colors such that no two
(nondiagonally) adjacent squares have the same color. Each square should be colored entirely
with one color. Colorings that are rotations or reflections of each other should be considered
different.

2. Niharika is bored in class, so she thinks of a positive integer. Every second after that, she
subtracts from her current number its smallest prime divisor, possibly itself. After 2022 seconds,
she realizes that her number is prime. Let the sum of all possible values of her initial number be
S. Find the sum of digits of S.

3. Niharika is once again very bored in class. On a whim, she chooses three primes p, q, r
independently and uniformly at random from the set of primes of at most 30. She then calculates
an integer be m
the roots of px2 + qx + r. Let the probability that at least one of her roots is √ n where
m, n are relatively prime positive integers. Find the integer nearest to m + n.

4. Let ABCD be a parallelogram. Let E be the midpoint of AB and F be the midpoint of CD.
Points P and Q are on segments EF and CF , respectively, such that A, P , and Q are collinear.
Given that EP = 5, P F = 3, and QF = 12, find CQ.

5. If
219 x + 220
f (x) = ,
x2 + 220 x + 220
find the largest positive integer less than f (1) + f (2) + f (4) + f (8) + · · · + f (220 ).

SPACE FOR ROUGH WORK

2
6. Vikram and Betal are playing in an eight-player single-elimination rock-paper-scissors tour-
nament. In the first round, all players are paired up randomly to play a match. Each round after
that, the winners of the previous round are paired up randomly. After three rounds, the last
remaining player is considered the champion. Ties are broken with a coin flip. Given that Vikram
always plays rock, Betal always plays paper, and everyone else always plays scissors, let the prob-
ability that Vikram is crowned champion be pq where p, q are relatively prime positive integers.
Find p + q. Note that rock beats scissors, scissors beats paper, and paper beats rock.

7. What is the integer nearest to 10 times the smallest r such that three disks of radius r can
completely cover up a unit disk?

8. Let n be the answer to this problem. In acute triangle ABC, point D is located on side BC
so that ∠BAD = ∠DAC and point E is located on AC so that BE ⊥ AC. Segments BE and AD
intersect at X such that ∠BXD = n◦ . Given that ∠XBA = 16◦ , find the measure of ∠BCA.

9. Right triangle ABC has AB = 5, BC = 12, and CA = 13. Point D lies on the angle bisector of
∠BAC such that CD is parallel to AB. Find the integer nearest to BD.

10. How many integers n greater than 2 are there such that the degree measure of each interior
angle of a regular n-gon is an even integer?

SPACE FOR ROUGH WORK

3
11. Malay and Ravi stand atop two different towers in the Arctic. Both towers are a positive
integer number of meters tall and are a positive (not necessarily integer) distance away from each
other. One night, the sea between them has frozen completely into reflective ice. Malay shines his
flashlight directly at the top of Ravi’s tower, and Ravi shines his flashlight at the top of Malay’s
tower by first reflecting it off the ice. The light from Malay’s tower travels 16 meters to get to Ravi’s
tower, while the light from Ravi’s tower travels 26 meters to get to Malay’s tower. Assuming that
the lights are both shone from exactly the top of their respective towers, what is the sum of all
the possibilities for the height of Malay’s tower?

12. You start with a single piece of chalk of length 1. Every second, you choose a piece of
chalk that you have uniformly at random and break it in half. You continue this until you have
8 pieces of chalk. Let the probability that they all have length 81 be m
n where m, n are relatively
prime positive integers. Find m + n.

13. In triangle ABC, ∠ABC = 3∠ACB. If AB = 4 and AC = 5, find the integer nearest to 10BC.

SPACE FOR ROUGH WORK

4
14. Let f (x) = x3 + 3x − 1 have roots a, b, c. Given that
1 1 1
+ 3 + 3
a3 + b3 b + c3 c + a3
m
can be written as n, where m, n are positive integers and gcd(m, n) = 1, find |m − n|.

15. Aarav the ant sits on the circumference of the circular base
√ of a party hat (a cone without
a circular base for the ant to walk on) of radius 2 and height 5. If the ant wants to reach a
point diametrically opposite of its current location on the hat, what is the square of the minimum
possible distance the ant needs to travel?

16. Let
a = 19191919
| {z. . . 1919} .
19 is repeated 3838 times

What is the remainder when a is divided by 13 ?

SPACE FOR ROUGH WORK

5
17. Aadi draws a quadrilateral with side lengths 7, 15, 20, and 24 in some order such that the
quadrilateral has two opposite right angles. Let the area of the quadrilateral be A. Find the inte-
ger nearest to A/10.

18. Let {ai } for 1 ≤ i ≤ 10 be a finite sequence of 10 integers such that for all odd i, ai = 1
or −1 , and for all even i, ai = 1, −1, or 0. Suppose there are 100m + n sequences {ai } such that
a1 + a2 + a3 + · · · + a10 = 0, where m, n < 100 are positive integers. Find m + n.

19. Positive integers a ≤ b ≤ c have the property that each of a + b, b + c, and c + a are prime.
If a + b + c has exactly 4 positive divisors, let P be the third smallest possible value of the product
c(c + b)(c + b + a). Find the sum of digits of P.

20. S is a collection of integers n with 1 ≤ n ≤ 50 so that each integer in S is composite and


relatively prime to every other integer in S. What is the largest possible number of integers in S ?

SPACE FOR ROUGH WORK

6
21. A regular octagon is inscribed in a circle of radius 2. Motu and Patlu play a game in which
they take turns claiming vertices of the octagon, with Motu going first. A player wins as soon as
they have selected three points that form a right angle. If all points are selected without either
player winning, the game ends in a draw. Given that both players play optimally, let the sum√of
all possible areas of the convex polygon formed by Motu’s points at the end of the game be a + b
where a, b are positive integers. Find a + b.

22. Agamjeet is camping by himself in the forest. He has six wooden sticks of length 1, 2, 3, 4, 5, 6
inches. Somehow, he has managed to arrange these sticks, such that they form the sides of an
equiangular hexagon. Find the integer nearest to the sum of all possible values of the area of this
hexagon.

23. Imran and Krishiv play the following ”point guessing game”. First, Imran marks an equi-
lateral triangle ABC and a point D on segment BC satisfying BD = 3 and CD = 5. Then, Imran
chooses a point P on line AD and challenges Krishiv to mark a point Q ̸= P on line AD such that
BQ BP
QC = P C . Imran wins if and only if Krishiv is unable to choose such a point. If Imran wins, let S
be the sum of all the possible values of BP
P C for the P he choses. Find the largest integer less than
10S.

SPACE FOR ROUGH WORK

7
24. Consider parallelogram ABCD with AB > BC. Point E on AB and point F on CD are
marked such that there exists a circle ω1 passing through A, D, E, F and a circle ω2 passing
through B, C, E, F . If ω1 , ω2 partition BD into segments BX, XY , Y D in that order, with lengths
200, 9, 80, respectively, compute BC.

25. The taxicab distance between points (x1 , y1 ) and (x2 , y2 ) is |x2 − x1 | + |y2 − y1 |. A regular
octagon is positioned in the xy plane so that one of its sides has endpoints (0, 0) and (1, 0). Let S be
the set of all points inside the octagon whose taxicab distance from some octagon vertex is at most
2 m
3 . The area of S can be written as n , where m, n are positive integers and gcd(m, n) = 1. Find m+n.

26. A triple of positive integers (a, b, c) is tasty if lcm(a, b, c) | a + b + c − 1 and a < b < c. Find the
sum of a + b + c across all tasty triples.

SPACE FOR ROUGH WORK

8
27. Debayu thinks of four positive integers a ≤ b ≤ c ≤ d satisfying {ab + cd, ac + bd, ad + bc} =
{40, 70, 100}. Find the largest possible value of abc + d.

28. Compute the number of ordered pairs of positive integers (a, b) satisfying the equation

gcd(a, b) · a + b2 = 10000.

29. How many ways are there to place 31 knights in the cells of an 8 × 8 unit grid so that no
two attack one another?
√ (A knight attacks another knight if the distance between the centers of
their cells is exactly 5.)

30. Find the largest prime factor of the number of 10-digit numbers a1 a2 · · · a10 which are
multiples of 11 such that the digits are non-increasing from left to right, i.e. ai ≥ ai+1 for each
1 ≤ i ≤ 9.

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Blueberry 3
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!
• Answer keys and sources are on the last two pages.
• Mock Compiled by Agamjeet Singh

• The problems are credited to their respective sources.


• 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. Given that there exists a unique 3 digit number N = ABC, whose digits (A, B, C) are all
nonzero, with the property that the product P = ABC × AB × A is divisible by 1000, find BC.

2. How many multiples of 12 divide 12! and have exactly 12 divisors?

3. Triangle ABC has a right angle at A, AB = 20, and AC = 21. Circles ωA , ωB , and ωC are
centered at A, B, and C respectively and pass through the midpoint M of BC. ωA and ωB intersect
at X ̸= M , and ωA and ωC intersect at Y ̸= M . Find XY .

4. The incircle of △ABC is tangent to sides BC, AC, and AB at D, E, and F , respectively.
Point G is the intersection of lines AC and DF as shown. The sides of △ABC have lengths
AB = 73, BC = 123, and AC = 120. Find the length EG.

5. We have a 9 by 9 chessboard with 9 kings (which can move to any of 8 adjacent squares) in
the bottom row. What is the minimum number of moves, if two pieces cannot occupy the same
square at the same time, to move all the kings into an X shape (a 5 × 5 region where there are 5
kings along each diagonal of the X, as shown below)?

SPACE FOR ROUGH WORK

2
6. Dilhan has objects of 3 types, A, B, and C, and 6 functions

fA,B , fA,C , fB,A , fB,C , fC,A , fC,B

where fX,Y takes in an object of type X and outputs an object of type Y . Dilhan wants to com-
pose his 6 functions, without repeats, such that the resulting expression is well-typed, meaning
an object can be taken in by the first function, and the resulting output can then be taken in by
the second function, and so on. In how many orders can he compose his 6 functions, satisfying
this constraint?

7. Given a trapezoid with bases AB and CD, there exists a point E on CD such that drawing
the segments AE and BE partitions the trapezoid into 3 similar isosceles triangles, each with
long side twice the short side. What is the integer nearest to the sum of all possible values of CD
AB ?

8. Consider all ordered pairs (m, n) of positive integers satisfying 59m − 68n = mn. Find the
largest prime factor of the sum of all the possible values of n in these ordered pairs.

9. Pam lists the four smallest positive prime numbers in increasing order. When she divides
the positive integer N by the first prime, the remainder is 1. When she divides N by the second
prime, the remainder is 2. When she divides N by the third prime, the remainder is 3. When she
divides N by the fourth prime, the remainder is 4. Find the least possible value for N .

10. The side lengths of a scalene triangle are roots of the polynomial

x3 − 20x2 + 131x − 281.3.

Find the integer nearest to the area of the triangle.

SPACE FOR ROUGH WORK

3
11. What is the largest prime factor of the 101st smallest integer which can represented in the
form 3a + 3b + 3c , where a, b, and c are integers?
 
12. Let a and b be complex numbers such that (a + 1)(b + 1) = 2 and a2 + 1 b2 + 1 = 32. Let
  √
the sum of all possible values of a4 + 1 b4 + 1 be S. Find the integer nearest to S.

13. Points A, B, and C lie on a line, in that order, with AB = 8 and BC = 2.B is rotated 20◦
counterclockwise about A to a point B ′ , tracing out an arc R1 . C is then rotated 20◦ clockwise
about A to a point C ′ , tracing out an arc R2 . Let the area of the region bounded by arc R1 , segment
B ′ C, arc R2 , and segment C ′ B be A. Find the integer nearest to 10A.

14. Consider trapezoid [ABCD] which has AB∥CD with AB = 5 and CD = 9. Moreover,
∠C = 15◦ and ∠D = 75◦ . Let M1 be the midpoint of AB and M2 be the midpoint of CD. What is
the distance M1 M2 ?

15. Let p1 , p2 , p3 , p4 , p5 , p6 be distinct primes greater than 5. Find the minimum possible value
of
p1 + p2 + p3 + p4 + p5 + p6 − 6 min (p1 , p2 , p3 , p4 , p5 , p6 )

SPACE FOR ROUGH WORK

4
16. Suppose there are 160 pigeons and n holes. The 1 st pigeon flies to the 1st hole, the 2nd
pigeon flies to the 4th hole, and so on, such that the i th pigeon flies to the i2 mod n th hole,
where k mod n is the remainder when k is divided by n. What is the sum of square of digits of the
minimum n such that there is at most one pigeon per hole?

17. Adam has a box with 15 pool balls in it, numbered from 1 to 15, and picks out 5 of them.
He then sorts them in increasing order, takes the four differences between each pair of adjacent
balls, and finds exactly two of these differences are equal to 1. Suppose there are N selections of
5 balls that he could have drawn from the box. Find the sum of digits of N .

18. Bill Gates and Jeff Bezos are playing a game. Each turn, a coin is flipped, and if Bill and
Jeff have m, n > 0 dollars, respectively, the winner of the coin toss will take min(m, n) from the
loser. Given that Bill starts with 20 dollars and Jeff starts with 21 dollars, let the probability that
Bill ends up with all of the money be ab where a, b are relatively prime positive integers. Find a + b.

19. Let ABC be a triangle with circumcenter O. Additionally, ∠BAC = 20◦ and ∠BCA = 70◦ .
Let D, E be points on side AC such that BO bisects ∠ABD and BE bisects ∠CBD. If P and Q are
points on line BC such that DP and EQ are perpendicular to AC, what is ∠P AQ?

20. Let

X 7i m
=
i=0
(7i + 1) (7i + 7) n

where m, n are relatively prime positive integers. Find m + n.

SPACE FOR ROUGH WORK

5
21. For each positive integer n, let σ(n) denote the sum of the positive integer divisors of n.
Suppose there exist M positive integers n ≤ 2021 that satisfy

σ(3n) ≥ σ(n) + σ(2n)

Find the remainder when M is divided by 100.


2
22. Let f (x) = x8 . Starting at the point (7, 3), let the length of the shortest path that touches

the graph of f , and then the x-axis be a b − c where a, b, c are positive integers such that b is
square-free. Find a + b + c.

23. Let the remainder when


149151 + 151149
 

22499
is divided by 104 be 100p + q where p, q < 100 are positive integers. Find p + q.
√ √
24. A 2 5 by 4 5 rectangle is rotated by an angle θ about one of its diagonals. If the total
volume swept out by the rotating rectangle is 62π, find the sum of square of digits of the measure
of θ in degrees.

25. Find the last two digits of the number of permutations of the string 0123456 that are there
such that no contiguous substrings of lengths 1 < ℓ < 7 have a sum of digits divisible by 7?

SPACE FOR ROUGH WORK

6
26. As a gift, Dilhan was given the number n = 11 · 22 · · · 20212021 , and each day, he has been
dividing n by 2021! exactly once. One day, when he did this, he discovered that, for the first time,
n was no longer an integer, but instead a reduced fraction of the form ab . What are the last two
digits of the sum of all distinct prime factors of b?

27. In convex quadrilateral ABCD, ∠ADC = 90◦ + ∠BAC. Given that AB = BC = 17, and
CD = 16, what are the last two digits of the largest integer less than the maximum possible area
of the quadrilateral?

28. Let P (x), Q(x), and R(x) be three monic quadratic polynomials with only real roots, satis-
fying
P (Q(x)) = (x − 1)(x − 3)(x − 5)(x − 7)
Q(R(x)) = (x − 2)(x − 4)(x − 6)(x − 8)
for all real numbers x. What is P (0) + Q(0) − R(0)?

29. Let Γ1 , Γ2 , Γ3 be three circles with radii 3, 4, 9, respectively, such that Γ1 and Γ2 are exter-
nally tangent at C, and Γ3 is internally tangent to Γ1 and Γ2 at A and B, respectively. Suppose
the tangents to Γ3 at√A and B intersect at X. The line through X and C intersect Γ3 at two points,
P and Q. Let P Q = a c b where a, b, c are positive integers such that a+b+c is minimal. Find a+b+c.

30. Find the sum of digits of the number of functions f : {1, 2, 3, . . . , 7} → {1, 2, 3, . . . , 7} that are
there such that the set F = {f (i) : i ∈ {1, . . . , 7}} has cardinality four, while the set G = {f (f (f (i))) :
i ∈ {1, . . . , 7}} consists of a single element.

SPACE FOR ROUGH WORK

7
MOMC IOQM Mock Blueberry 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!
• Answer keys and sources are on the last two pages.
• Mock Compiled by Agamjeet Singh

• The problems are credited to their respective sources.


• 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. Suppose a, b, and c are relatively prime integers such that

a b
=2 and = 3.
b+c a+c
What is the value of |c|?

2. Let ABC be a triangle. Point P lies in the interior of ABC such that ∠ABP = 20◦ and
∠ACP = 15◦ . Compute ∠BP C − ∠BAC.

3. A total of 30 students go on a road trip. They take two cars, each of which seats 15 people.
Call two students friendly if they sat together in the same car going to the trip and in the same
car going back home. What is the smallest possible number of friendly pairs of students on the
trip?

4. Compute the number of ways to rearrange nine white cubes and eighteen black cubes into
a 3 × 3 × 3 cube such that each 1 × 1 × 3 row or column contains exactly one white cube. Note that
rotations are considered distinct.

5. Let ABC be a triangle with side lengths 5, 4 2, and 7. Let the area of the triangle with side
lengths sin A, sin B, and sin C be m
n where m, n are relatively prime positive integers. Find m + n.

6. Michelle is at the bottom-left corner of a 6 × 6 lattice grid, at (0, 0). The grid also contains a
pair of onetime-use teleportation devices located at (2, 2) and (3, 3); the first time Michelle moves
to one of these points she is instantly teleported to the other point, and the devices disappear. If
she can only move up or to the right in unit increments, find the last two digits of the number of
ways in which can she reach the point (5, 5).

7. Fifteen integers a1 , a2 , a3 , . . . , a15 are arranged in order on a number line. The integers are
equally spaced and have the property that

1 ≤ a1 ≤ 10, 13 ≤ a2 ≤ 20, 241 ≤ a15 ≤ 250.

What is the sum of digits of a14 ?

8. Let ABCD be a unit square, and suppose that E and F are on AD and AB such that
AE = AF = 23 . Let CE and DF intersect at G. If the area of △CF G can be expressed as simplified
fraction pq , find p + q.

SPACE FOR ROUGH WORK

2
9. Jan rolls a fair six-sided die and calls the result r. Then, he picks real numbers a and b
between 0 and 1 uniformly at random and independently. If the probability that the polynomial
2 √
f (x) = xr − x a + b has a real root can be expressed as simplified fraction pq , find |q − 2p|.

10. How many ordered triples (a, b, c) of integers satisfy the inequality

a2 + b2 + c2 ≤ a + b + c + 2?

11. Let a > 1 be a positive integer. The sequence of natural numbers {an } is defined as follows:
a1 = a and for all n ≥ 1, an+1 is the largest prime factor of a2n − 1. Determine the smallest possible
value of a such that the numbers a1 , a2 , . . . , a7 are all distinct.

12. Let ABCD be a square of side length 1, and let P be a variable point on CD. Denote by
Q the intersection point of the angle bisector of ∠AP B with AB. The set of possible
√ locations for
Q as P varies along CD is a line segment. If the length of this segment is a − b where a, b are
positive integers then find a + b.

13. Suppose that a and b are non-negative integers satisfying a + b + ab + ab = 42. Find the
largest prime divisor of the sum of all possible values of a + b.

14. 2018 little ducklings numbered 1 through 2018 are standing in a line, with each holding
a slip of paper with a nonnegative number on it; it is given that ducklings 1 and 2018 have the
number zero. At some point, ducklings 2 through 2017 change their number to equal the average of
the numbers of the ducklings to their left and right. Suppose the new numbers on the ducklings
sum to 1000. What is the number of positive integer factors of the maximum possible sum of the
original numbers on all 2018 slips?

SPACE FOR ROUGH WORK

3
15. Find the sum of all integers n for which (n − 1) · 2n + 1 is a perfect square.

16. Suppose a, b, and c are nonzero real numbers such that


1 2 7 1
bc + = ca + = ab + = .
a b c a+b+c
m
If (a + b + c)3 = n where m, n are relatively prime integers. Find m + n.

17. Let ABC be a triangle with BC = 30, AC = 50, and AB = 60. Circle ωB is the circle passing
through A and B tangent to BC at B; ωC is defined similarly. Suppose the tangent to ⊙(ABC) at
A intersects ωB and ωC for the second time at X and Y respectively. Compute XY .

18. For some positive integer k, a circle is drawn tangent to the coordinate axes such that the
lines x + y = k 2 , x + y = (k + 1)2 , . . . , x + y = (k + 61)2 all pass through it. What is the minimum
possible value of k ?

19. Let CM U be a triangle with CM = 13, M U = 14, and U C = 15. Rectangle W EAN is in-
scribed in △CM U with points W and E on M U , point A on CU , and point N on CM . If the area
of W EAN is 32, what is the largest integer less than the largest possible value for its perimeter?

20. Let △ABC be a triangle with AB = 3 and AC = 5. Select points D, E, and F on BC in that
order such that AD ⊥ BC, ∠BAE = ∠CAE, and BF = CF . If E is the midpoint of segment DF ,
what is BC 2 ?

SPACE FOR ROUGH WORK

4
21. It is given that there exists a unique triple of positive primes (p, q, r) such that p < q < r
and
p3 + q 3 + r 3
= 249.
p+q+r
Find r.

22. It is given that there exist unique integers m1 , . . . , m100 such that
     
m1 m2 m100
0 ≤ m1 < m2 < · · · < m100 and 2018 = + + ··· +
1 2 100

If m1 + m2 + · · · + m100 = 100a + b where a, b < 100 are positive integers, find a + b.

23. Suppose AB is a segment of unit length in the plane. Let f (X) and g(X) be functions of
the plane such that f corresponds to rotation about A 60◦ counterclockwise and g corresponds
to rotation about B 90◦ clockwise.√Let P be a point with g(f (P )) = P . Let the sum of all possible
distances from P to line AB be a+c b where a, b, c are positive integers. Find a + b + c.

24. Let p, q, and r be the roots of the polynomial f (t) = t3 − 2022t2 + 2022t − 337. Given
 
2022 − q 2022 − r
x = (q − 1) +
r−1 p−1
 
2022 − r 2022 − p
y = (r − 1) +
p−1 q−1
 
2022 − p 2022 − q
z = (p − 1) +
q−1 r−1
Find the remainder when |xyz − qrx − rpy − pqz| is divided by 100.

25. Let ABC be a triangle with circumradius 17, inradius 4, circumcircle Γ and A-excircle Ω.
Suppose the reflection of Ω over line BC is internally tangent to Γ. Compute the last two digits of
the area of △ABC.

SPACE FOR ROUGH WORK

5
26. Let ABC be a triangle with AB = 10, AC = 11, and circumradius 6. Points D and E are
located on the circumcircle of △ABC such that △ADE is equilateral. Line segments DE and BC
intersect at X. Let BX a
XC = b where a, b are relatively prime positive integers. Find a + b.

27. Nine distinct light bulbs are placed in a circle. Each light bulb can be on or off. In or-
der to properly light up the room, in each group of four adjacent light bulbs, at least one must
be turned on. Find the sum of square of digits of the total number of configurations that are there.

28. Define an integer n ≥ 0 to be two-far if there exist integers a and b such that a, b, and
n + a + b are all powers of two. If N is the number of two-far integers less than 2048, find the
remainder when N is divided by 100.

29. Richard rolls a fair six-sided die repeatedly until he rolls his twentieth prime number or
b
his second even number. Let the probability that his last roll is prime be a·2 5c where a, b, c are
positive integers such that 2, 5 ∤ a. Find the last two digits of a + b + c.

30. We call an . . . a2 the Fibonacci representation of a positive integer k if


n
X
k= ai Fi ,
i=2

where ai ∈ {0, 1} for all i, an = 1, and Fi denotes the ith Fibonacci number (F0 = 0, F1 = 1 , and Fi =
Fi−1 + Fi−2 for all i ≥ 2 ). This representation is said to be minimal if it has fewer 1 s than any
other Fibonacci representation of k. Find the sum of digits of the smallest positive integer that
has eight ones in its minimal Fibonacci representation.

SPACE FOR ROUGH WORK

6
MOMC IOQM Mock Blueberry 1
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!
• Answer keys and sources are on the last two pages.
• Mock Compiled by Agamjeet Singh

• The problems are credited to their respective sources.


• 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. Let n be a two-digit integer, and let m be the result when we reverse the digits of n. If n − m
and n + m are both perfect squares, find n.

2. Compute the number of ordered triples (p, q, r) of primes, each at most 30, such that

p + q + r = p2 + 4

3. Let 0◦ < θ < 90◦ be an angle. If

logsin θ cos θ, logcos θ tan θ, logtan θ sin θ



a−b
form a geometric progression in that order, let sin θ = c where a, b, c are relatively prime positive
integers. Find a + b + c.

4. Inside a bag containing geometric shapes, there are twice as many equilateral triangles
with side l as squares with side 3. If the sum of the areas of all the squares is equal to the sum
of the areas of all the equilateral triangles, find the integer nearest to l.

5. Let △ABC be an equilateral triangle, and let D be a point √


such that B is the midpoint of
AD. If CD = 12, the area of △ABC can be expressed in the form a b for some integers a, b, where
b is not divisible by the square of any prime. Find a + b.

6. There exists unique digits a ̸= 0 and b ̸= a such that the fourdigit number aabb is a perfect
square. Compute a + b.

7. How many ordered pairs (x, y) of integers satisfy

x4 + y 4 + 2x2 y 2 + 1023 = 1024x2 + 1024y 2 ?

8. Let p, q, and r be distinct prime numbers such that p2 + 1, q 2 + 2, and r2 + 3, form an arith-
metic sequence in that order. What is the minimum possible value of p + q + r ?

9. Arrange the numbers 0, 1, 2, . . . , 23 in a circle. Let the expected number of (unordered) pairs
of adjacent numbers that sum to 23 be m n where m, n are relatively prime positive integers. Find
m + n.

10. Three triplets, Tam, Tom, and Tim, work together to build a treehouse. Tam works twice
as fast as Tom, but three times slower than Tim. After working together for 10 days, Tim decides
to quit since he is tired. After another 10 days, Tom also decides to quit. It takes Tam another
6 days to complete the treehouse. The number of days it would had taken them to complete the
treehouse if none of them had quit can be written as m n for relatively prime positive integers m
and n. What is m + n ?

SPACE FOR ROUGH WORK

2
11. Let ABCD be a parallelogram with area 2020 such that AB/BC = 66/65. The bisectors of
∠DAB, ∠ABC, ∠BCD, ∠CDA form a quadrilateral. Let the area of this quadrilateral be mn where
m, n are relatively prime positive integers. Find the integer nearest to (m + n)/10

12. Let ABC be a triangle with incircle ω. Points E, F lie on AB, AC such that EF ∥BC and EF
is tangent to ω. If EF = 6 and BC = 7, find AB + AC.

13. Define f (n) to be the sum of the positive integer factors of n. If f (n) = 360 and f (3n) = 1170,
what is the sum of square of digits of the smallest possible value of f (2n) ?

14. Call a positive integer super-even if the last two digits of all its multiples are always even.
If S is the sum of all super-even integers 1 ≤ n ≤ 2018, what is the number of factors of S?

15. How many integers 1 ≤ m ≤ 100 are there such that there exists an integer n which has
the property that exactly m% of the positive integer divisors of n are perfect squares?

SPACE FOR ROUGH WORK

3
16. Let ABCD be a quadrilateral with side lengths AB = 2, BC = 5, CD = 3, and suppose
∠B = ∠C = 90◦ . Let M be the midpoint of AD and

let P be a point on BC so that quadrilaterals
ABP M and DCP M have equal areas. Let P M be ba where a, b are positive integers such that a is
square-free. Find a + b.

17. There is a unique nondecreasing sequence of positive integers a1 , a2 , . . . , an such that


    
1 1 1
a1 + a2 + · · · an + = 2020.
a1 a2 an

Compute a1 + a2 + · · · + an .

18. In △ABC, AC = 3, AB = 4, BC = 5, and I is the incenter of the triangle. Extend BI and CI


to points D and E, respectively, such that BE ⊥ BI and CD ⊥ CI. What is the integer nearest to
the ratio between the areas of △BEI and △CDI ?

19. A positive integer is called triangular number if it can be expressed in the form n(n+1)
2 for
a positive integer n. How many ordered pairs (x, y) of triangular numbers satisfy x − y = 31, 500 ?

20. Consider quadrilateral ABCD with AB = 3, BC = 4, CD = 5, and DA = 6. Circle Γ


passes through A, B, C and intersects DA again at X. Given that CX = 4, compute the area of
quadrilateral ABCD

SPACE FOR ROUGH WORK

4
21. In a plane lies 14 points and all possible lines are drawn among themselves, forming 287
triangles. Suppose N quadrilaterals are formed. Find the sum of square of digits of N .

22. Each of the six boxes shown in the equation below is replaced with a distinct number
chosen from {1, 2, 3, . . . , 15}.
□ □ □
S= + + .
□ □ □
Suppose that the order of the fractions doesn’t matter. Then there is exactly one way to arrange
six numbers into the boxes such that S < 1 and S is as large as possible. Compute the sum of
the 6 numbers.

23. Compute the maximum value of n for which n cards, numbered 1 through n, can be
arranged and lined up in a row such that
• it is possible to remove 20 cards from the original arrangement leaving the remaining cards
in ascending order, and
• it is possible to remove 20 cards from the original arrangement leaving the remaining cards
in descending order.

24. Let ABC be a triangle and let M be the midpoint of BC. The lengths AB, AM, AC form a
geometric sequence in that order. The side lengths of △ABC are 2020, 2021, x in some order. Let
the sum of all possible values of x be S. Find the last two digits of the integer nearest to S.

25. Let ⌈x⌉ denote the smallest integer greater than or equal to x. The sequence (ai ) is defined
as follows: a1 = 1, and for all i ≥ 1,
    
ai + 1 ai + 1
ai+1 = min 7 , 19 .
7 19

Find the last two digits of a100 .

SPACE FOR ROUGH WORK

5
26. Miriam is trying to escape from a haunted house placed in the middle of a circular field
with area 100 square feet. Each minute, she carefully moves 1 foot in any direction she wants;
however, an evil ghost may decide to scare her and make her run 1 foot in the direction opposite
to the one she wanted. What are the last two digits of the least integer number of feet Miriam
must walk in order to escape from the field, independently from the ghost’s tricks?

27. Eddie has a birthday party, in which he invited his 8, very generous, best friends. Each
friend brought a certain number of gifts for Eddie. It is observed that for every group of 4 friends,
at least 2 of them brought the same number of gifts. Moreover, the person with the most gifts
brought 4, while the least brought 1. What is the total number of possible values of the amount
of gifts Eddie received in total?

28. In △ABC, AB = 4, BC = 5, AC = 6, and I is the incenter of the triangle. Let S be the locus
of all points D such that the circumcenter O of △ABD is collinear with AI. Determine the largest
integer less than or equal to the perimeter of S.

29. The AMC 12 consists of 25 problems, where for each problem, a correct answer is worth 6
points, leaving the problem blank is worth 1.5 points, and an incorrect answer is worth 0 points.
The AIME consists of 15 problems, where each problem is worth 10 points, and no partial credit
is given.
Any contestant who scores at least 84 on the AMC 12 is eligible for the AIME, and the USAMO
index of such a student is the sum of his AMC 12 and AIME scores. Determine the last two digits
of the smallest integer N > 300 such that no contestant can possibly obtain a USAMO index of 12 N .

30. Let P0 , P1 , . . . be points in the complex plane such that P0 = −1, P1 = i and Pn = i·Pn−1 +Pn−2
for every n ≥ 2. Let P be the polygon P0 P1 . . . P2017 and let √
P√and A be its perimeter and area,
P a b+c d
respectively. If the value of A can be written in the form e for positive integers a, b, c, d, and
e such that b and d are not divisible by the square of any prime and gcd(a, c, e) = 1, compute the
remainder when a + b + c + d + e is divided by 100.

SPACE FOR ROUGH WORK

6
MOMC IOQM Mock Apple 4
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!

• Answer keys and sources are on the last two pages.


• Mock Compiled by Agamjeet Singh
• The problems are credited to their respective sources.
• 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. Given right triangle ABC, with AB = 4, BC = 3, and CA = 5. Circle ω passes through A
and is tangent to BC at C. If the radius of ω is m
n where m, n are relatively prime positive integers,
then find m + n.

2. Find the number of subsets S of {1, 2, . . . 63} the sum of whose elements is 2008.

3. A circle has radius 52 and center O. Points A is on the circle, and point P on OA satisfies
OP = 28. Point Q is constructed such that QA = QP = 15, and point B is constructed on the circle
so that Q is on OB. Find QB.

4. Let ABC be a right triangle with ∠A = 90◦ . Let D be the midpoint of AB and let E be a point

on segment AC such that AD = AE. Let BE meet CD at F . If ∠BF C = 135◦ , then let BC/AB = nm
where m, n are relatively prime positive integers. Find m + n.

5. A particle starts at (0, 0, 0) in three-dimensional


√ space. Each second, it randomly selects one
of the eight lattice points a distance of 3 from its current location and √ moves to that point. Let
the probability that, after two seconds, the particle is a distance of 2 2 from its original location
be mn where m, n are relatively prime positive integers. Find m + n.

SPACE FOR ROUGH WORK

2
6. For how many ordered triples (a, b, c) of positive integers are the equations abc+9 = ab+bc+ca
and a + b + c = 10 satisfied?

7. Dilhan is running around a track for 12 laps. If halfway through a lap, Dilhan has his
phone on him, he has a 13 chance to drop it there. If Dilhan runs past his phone on the ground,
he will attempt to pick it up with a 23 chance of success, and won’t drop it for the rest of the lap.
He starts with his phone at the start of the 5 K, let the chance he still has it when he finished the
5 K be ab where a, b are relatively prime positive integers. Find m + n.

8. How many 4-digit numbers have exactly 9 divisors from the set {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}?

9. Let z be a complex number that satisfies the equation


z−4 2z − 4 z−2 3
+ 2 + 2 = .
z2 − 5z + 1 2z − 5z + 1 z − 3z + 1 z
Over all possible values of z, Let the sum of all the possible values of

1 1 1
+ +
z 2 − 5z + 1 2z 2 − 5z + 1 z 2 − 3z + 1

be S. Find the integer nearest to 10S.

10. For polynomials P (x) = an xn + · · · + a0 , let f (P ) = an · · · a0 be the product of the coefficients


of P . The polynomials P1 , P2 , P3 , Q satisfy P1 (x) = (x − a)(x − b), P2 (x) = (x − a)(x − c), P3 (x) =
(x − b)(x − c), Q(x) = (x − a)(x − b)(x − c) for some complex numbers a, b, c. Given f (Q) = 8, f (P1 ) +
f (P2 ) + f (P3 ) = 10, and abc > 0, find the value of f (P1 ) f (P2 ) f (P3 ).

SPACE FOR ROUGH WORK

3
11. 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 an-
gry 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 minutes does it take Trodgor to burn
down the entire village?

12. Let P (x) be a polynomial with degree 4 and leading coefficient 1 such that

P (0) = 3, P (1) = 2, P (2) = 1, P (3) = 0

Determine the value of P (4).

13. Alan is assigning values to lattice points on the 3D coordinate plane. First, Alan computes
the roots of the cubic 20x3 − 22x2 + 2x + 1 and finds that they are α, β, and γ. He finds out that
each of these roots satisfy |α|, |β|, |γ| ≤ 1 On each point (x, y, z) where x, y, and z are all nonnegative
integers, Alan writes down αx β y γ z . What is the value of the sum of all numbers he writes down?

14. For a positive integer n, let θ(n) denote the number of integers 0 ≤ x < 2010 such that x2 − n
P2009
is divisible by 2010. Determine the remainder when n=0 n · θ(n) is divided by 100.

15. Starting with a 5 × 5 grid, choose a 4 × 4 square in it. Then, choose a 3 × 3 square in the
4×4 square, and a 2×2 square in the 3×3 square, and a 1×1 square in the 2×2 square. Assuming
all squares chosen are made of unit squares inside the grid. In how many ways can the squares
be chosen so that the final 1 × 1 square is the center of the original 5 × 5 grid?

SPACE FOR ROUGH WORK

4
16. We say that a set S of 3 unit squares is commutable if S = {s1 , s2 , s3 } for some s1 , s2 , s3
where s2 shares a side with each of s1 , s3 . How many ways are there to partition a 3 × 3 grid of
unit squares into 3 pairwise disjoint commutable sets?

17. Point A lies at (0, 4) and


√ point B lies at (3, 8). Let the x-coordinate of the point X on the
x-axis maximizing ∠AXB be a b − c where a, b, c are positive integers such that b is square-free.
Find a + b + c.

18. Let ABC be an acute triangle with ∠ABC = 60◦ . Suppose points D and E are on lines AB
and CB, respectively, such that CDB and AEB are equilateral triangles. Given that the positive
difference
√ between the perimeters of CDB and AEB is 60 and DE = 45, what is the integer nearest
to AB · BC ?

19. Cyclic pentagon ABCDE has a right angle ∠ABC = 90◦ and side lengths AB = 15 and
BC = 20. Supposing that AB = DE = EA, find CD.

20. A shipping company charges .30l + .40w + .50h dollars to process a right rectangular prism-
shaped box with dimensions l, w, h in inches. The customers themselves are allowed to label the
three dimensions of their box with l, w, h for the purpose of calculating the processing fee. A
customer finds that there are two different ways to label the dimensions of their box B to get a fee
of $8.10, and two different ways to label B to get a fee of $8.70. None of the faces of B are squares.
Find the sum of the distinct prime factors of the volume of B.

SPACE FOR ROUGH WORK

5
21. A sequence of pairwise distinct positive integers is called averaging if each term after the
first two is the average of the previous two terms. Let M be the maximum possible number of
terms in an averaging sequence in which every term is less than or equal to 2022 and let N be the
number of such distinct sequences (every term less than or equal to 2022) with exactly M terms.
Find the remainder when M + N is divided by 100. (Two sequences a1 , a2 , · · · , an and b1 , b2 , · · · , bn
are said to be distinct if ai ̸= bi for some integer 1 ≤ i ≤ n)

22. Find the largest prime factor of the smallest positive integer N such that each of the 101
intervals  2
N , (N + 1)2 , (N + 1)2 , (N + 2)2 , · · · , (N + 100)2 , (N + 101)2
    

contains at least one multiple of 1001.

23. Let Fn denote the nth Fibonacci number, with F0 = 0, F1 = 1 and Fn = Fn−1 + Fn−2 for n ≥ 2.
There exists a unique two digit prime p such that for all n, p | Fn+100 + Fn . Find p.

SPACE FOR ROUGH WORK

6
24. Let ABC be a triangle with AB = 5, BC = 4 and AC = 3. Let P and Q be squares inside
ABC with disjoint interiors such that they both have one side lying on AB. Also, the two squares
each have an edge lying on a common line perpendicular to AB, and P has one vertex on AC and
Q has one vertex on BC. Let the minimum value of the sum of the areas of the two squares be m n
where m, n are relatively prime positive integers. Find |m − n|.

25. Suppose that ABC is an isosceles triangle with AB = AC. Let P be the point on side AC
so that AP = 2CP . Given that BP = 1, let the maximum possible area of ABC be m n where m, n
are relatively prime positive integers. Find m + n.

26. A triangle △ABC satisfies AB = 13, BC = 14, and AC = 15. Inside △ABC are three points
X, Y , and Z such that:
• Y is the centroid of △ABX

• Z is the centroid of △BCY


• X is the centroid of △CAZ
m
Let the area of △XY Z be n where m, n are relatively prime positive integers. Find m + n.

SPACE FOR ROUGH WORK

7
27. Daniel, Ethan, and Zack are playing a multi-round game of Tetris. Whoever wins 11 rounds
first is crowned the champion. However Zack is trying to pull off a ”reverse-sweep”, where (at-
least) one of the other two players first hits 10 wins while Zack is still at 0, but Zack still ends up
being the first to reach 11. Find the last two digits of the possible sequences of round wins that
can lead to Zack pulling off a reverse sweep.

28. For a family gathering, 8 people order one dish each. The family sits around a circular
table. Find the number of ways to place the dishes so that each person’s dish is either to the left,
right, or directly in front of them.

29. There are 9 points arranged in a 3×3 square grid. Let two points be adjacent if the distance
between them is half the side length of the grid. (There should be 12 pairs of adjacent points).
Suppose that we wanted to connect 8 pairs of adjacent points, such that all points are connected
to each other. Suppose that there are M ways in which this is possible. Find the sum of square
of digits of M .

30. Alice and the Cheshire Cat play a game. At each step, Alice either (1) gives the cat a penny
(worth 1 cent), which causes the cat to change the number of (magic) beans that Alice has from n
to 5n or (2) gives the cat a nickel (worth 5 cents), 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?

SPACE FOR ROUGH WORK

8
MOMC IOQM Mock Apple 3
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!

• Answer keys and sources are on the last two pages.


• Mock Compiled by Agamjeet Singh
• The problems are credited to their respective sources.
• 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. A teacher gives a multiple choice test to 15 students and that each student answered each
question. Each question had 5 choices, but remarkably, no pair of students had more than 2
answers in common. What is the maximum number of questions that could have been on the
quiz?

2. Suppose in your sock drawer of 14 socks there are 5 different colors and 3 different lengths
present. One day, you decide you want to wear two socks that have both different colors and dif-
ferent lengths. Given only this information, what is the maximum number of choices you might
have?

3. A farmer learns that he will die at the end of the year (day 365, where today is day 0) and
that he has a number of sheep. He decides that his utility is given by ab where a is the money he
makes by selling his sheep (which always have a fixed price) and b is the number of days he has
left to enjoy the profit; i.e., 365 − k where k is the day. If every day his sheep breed and multiply
their numbers by 103/101 (yes, there are small, fractional sheep), then find the sum of digits of
the day on which he should sell them all.

π
4. Line segements AB and AC are tangent to a convex arc BC d and ∠BAC =
3. If AB = AC =

3 3, find the integer nearest to 10 times the length of minor arc BC.
d

5. A secant line incident to a circle at points A and C intersects the circle’s diameter at point
B with a 45◦ angle. If the length of AB is 1 and the length of BC is 7, then what is the circle’s
radius?

SPACE FOR ROUGH WORK

2
√ √
6. Find the number of positive integer solutions to the equation ⌊ 3 x⌋ + ⌊ 4 x⌋ = 4.

7. Let ab be a fraction such that a and b are positive integers and the first three digits of its
decimal expansion are 0.527. What is the smallest possible value of a + b ?

8. Let AD be a diameter of a circle. Let point B be on the circle, point C be on AD such that
A, B, C form a right triangle with right angle at C. The value of the hypotenuse of the triangle is 4
times the square root of its area. If BC has length 20.23 , what is the integer nearest to the length
of the radius of the circle?

9. You have four fair 6-sided dice, each numbered from 1 to 6 (inclusive). If all four dice are
rolled, the probability that the product of the rolled numbers is prime can be written as ab , where
a, b are relatively prime. What is a + b ?

10. Suppose that you start with the number 8 and always have two legal moves:
• Square the number

• Add one if the number is divisible by 8 or multiply by 4 otherwise


How many sequences of 4 moves are there that return to a multiple of 8 ?

SPACE FOR ROUGH WORK

3
11. Define a function given the following 2 rules:
• for prime p, f (p) = p + 1
• for positive integers a and b, f (ab) = f (a) · f (b).

For how many positive integers n ≤ 100 is f (n) divisible by 3 ?

12. Let 0 ≤ a, b, c, d ≤ 10. Suppose there are N ordered quadruples (a, b, c, d) such that ad − bc
is a multiple of 11. Find the sum of square of digits of N .

13. For how many positive integers n less than 2018 does n2 have the same remainder when
divided by 7, 11, and 13?

SPACE FOR ROUGH WORK

4
14. Let ABC be a triangle with side lengths 13, 14, 15. The points on the interior of ABC with
distance at least 1 from each side are shaded. Find the integer nearest to the area of the shaded
region.

15. Some number of regular polygons meet at a point on the plane, so that the polygons’
interiors do not overlap, but the polygons fully surround the point (i.e. a sufficiently small circle
centered at the point would be contained in the union of the polygons). What is the largest pos-
sible number of sides in any of the polygons?

16. Let triangle △ABC have AB = 90 and AC = 66. Suppose that the line IG is perpendicular
to side BC, where I and G are the incenter and centroid, respectively. Find the length of BC.

SPACE FOR ROUGH WORK

5

q p
17. If a and b are positive integers such that 3 2 + 2 + 3 = a cos πb , find a + b.

18. Let b1 = 1 and bn+1 = 1 + n(n+1)b11 b2 ...bn for n ≥ 1. Let bi = m


ni where mi , ni are relatively prime
i

positive integers. Find the smallest possible value of k such that mk + nk > 1000.

19. There exist real numbers a, b, c, d, and e such that for all positive integers n, we have
n−1

qp p
5
X
n= ai5 + bi4 + ci3 + di2 + ei + 1 − ai5 + bi4 + ci3 + di2 + ei
i=0

Find the remainder when a + b + c + d is divided by 100.

20. Let x0 , x1 , . . . be a sequence of real numbers such that xn = 1+x n−1


xn−2 for n ≥ 2. Find the
sum of square of digits of the number of ordered pairs of positive integers (x0 , x1 ) such that the
1
sequence gives x2018 = 1000 .

SPACE FOR ROUGH WORK

6
21. Let ∆ denote the pyramid with edges of lengths√2, 3, 3, 4, 5, 5 respectively such that it has
maximal volume. If the volume of ∆ can be written as mp n where m, n, p are positive integers such
that n is square-free and m, p are relatively prime, then find m + n + p.

22. Suppose the transformation T acts on points in the plane like this:
 
x −y
T (x, y) = ,
x2 + y 2 x2 + y 2

Let A be the area enclosed by the set of points of the form T (x, y), where (x, y) is a point on the
edge of a length-2 square centered at the origin with sides parallel to the axes. Find the integer
nearest to 10A.

23. Kite ABCD has right angles at B and D, and AB < BC. Points E ∈ AB and F ∈ AD satisfy
AE = 4, EF = 7, F A = 5. If AB = 8 and point X lies outside

ABCD while satisfying XE − XF = 1
a−b c
and XE + XF + 2XA = 23, then XA may be written as d for a, b, c, d. Find the remainder when
a + b + c + d is divided by 100.

SPACE FOR ROUGH WORK

7
24. Let w and h be positive integers and define N (w, h) to be the number of ways of arranging
wh people of distinct heights for a photoshoot in such a way that they form w columns of h people,
with the people in each column sorted by height (i.e. shortest at the front, tallest at the back).
Find the sum of square of digits of the largest value of N (w, h) that divides 1008.

25. For a positive integer n, let f (n) be the number of (not necessarily distinct) primes in the
prime factorization of n. For example, f (1) = 0, f (2) = 1, and f (4) = f (6) = 2. Let g(n) be the
number of positive integers k ≤ n such that f (k) ≥ f (j) for all j ≤ n. Find the sum of all distinct
prime factors of g(1) + g(2) + . . . + g(100).

26. A robot is shuffling a 9 card deck. Being very well machined, it does every shuffle in
exactly the same way: it splits the deck into two piles, one containing the 5 cards from the bottom
of the deck and the other with the 4 cards from the top. It then interleaves the cards from the two
piles, starting with a card from the bottom of the larger pile at the bottom of the new deck, and
then alternating cards from the two piles while maintaining the relative order of each pile. The
top card of the new deck will be the top card of the bottom pile.

The robot repeats this shuffling procedure a total of n times, and notices that the cards are in
the same order as they were when it started shuffling. What is the smallest possible value of n ?

SPACE FOR ROUGH WORK

8
27. Suppose real numbers a, b, c, d satisfy a + b + c + d = 17 and ab + bc + cd + da = 46. If the
minimum possible value of a2 + b2 + c2 + d2 can be expressed as a rational number pq in simplest
form, find the remainder when p + q is divided by 100.

1 1 1
28. Let a, b, c be non-zero real numbers that satisfy abc + a + c = 1b . The expression

4 4 7
+ +
a2 + 1 b2 + 1 c2 + 1
has a maximum value M . Find the sum of the numerator and denominator of the reduced form
of M .

29. There are numerous sets of 17 distinct positive integers that sum to 2018, such that each
integer has the same sum of digits in base 10. Let M be the maximum possible integer that could
exist in any such set. Find the last two digits of the sum of M and the number of such sets that
contain M .

30. Consider a 10-dimensional 10 × 10 × . . . × 10 cube consisting of 1010 unit cubes, such that
one cube A is centered at the origin, and one cube B is centered at (9, 9, 9, 9, 9, 9, 9, 9, 9, 9). Paint A
red and remove B, leaving an empty space. Let a move consist of taking a cube adjacent to the
empty space and placing it into the empty space, leaving the space originally contained by the
cube empty. Let N be the minimum number of moves required to result in a configuration where
the cube centered at (9, 9, 9, 9, 9, 9, 9, 9, 9, 9) is red. Find the sum of square of digits of N .

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Apple 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!

• Answer keys and sources are on the last two pages.


• Mock Compiled by Agamjeet Singh
• The problems are credited to their respective sources.
• 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. Consider the set S = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. How many distinct 3-element subsets are there
such that the sum of the elements in each subset is divisible by 3 ?

2. Lisa has a 2D rectangular box that is 6 units long and 21 units wide. She shines a laser
beam into the box through one of the corners such that the beam is at a 45◦ angle with respect
to the sides of the box. Whenever the laser beam hits a side of the box, it is reflected perfectly,
again at a 45◦ angle. Find the integer nearest to the distance that the laser beam travels until it
hits one of the four corners of the box.

3. Let A and B be fixed points on a 2-dimensional plane with distance AB = 1. An ant walks
on a straight line from point A to some point C on the same plane and finds that the distance
from itself to B always decreases at any time during this walk. Let m
n π be the area of the locus of
points where point C could possibly be located, where m, n are relatively prime positive integers.
Find m + n.

4. In a standard game of Rock-Paper-Scissors, two players repeatedly choose between rock,


paper, and scissors, until they choose different options. Rock beats scissors, scissors beats paper,
and paper beats rock. Nathan knows that on each turn, Richard randomly chooses paper with
probability 33%, scissors with probability 44%, and rock with probability 23%. If Nathan plays
optimally against Richard, the probability that Nathan wins is expressible as a/b where a and b
are coprime positive integers. Find a + b.

5. Let S be the sum of all positive integers n whose digits (in decimal representation) add up
to n/57. Find the integer nearest to S.

SPACE FOR ROUGH WORK

2
6. Find the sum of all positive integers k such that there exists a positive integer a such that
7k 2 = a3 + a! + 2767

7. How many ways can you divide a heptagon into five non-overlapping triangles such that
the vertices of the triangles are vertices of the heptagon?

8. Let S be the sum of all positive integers n with at most three digits that satisfy n = (a+b)·(b+c)
when n is written in base 10 as abc. Find the remainder when S is divided by 100. Note: The in-
teger n can have leading zeroes.

9. Let f be the cubic polynomial that passes through the points (1, 30), (2, 15), (3, 10), and (5, 6).
Compute the product of the roots of f

10. Consider the equation


1 1 1 1
1− = + + ,
d a b c
with a, b, c, and d being positive integers. What is the largest value for d ?

SPACE FOR ROUGH WORK

3
11. In the diagram below, point A lies on the circle centered at [Link] is tangent to circle O
with AB = 6. Point C is 2π
3 radians away from point A on the circle,
√ with
√ BC intersecting circle O
at point D. The length of BD is 3. Let the radius of the circle be m − n where m, n are distinct
positive integers. Find m + n.

12. Two unit squares are stacked on top of one another to form a 1 × 2 rectangle. Each of
the seven edges is colored either red or blue. How many ways are there to color the edges in this
way such that there is exactly one path along all-blue edges from the bottom-left corner to the
top-right corner?

13. Consider a triangle where the sum of the three side lengths is equal to the product of the
three side lengths. If the circumcircle has 25 times the area of the√incircle, the distance between
the incenter and the circumcenter can be expressed in the form yx , for integers x and y, with x
square-free. Find x + y.

SPACE FOR ROUGH WORK

4
14. Assuming real values for p, q, r, and s, the equation

x4 + px3 + qx2 + rx + s

has four non-real roots. The sum of two of these roots is 4 + 7i, and the product of the other two
roots is 3 − 4i. Find q.

15. If a, b, c are positive reals such that abc = 64 and 3a2 + 2b3 + c6 = 384, compute maximum
value of a + b + c.

16. In △ABC, let ∠CAB = 45◦ , and |AB| = 2, |AC| = 6. Let M be the midpoint of side BC.
The line AM intersects the circumcircle of △ABC at P . The circle centered at M with radius M P
intersects the circumcircle of ABC again at Q ̸= P . Suppose the tangent to the circumcircle of
△ABC at B intersects AQ at T . Find T C 2 .

SPACE FOR ROUGH WORK

5
17. Suppose that the number of ways in which we can form a group with an odd number of
members (plural) from 99 people total is ab + c where a is as small as possible and |c| < 1000 (a, b, c
are integers). Find the remainder when a + b + c is divided by 100.

18. A robot starts in the bottom left corner of a 4 × 4 grid of squares. How many ways can it
travel to each square exactly once and then return to its start if it is only allowed to move to an
adjacent (not diagonal) square at each step?

19. Let σ be a permutation of the numbers 1, 2, 3, 4. If

σ(a) · σ 2 (a) · σ 3 (a) · σ 4 (a) + 1

is divisible by 5 for all a ∈ {1, 2, 3, 4}, compute the number of possible σ.

20. Let f be a function over the natural numbers so that


• f (1) = 1

• If n = pe11 . . . pekk where p1 , · · · , pk are distinct primes, and e1 , · · · ek are non-negative integers,
then f (n) = (−1)e1 +..+ek
P2019 P
Find i=1 d|i f (d).

SPACE FOR ROUGH WORK

6
21. Compute $ %
49
X  πn 
sin
n=0
100

22. Consider the triangle with vertices (0, 0), (1, 0), and (0, 1). Let A, B, and C denote the dis-
tances from a given point to each of the three vertices. Denote the distance from the point √
that

minimizes A + B + C to the point that minimizes A2 + B 2 + C 2 by d. If d is written as a− c
b
where
a and b are square free, find a + b + c.

23. In quadrilateral ABCD, angles A, B, C, D form an increasing arithmetic sequence. Also,


∠ACB = 90◦ . If CD = 7 and the length of the altitude from C to AB is 92 , compute the area of
ABCD.

SPACE FOR ROUGH WORK

7
24. Let Q be a quadratic polynomial.
 If the sum of the roots of Q100 (x) (where Qi (x) is defined
1 i i−1
by Q (x) = Q(x), Q (x) = Q Q (x) for integers i ≥ 2) is 8 and the sum of the roots of Q is S, find
|log2 (S)|.

25. Compute the lowest positive integer k such that none of the numbers in the sequence
{1, 1+ k, 1 + k + k 2 , 1 + k + k 2 + k 3 , · · · are prime.

26. Consider the first set of 38 consecutive positive integers who all have sum of their digits
not divisible by 11 . Find the sum of digits of the smallest integer in this set.

SPACE FOR ROUGH WORK

8
27. Let n be the smallest positive integer which can be expressed as a sum of multiple (at
least two) consecutive integers in precisely 2019 ways. Then n is the product of k not necessarily
distinct primes. Find the sum of digits of k.
Pn
28. For a positive integer n, let f (n) = i=1 ⌊log2 n⌋. Find the largest two digit positive integer
n such that n | f (n).

29. A 7 × 7 grid of unit-length squares is given. Twenty-four 1 × 2 dominoes are placed in the
grid, each covering two whole squares and in total leaving one empty space. It is allowed to take a
domino adjacent to the empty square and slide it lengthwise to fill the whole square, leaving a new
one empty and resulting in a different configuration of dominoes. Given an initial configuration
of dominoes for which the maximum possible number of distinct configurations can be reached
through any number of slides, find the maximum number of distinct configurations.

30. Alice wants to paint each face of an octahedron either red or blue. She can paint any
number of faces a particular color, including zero. Compute the number of ways in which she
can do this. Two ways of painting the octahedron are considered the same if you can rotate the
octahedron to get from one to the other.

SPACE FOR ROUGH WORK

9
MOMC IOQM Mock Apple 1
Instructions:

• All answers are in the integer range of 00 − 99. Although there is a non-zero chance of a intentional
bonus.

• Problems 1 − 10 are 2 Markers, 11 − 20 are 3 Markers and 21 − 30 are 5 Markers.


• The test begins from the next page. So only proceed to the next page if you are starting the test!
• Answer keys and sources are on the last two pages.

• Mock Compiled by Agamjeet Singh


• This is Mock Apple 1
• The problems are credited to their respective sources.
• There are a few bonus problems on the last two pages.

• 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. Princeton has an endowment of 5 million dollars and wants to invest it into improving cam-
pus life. The university has three options: it can either invest in improving the dorms, campus
parties or dining hall food quality. If they invest a million dollars in the dorms, the students will
spend an additional 5a hours per week studying. If the university invests b million dollars in better
food, the students will spend an additional 3b hours per week studying. Finally, if the c million
dollars are invested in parties, students will be more relaxed and spend 11c − c2 more hours per
week studying. The university wants to invest its 5 million dollars so that the students get as many
additional hours of studying as possible. What is the maximal amount that students get to study?

2. Let ABC be a triangle with AB = BC. The altitude from A intersects line BC at D. Suppose
BD = 5 and AC 2 = 1188. Find the sum of all possible values of AB.

3. The expression below has six empty boxes. Each box is to be filled in with a number from 1
to 6 , where all six numbers are used exactly once, and then the expression is evaluated. Let m
n be
the maximum possible final result that can be achieved, where m, n are relatively prime positive
integers. Find m + n.
□ □
□ + □

4. A robot is at position 0 on a number line. Each second, it randomly moves either one unit
in the positive direction or one unit in the negative direction, with probability 21 of doing each.
Let the probability that after 4 seconds, the robot has returned to position 0 be m
n where m, n are
relatively prime positive integers. Find m + n.

5. Hexagon ABCDEF has an inscribed circle Ω that is tangent to each of its sides.
√ If AB = 12,
∠F AB = 120◦ , and ∠ABC = 150◦ , and if the radius of Ω can be written as m + n for positive
integers m, n, find m + n.

SPACE FOR ROUGH WORK

2
6. How many ordered triples of nonzero integers (a, b, c) satisfy 2abc = a + b + c + 4?

7. An integer n > 0 is such that n when represented in base 2 is written the same way as 2n is
in base 5. Find the largest possible value of n.

8. Suppose that a, b are positive real numbers with a > b and ab = 8. Find the minimum value
a2 +b2
of a−b .

9. Let P (x) be a monic polynomial of degree 3. Suppose that P (x) has remainder R(x) when it
is divided by (x−1)(x−4) and 2R(x) when it is divided by (x−2)(x−3). Given that P (0) = 5, find P (5).

10. Suppose S is a subset of {1, 2, 3, 4, 5, 6, 7}. How many different possible values are there for
the product of the elements in S ?

SPACE FOR ROUGH WORK

3
11. Shelly writes down a vector v = (a, b, c, d), where 0 < a < b < c < d are integers. Let σ(v)
denote the set of 24 vectors whose coordinates are a, b, c, and d in some order. For instance, σ(v)
contains (b, c, d, a). Shelly notes that there are 3 vectors in σ(v) whose sum is of the form (s, s, s, s)
for some s. What is the smallest possible value of d ?

12. Let S be a square of side length 1 , one of whose vertices is A. Let S + be the square obtained
by rotating S clockwise about A by 30◦ . Let S − be the square obtained by rotating S counterclock-
wise

about A by 30◦ . Let the total area that is covered by exactly two of the squares S, S + , S − be
a b−c
d where a, c, d are pairwise coprime and b is square-free. Find a + b + c + d.

13. In triangle ABC, the angle bisector from A and the perpendicular bisector of BC meet at
point D, the angle bisector from B and the perpendicular bisector of AC meet at point E, and the
perpendicular bisectors of BC and AC meet at point F . Given that ∠ADF = 5◦ , ∠BEF = 10◦ , and
AC = 3, find the integer nearest to 10 times the length of DF .

SPACE FOR ROUGH WORK

4
14. Let f be a polynomial with integer coefficients such that the greatest common divisor of
all its coefficients is 1. For any n ∈ N, f (n) is a multiple of 85. Find the smallest possible degree of f .

15. Let P be a 10-degree monic polynomial with roots r1 , r2 , . . . , r10 ̸= 0 and let Q be a 45-degree
monic polynomial with roots r1i + r1j − ri1rj where i < j and i, j ∈ {1, . . . , 10}. If P (0) = Q(1) = 2, then
log2 (|P (1)|) can be written as ab for relatively prime integers a, b. Find a + b

16. Let a1 , a2 , a3 , a4 , a5 , a6 be a permutation of the numbers 1, 2, 3, 4, 5, 6. We say ai is visible if


ai is greater than any number that comes before it; that is, aj < ai for all j < i. For example, the
permutation 2, 4, 1, 3, 6, 5 has three visible elements: 2, 4, 6. If there are M permutations that have
exactly two visible elements, then find the sum of square of digits of M .

SPACE FOR ROUGH WORK

5
17. Bob is writing a sequence of letters of the alphabet, each of which can be either uppercase
or lowercase, according to the following two rules:
• If he had just written an uppercase letter, he can either write the same letter in lowercase
after it, or the next letter of the alphabet in uppercase.

• If he had just written a lowercase letter, he can either write the same letter in uppercase
after it, or the preceding letter of the alphabet in lowercase.
For instance, one such sequence is aAaABCDdcbBC. Let the number of sequences of 32 letters
that he can write that start at (lowercase) a and end at (lowercase) z be N . Find the sum of square
of digits of N .

18. A positive integer is called jubilant if the number of 1’s in its binary representation is
even. For example, 6 = 1102 is a jubilant number. What is the sum of square of digits of the 2009th
smallest jubilant number?

19. A positive integer x is k-equivocal if there exists two positive integers b, b′ such that when
x is represented in base b and base b′ , the two representations have digit sequences of length k
that are permutations of each other. The smallest 2-equivocal number is 7 , since 7 is 21 in base
3 and 12 in base 5 . Find the smallest 3-equivocal number.

20. A spider is making a web between n > 1 distinct leaves which are equally spaced around
a circle. He chooses a leaf to start at, and to make the base layer he travels to each leaf one at a
time, making a straight line of silk between each consecutive pair of leaves, such that no two of
the lines of silk cross each other and he visits every leaf exactly once. Let fn be the number of
way in which the spider can make the base layer of the web. Find the largest integer n such that
fn < 2023.

SPACE FOR ROUGH WORK

6
21. Circle Ω has radius 13. Circle ω has radius 14 and its center P lies on the boundary of
circle Ω. Points A and B lie on Ω such that chord AB has length 24 and is tangent to ω at point
T . Find AT · BT .

22. The vertices of a regular hexagon are labeled cos(θ), cos(2θ), . . . , cos(6θ). For every pair of
vertices, Benjamin draws a blue line through the vertices if one of these functions can be ex-
pressed as a polynomial function of the other (that holds for all real θ), and otherwise Roberta
draws a red line through the vertices. In the resulting graph, how many triangles whose vertices
lie on the hexagon have at least one red and at least one blue edge?

23. A convex polygon in the Cartesian plane has all of its vertices on integer coordinates. One
of the sides of the polygon is AB where A = (0, 0) and B = (51, 51), and the interior angles at A and
B are both at most 45 degrees. Assuming no 180 degree angles, what is the maximum number of
vertices this polygon can have?

SPACE FOR ROUGH WORK

7
24. Suppose that a, b, c, d, e, f are real numbers such that

a+b+c+d+e+f =0
a + 2b + 3c + 4d + 2e + 2f = 0
a + 3b + 6c + 9d + 4e + 6f = 0
a + 4b + 10c + 16d + 8e + 24f = 0
a + 5b + 15c + 25d + 16e + 120f = 42,

Find the sum of digits of a + 6b + 21c + 36d + 32e + 720f .

25. Let ak be the number of perfect squares m such that k 3 ≤ m < (k + 1)3 . For example, a2 = 3
since three squares m satisfy 23 ≤ m < 33 , namely 9, 16 and 25. Compute the last two digits of
99 √
X
⌊ k⌋ak ,
k=0

where ⌊x⌋ denotes the largest integer less than or equal to x.

26. Let p (in base 10) be the third greatest positive integer less than 100010 which is a palin-
drome in both base 5 and 10. Find the greatest prime divisor of p.

SPACE FOR ROUGH WORK

8
27. Given two positive integers a ̸= b, let f (a, b) be the smallest integer that divides exactly one
of a, b, but not both. Let 100m + n be the number of pairs of positive integers (x, y), where x ̸= y,
1 ≤ x, y, ≤ 100 and gcd(f (x, y), gcd(x, y)) = 2, where m, n < 100 are positive integers. Find m + n.

28. A special kind of chess knight is in the origin of an infinite grid. It can make one of twelve
different moves: it can move directly up, down, left, or right one unit square, or it can move 1
units in one direction and 3 units in an orthogonal direction. How many different squares can it
be on after 2 moves?

29. Katie has a chocolate bar that is a 5 × 5 grid of square pieces, but she only wants to eat
the center piece. To get to it, she performs the following operations:

• Take a gridline on the chocolate bar, and split the bar along the line.
• Remove the piece that doesn’t contain the center.
• With the remaining bar, repeat steps 1 and 2.

Let N be the number of ways that Katie can perform this sequence of operations so that eventually
she ends up with just the center piece. Find the sum of all distinct primes dividing N .

30. Let F0 = 0, F1 = 1, and Fn = Fn−1 + Fn−2 . How many subsets S of {1, 2, . . . 99} are there
such that X
F100 − 1 = Fi ?
i∈S

SPACE FOR ROUGH WORK

9
Bonus Problems
Note that the answers of the bonus problems may not be in the integer range of 00-99.

2-3 Markers.

1. Let f (x) = x + 2x2 + 3x3 + 4x4 + 5x5 + 6x6 , and let S = [f (6)]5 + [f (10)]3 + [f (15)]2 . Compute the
remainder when S is divided by 30.

2. In how many distinct ways can you color each of the vertices of a tetrahedron either red,
blue, or green such that no face has all three vertices the same color? (Two colorings are consid-
ered the same if one coloring can be rotated in three dimensions to obtain the other.)

3. How many ordered quadruples (a, b, c, d) of four distinct numbers chosen from the set
{1, 2, 3, . . . , 9} satisfy b < a, b < c, and d < c ?

4. The average of a set of distinct primes is 27. What is the largest prime that can be in this set?

5. Let γ1 and γ2 be circles centered at O and P respectively, and externally tangent to each
other at point Q. Draw point D on γ1 and point E on γ2 such that line DE is tangent to both
circles. If the length OQ = 1 and the area of the quadrilateral ODEP is 520 , then what is the
value of length P Q?

5 Markers.

1. Let {x} = x − ⌊x⌋. Consider a function f from the set {1, 2, . . . , 2020} to the half-open interval
[0, 1). Suppose that for all x, y, there exists a z so that {f (x) + f (y)} = f (z). We say that a pair
of integers m, n is valid if 1 ≤ m, n, ≤ 2020 and there exists a function f satisfying the above so
f (1) = m m
n . Let S be the sum over all valid pairs m, n of n . Find the sum of digits of S.

2. A circle having radius r1 centered at point N is tangent to a circle of radius r2 centered at


M . Let l and j be the two common external tangent lines to the two circles. A circle centered at
P with radius r2 is externally tangent to circle N at the point at which l coincides with circle N ,
and line k is externally tangent to P and N such that points M, N , and P all lie on the same side
of k. For what ratio r1 /r2 are j and k parallel?

3. In a 4 × 4 grid of sixteen unit squares, exactly 8 are shaded so that each shaded square
shares an edge with exactly one other shaded square. How many ways can this be done?

4. Find the number of pairs of positive integers a, b, with a ≤ 125 and b ≤ 100, such that ab − 1
is divisible by 125.

5. Let ak be the number of ordered 10-tuples (x1 , x2 , . . . x10 ) of nonnegative integers such that

x21 + x22 + · · · + x210 = k.


P2012
Let bk = 0 if ak is even and bk = 1 if ak is odd. Find i=1 b4i .

6. Three different faces of a regular dodecahedron are selected at random and painted. What
is the probability that there is at least one pair of painted faces that share an edge?

7. Circle Ω has radius 5. Points A and B lie on Ω such that chord AB has length 6 . A unit
circle ω is tangent to chord AB at point T . Given that ω is also internally tangent to Ω, find AT ·BT .

8. Suppose we havePa sequence a1 , a2 , . . . of positive real numbers so that for each positive
n
integer n, we have that k=1 ak a⌊√k⌋ = n2 . Determine the first value of k so ak > 100.

10
9. Triangle ABC is so that AB = 15, BC = 22, and AC = 20. Let D, E, F lie on BC, AC, and
AB, respectively, so AD, BE, CF all contain a point K. Let L be the second intersection of the
AK
circumcircles of BF K and CEK. Suppose that KD = 11 2 a
7 , and BD = 6. If KL = b , where a, b are
relatively prime integers, find a + b.

10. Let P be the power set of {1, 2, 3, 4} (meaning the elements of P are the subsets of {1, 2, 3, 4}
). How many subsets S of P are there such that no two distinct integers a, b ∈ {1, 2, 3, 4} appear
together in exactly one element of S ?

11. Cary has six distinct coins in a jar. Occasionally, he takes out three of the coins and adds
a dot to each of them. Determine the number of orders in which Cary can choose the coins so
that, eventually, for each number i ∈ {0, 1, . . . , 5}, some coin has exactly i dots on it.

11
MOMC IOQM Mock Espresso 2 Answer Key
After checking your answers, be sure to fill in this short google form about the mock. I really
appreciate it! You can find the results of the form by clicking here.

Sources: SMT 2018 and 2019, CIME I and II 2018, BMT 2018 and HMMT February 2017

Answer Key:

1. 41
2. 56
3. 5
4. 20
5. 21
6. 95
7. 15
8. 19
9. 97
10. 51
11. 36
12. 45
13. 32
14. 49
15. 74
16. 38
17. 39
18. 21
19. 13
20. 13
21. 25
22. 76
23. 16
24. 13
25. 28
26. 17
27. 56
28. 23
29. 68
30. 26

1
MOMC IOQM Mock Espresso 1 Answer Key
After checking your answers, be sure to fill in this short google form about the mock. I really
appreciate it! You can find the results of the form by clicking here.

Sources: HMMT 2022 February and ARML 2017

Answer Key for Mock:

1. 9
2. 21
3. 23
4. 66
5. 48
6. 50
7. 60
8. 22
9. 10
10. 29
11. 21
12. 23
13. 12
14. 15
15. 5
16. 25
17. 335 (Bonus!)
18. 89
19. 8
20. 21
21. 44
22. 10
23. 11
24. 24
25. 10
26. 4
27. 49
28. 17
29. 90
30. 29

1
MOMC IOQM Mock Donut 4 Answer Key
After checking your answers, be sure to fill in this short google form about the mock. I really
appreciate it! You can find the results of the form by clicking here.

Sources: ARML 2018 and HMMT Feb 2014 and Nov 2014

Answer Key for Mock:

1. 19
2. 50
3. 37
4. 51
5. 13
6. 20
7. 40
8. 35
9. 44
10. 19
11. 19
12. 4
13. 36
14. 2
15. 32
16. 26
17. 44
18. 22
19. 17
20. 44
21. 75
22. 23
23. 63
24. 11
25. 3
26. 60
27. 85
28. 36
29. 10
30. 5

1
MOMC IOQM Mock Donut 3 Answer Key
After checking your answers, be sure to fill in this short google form about the mock. I really
appreciate it! You can find the results of the form by clicking here.

Sources: CMIMC 2016 and PUMaC 2011

Answer Key for Mock:

1. 62
2. 51
3. 13
4. 93
5. 50
6. 20
7. 
28
 33 (Updated)
8. 75
9. 15
10. 2
11. 50
12. 37
13. 25
14. 31
15. 60
16. 38
17. 54
18. 25
19. 12
20. 370 (Bonus!)
21. 
47 5 (Updated)
22. 22
23. 78
24. 21
25. 59
26. 67
27. 18
28. 23
29. 20
30. 50

1
MOMC IOQM Mock Donut 2 Answer Key
After checking your answers, be sure to fill in this short google form about the mock. I will really
appreciate it! You can find the results of the form by clicking here.

Sources: HMMT Feb 2024 and BMT 2012

Answer Key for Mock:

1. 48
2. 37
3. 4
4. 17
5. 62
6. 19
7. 23
8. 56
9. 20
10. 43
11. 15
12. 43
13. 41
14. 114 (Bonus!)
15. 17
16. 68
17. 27
18. 16
19. 32
20. 15
21. 20
22. 9
23. 48
24. 18
25. 89
26. 23
27. 17
28. 12
29. 45
30. 36

1
MOMC IOQM Mock Donut 1 Answer Key
After checking your answers, be sure to fill in this short google form about the mock. I will really
appreciate it! You can find the results of the form by clicking here.

Sources: ARML 2024, HMMT Feb 2015 and BmMT 2023

Answer Key for Mock:

1. 50
2. 28
3. 21
4. 20
5. 64
6. 3
7. 46
8. 7
9. 28
10. 31
11. 2
12. 24
13. 2
14. 51
15. 47
16. 8
17. 8
18. 63
19. 80
20. 13
21. 86
22. 7
23. 8
24. 17
25. 19
26. 33
27. 83
28. 36
29. 127 (Bonus!)
30. 5

1
MOMC IOQM Mock Cake 2 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate it!

Source: ARML Local 2015 + HMMT February 2018 and 2019

Answer Key for Mock:

1. 43
2. 42
3. 5
4. 13
5. 50
6. 26
7. 21
8. 57
9. 9
10. 32
11. 46
12. 9
13. 10
14. 15
15. 56
16. 9
17. 2
18. 19
19. 25
20. 19
21. 7
22. 80
23. 17
24. 24
25. 51
26. 29
27. 89
28. 13
29. 16
30. 20

1
MOMC IOQM Mock Cake 1 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate it!

Source: ARML 2021 + ARML 2021 Local + BmMT 2013

Answer Key for Mock:

1. 17
2. 60
3. 32
4. 18
5. 48
6. 14
7. 80
8. 80
9. 5
10. 139 (Bonus!)
11. 18
12. 56
13. 24
14. 9
15. 4
16. 44
17. 19
18. 7
19. 25
20. 94
21. 12
22. 58
23. 56
24. 44
25. 27
26. 27
27. 84
28. 9
29. 83
30. 41

1
MOMC IOQM Mock Blueberry 4 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate it!

Source: HMMT 2021 and 2022 (Theme and Team Rounds) + BmMT 2018 and 2019

Answer Key for Mock:

1. 84
2. 20
3. 17
4. 8
5. 10
6. 13
7. 9
8. 53
9. 18
10. 16
11. 22
12. 64
13. 15
14. 50
15. 27
16. 6
17. 23
18. 62
19. 15
20. 4
21. 36
22. 57
23. 26
24. 51
25. 32
26. 44
27. 40
28. 99
29. 68
30. 29

1
MOMC IOQM Mock Blueberry 3 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate it!

Source: CMIMC 2021 and Purple Comet (Exact links in Blog)

Answer Key for Mock:

1. 75
2. 6
3. 29
4. 119 Intentional Bonus ;)
5. 18
6. 18
7. 16
8. 79
9. 53
10. 17
11. 17
12. 34
13. 63
14. 2
15. 46
16. 49
17. 18
18. 61
19. 25
20. 55
21. 81
22. 9
23. 78
24. 72
25. 20
26. 54
27. 64
28. 81
29. 82
30. 12

1
MOMC IOQM Mock Blueberry 2 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate it!

Source: CMIMC 2018, BMT 2022, AMC 8 2023

Answer Key for Mock:

1. 5
2. 35
3. 98
4. 12
5. 32
6. 80
7. 8
8. 15
9. 58
10. 32
11. 46
12. 11
13. 13
14. 20
15. 4
16. 5
17. 61
18. 44
19. 26
20. 32
21. 19
22. 71
23. 6
24. 74
25. 28
26. 21
27. 94
28. 32
29. 49
30. 21

1
MOMC IOQM Mock Blueberry 1 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate it!

Sources: CMC 2018 AMC 10 A and CMC 2020 ARML

Answer Key for Mock:

1. 65
2. 13
3. 8
4. 3
5. 15
6. 11
7. 4
8. 37
9. 47
10. 47
11. 53
12. 91
13. 81
14. 32
15. Bonus :)
16. 28
17. 19
18. 2
19. 24
20. 18
21. 97
22. 56
23. 41
24. 83
25. 25
26. 32
27. 19
28. 14
29. 45
30. 20

1
MOMC IOQM Mock Apple 4 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate
it!

Sources: CMIMC 2022 and HMMT 2008 Feb Guts Round

Answer Key for Mock:

1. 33
2. 6
3. 11
4. 15
5. 11
6. 21
7. 5
8. 33
9. 18
10. 32
11. 32
12. 23
13. 20
14. 85
15. 36
16. 10
17. 10
18. 40
19. 7
20. 14
21. 8
22. 97
23. 41
24. 95
25. 9
26. 97
27. 74
28. 49
29. 86
30. 35

1
MOMC IOQM Mock Apple 3 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate
it!

Sources: CHMMC 2014 and PUMaC 2018

Answer Key for Mock:

1. 14
2. 52
3. 8
4. 63
5. 5
6. 11
7. 55
8. 81
9. 109 - Intentional Bonus ;)
10. 7
11. 77
12. 34
13. 36
14. 47
15. 42
16. 52
17. 30
18. 17
19. 56
20. 69
21. 13
22. 26
23. 63
24. 33
25. 19
26. 6
27. 99
28. 88
29. 21
30. 83

1
MOMC IOQM Mock Apple 2 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate
it!

Sources: PuMaC 2019 and CHMMC 2013

Answer Key for Mock:

1. 42
2. 59
3. 5
4. 89
5. 51
6. 43
7. 42
8. 48
9. 61
10. 42
11. 42
12. 30
13. 8
14. 71
15. 14
16. 13
17. 1
18. 6
19. 8
20. 44
21. 31
22. 14
23. 49
24. 96
25. 9
26. 45
27. 6
28. 57
29. 16
30. 23

1
MOMC IOQM Mock Apple 1 Answer Key
After checking your answers, be sure to fill in this form about the mock. I will really appreciate
it!

Sources: CHMMC 2012 Spring, PuMaC 2020 and HMMT 2009 Feb Guts Round

Answer Key for Mock:

1. 34
2. 49
3. 24
4. 11
5. 36
6. 6
7. 3
8. 8
9. 15
10. 52
11. 6
12. 26
13. 17
14. 17
15. 19
16. 69
17. 94
18. 81
19. 22
20. 9
21. 56
22. 14
23. 21
24. 13
25. 75
26. 47
27. 13
28. 65
29. 31
30. 50

1
Answers for the Bonus Problems:

2-3 Markers:

1. 21
2. 6
3. 630
4. 139
5. 64

5 Markers:

1. 30
2. 3
3. 15
4. 520
5. 22
6. 10/11
7. 2
8. 1018
9. 497
10. 21056
11. 79200

You might also like