The Online Math Open Spring Contest

March 23 – April 3, 2018

 Acknowledgements

Tournament Director
• James Lin

Problem Authors
• Ankan Bhattacharya
• Vincent Huang
• Yang Liu
• Michael Ren
• Luke Robitaille
• Ashwin Sah
• Tristan Shin
• Edward Wan
• Brandon Wang
• Yannick Yao

Problem Contributors
• Zack Chroman
• Michael Kural
• Michael Ma

Website Manager
• Evan Chen
• Douglas Chen

LATEX/Python Geek
• Evan Chen
 Contest Information

These rules supersede any rules found elsewhere about the OMO. Please send any further questions directly
to the OMO Team at OnlineMathOpenTeam@gmail.com.

Team Registration and Eligibility

Students may compete in teams of up to four people, but no student can belong to more than one team.
Participants must not have graduated from high school (or the equivalent secondary school institution in
other countries). Teams need not remain the same between the Fall and Spring contests, and students are
permitted to participate in whichever contests they like.
Only one member on each team needs to register an account on the website. Please check the
website, http://internetolympiad.org/pages/14-omo_info, for registration instructions.
Note: when we say “up to four”, we really do mean “up to”! Because the time limit is so long, partial teams
are not significantly disadvantaged, and we welcome their participation.

Contest Format and Rules

The 2018 Spring Contest will consist of 30 problems; the answer to each problem will be an integer between
0 and 231 − 1 = 2147483647 inclusive. The contest window will be
March 23 – April 3, 2018
from 7PM ET on the start day to 7PM ET on the end day. There is no time limit other than the contest
window.

1. Four-function calculators (calculators which can perform only the four basic arithmetic operations)
are permitted on the Online Math Open. Any other computational aids, including scientific
calculators, graphing calculators, or computer programs is prohibited. All problems on the
Online Math Open are solvable without a calculator. Four-function calculators are permitted only to
help participants reduce computation errors.

2. Drawing aids such as graph paper, ruler, and compass are permitted. However, electronic drawing
aids, such as Geogebra and graphing calculators, are not allowed. Print and electronic publications are
also not allowed.
3. Members of different teams cannot communicate with each other about the contest while the contest
is running.

4. Your score is the number of questions answered correctly; that is, every problem is worth one point.
Ties will be broken based on the “hardest” problem that a team answered correctly. Remaining ties
will be broken by the second hardest problem solved, and so on. (Problem m is harder than problem
n if fewer teams solve problem m OR if the number of solves is equal and m > n.)

5. Participation in the Online Math Open is free.

Clarifications and Results

Clarifications will be posted as they are answered. For the most recent contests, they will be posted at
http://internetolympiad.org/pages/n/omo_problems. If you have a question about problem wording,
please email OnlineMathOpenTeam@gmail.com with “Clarification” in the subject. We have the right to deny
clarification requests that we feel we cannot answer.
After the contest is over, we will release the answers to the problems within the next day. Please do not
discuss the test until answers are released. If you have a protest about an answer, you may send an email
to OnlineMathOpenTeam@gmail.com. (Include “Protest” in the subject). Results will be released in the
following weeks. (Results will be counted only for teams that submit answers at least once. Teams that only
register an account will not be listed in the final rankings.)
 OMO Spring 2018
March 23 – April 3, 2018

1. Farmer James has three types of cows on his farm. A cow with zero legs is called a ground beef, a cow
with one leg is called a steak, and a cow with two legs is called a lean beef. Farmer James counts a
total of 20 cows and 18 legs on his farm. How many more ground beefs than lean beefs does Farmer
James have?
2. The area of a circle (in square inches) is numerically larger than its circumference (in inches). What
is the smallest possible integral area of the circle, in square inches?
3. Hen Hao randomly selects two distinct squares on a standard 8 × 8 chessboard. Given that the two
squares touch (at either a vertex or a side), the probability that the two squares are the same color
can be expressed in the form mn for relatively prime positive integers m and n. Find 100m + n.

4. Define f (x) = |x − 1|. Determine the number of real numbers x such that f (f (· · · f (f (x)) · · · )) = 0,
where there are 2018 f ’s in the equation.
5. A mouse has a wheel of cheese which is cut into 2018 slices. The mouse also has a 2019-sided die, with
faces labeled 0, 1, 2, . . . , 2018, and with each face equally likely to come up. Every second, the mouse
rolls the dice. If the dice lands on k, and the mouse has at least k slices of cheese remaining, then
the mouse eats k slices of cheese; otherwise, the mouse does nothing. What is the expected number of
seconds until all the cheese is gone?
6. Let f (x) = x2 + x for all real x. There exist √
positive integers m and n, and distinct nonzero real
numbers y and z, such that f (y) = f (z) = m + n and f ( y1 ) + f ( z1 ) = 10
1
. Compute 100m + n.

7. A quadrilateral and a pentagon (both not self-intersecting) intersect each other at N distinct points,
where N is a positive integer. What is the maximal possible value of N ?
 a

b

8. Compute the number of ordered quadruples (a, b, c, d) of distinct positive integers such that c =
d
21.
9. Let k be a positive integer. In the coordinate plane, circle ω has positive integer radius and is tangent
to both axes. Suppose that ω passes through (1, 1000 + k). Compute the smallest possible value of k.
10. The one hundred U.S. Senators are standing in a line in alphabetical order. Each senator either always
tells the truth or always lies. The ith person in line says;
“Of the 101 − i people who are not ahead of me in line (including myself), more than half of them are
truth-tellers.”
How many possibilities are there for the set of truth-tellers on the U.S. Senate?
11. Lunasa, Merlin, and Lyrica are performing in a concert. Each of them will perform two different solos,
and each pair of them will perform a duet, for nine distinct pieces in total. Since the performances are
very demanding, no one is allowed to perform in two pieces in a row. In how many different ways can
the pieces be arranged in this concert?
12. Near the end of a game of Fish, Celia is playing against a team consisting of Alice and Betsy. Each of
the three players holds two cards in their hand, and together they have the Nine, Ten, Jack, Queen,
King, and Ace of Spades (this set of cards is known by all three players). Besides the two cards she
already has, each of them has no information regarding the other two’s hands (In particular, teammates
Alice and Betsy do not know each other’s cards).
It is currently Celia’s turn. On a player’s turn, the player must ask a player on the other team whether
she has a certain card that is in the set of six cards but not in the asker’s hand. If the player being
asked does indeed have the card, then she must reveal the card and put it in the askeras hand, and the
asker shall ask again (but may ask a different player on the other team); otherwise, she refuses and it
is now her turn. Moreover, a card may not be asked if it is known (to the asker) to be not in the asked
person’s hand. The game ends when all six cards belong to one team, and the team with all the cards
wins. Under optimal play, the probability that Celia wins the game is pq for relatively prime positive
integers p and q. Find 100p + q.

1
 OMO Spring 2018
March 23 – April 3, 2018

13. Find the smallest positive integer n for which the polynomial

xn − xn−1 − xn−2 − · · · − x − 1

has a real root greater than 1.999.

14. Let ABC be a triangle with AB = 20 and AC = 18. E is on segment AC and F is on segment AB √ such
that AE = AF = 8. Let BE and CF intersect at G. Given that AEGF is cyclic, then BC = m n for
positive integers m and n such that n is not divisible by the square of any prime. Compute 100m + n.

15. Let N denote the set of positive integers. For how many positive integers k ≤ 2018 do there exist a
function f : N → N such that f (f (n)) = 2n for all n ∈ N and f (k) = 2018?
16. In a rectangular 57 × 57 grid of cells, k of the cells are colored black. What is the smallest positive
integer k such that there must exist a rectangle, with sides parallel to the edges of the grid, that has
its four vertices at the center of distinct black cells?

17. Let S be the set of all subsets of {2, 3, . . . , 2016} with size 1007, and for a nonempty set T of numbers,
let f (T ) be the product of the elements in T . Determine the remainder when
X
2
f (T ) − f (T )−1
T ∈S

is divided by 2017. Note: For b relatively prime to 2017, we say that b−1 is the unique positive integer
less than 2017 for which 2017 divides bb−1 − 1.
18. Suppose that a, b, c are real numbers such that a < b < c and a3 − 3a + 1 = b3 − 3b + 1 = c3 − 3c + 1 = 0.
Then a21+b + b21+c + c21+a can be written as pq for relatively prime positive integers p and q. Find
100p + q.
19. Let P (x) be a polynomial of degree at most 2018 such that P (i) = 2018


i for all integer i such that
0 ≤ i ≤ 2018. Find the largest nonnegative integer n such that 2n | P (2020).
20. Let ABC be a triangle with AB = 7, BC = 5, and CA = 6. Let D be a variable point on segment BC,
and let the perpendicular bisector of AD meet segments AC, AB at E, F, respectively. It is given that
there is a point P inside 4ABC such that PAP AE AP
C = EC and P B = Fq
AF
B . The length of the path traced by

−1
pm 1
P as D varies along segment BC can be expressed as n sin 7 , where m and n are relatively
prime positive integers, and angles are measured in radians. Compute 100m + n.
L N
21. Let and be two binary boolean operators, i.e.Lfunctions
N that sendL {True,
NFalse} × {True, False}
to {True, False}. Find the number of such pairs ( , ) such that and distribute over each
other, that is, for any three boolean values a, b, c, the following four equations hold:
N L N L N
(a) c (a b) = (c a) (c b);
L N N L N
(b) (a b) c = (a c) (b c);
L N L N L
(c) c (a b) = (c a) (c b);
N L L N L
(d) (a b) c = (a c) (b c).

22. Let p = 9001 be a prime number and let Z/pZ denote the additive group of integers modulo p.
Furthermore, if A, B ⊂ Z/pZ, then denote A + B = {a + b (mod p)|a ∈ A, b ∈ B}. Let s1 , s2 , . . . , s8
are positive integers that are at least 2. Yang the Sheep notices that no matter how he chooses sets
T1 , T2 , . . . , T8 ⊂ Z/pZ such that |Ti | = si for 1 ≤ i ≤ 8, T1 + T2 + · · · + T7 is never equal to Z/pZ, but
T1 + T2 + · · · + T8 must always be exactly Z/pZ. What is the minimum possible value of s8 ?

2
 OMO Spring 2018
March 23 – April 3, 2018

23. Let ABC be a triangle with BC = 13, CA = 11, AB = 10. Let A1 be the midpoint of BC. A variable
line ` passes through A1 and meets AC, AB at B1 , C1 . Let B2 , C2 be points with B2 B = B2 C, B2 C1 ⊥
AB, C2 B = C2 C, C2 B1 ⊥ AC, and define P = BB2 ∩ CC2 . Suppose the circles of diameters BB2 , CC2
meet at a point Q 6= A1 . Given that Q lies on the same
√ side of line BC as A, the minimum possible
PB QB a b
value of + can be expressed in the form for positive integers a, b, c with gcd(a, c) = 1
PC QC c
and b squarefree. Determine a + b + c.

24. Find the number of ordered triples (a, b, c) of integers satisfying 0 ≤ a, b, c ≤ 1000 for which

a3 + b3 + c3 ≡ 3abc + 1 (mod 1001).

25. Let m and n be positive integers. Fuming Zeng gives James a rectangle, such that m − 1 lines are
drawn parallel to one pair of sides and n − 1 lines are drawn parallel to the other pair of sides (with
each line distinct and intersecting the interior of the rectangle), thus dividing the rectangle into an
m × n grid of smaller rectangles. Fuming Zeng chooses m + n −  1 of the mnsmaller rectangles and
mn
then tells James the area of each of the smaller rectangles. Of the possible combinations
m+n−1
of rectangles and their areas Fuming Zeng could have given, let Cm,n be the number of combinations
which would allow James to determine the area of the whole rectangle. Given that

∞ X ∞
Cm,n m+n


X
m
A= ,
m=1 n=1
(m + n)m+n

then find the greatest integer less than 1000A.

26. Let ABC be a triangle with incenter I. Let P and Q be points such that IP ⊥ AC, IQ ⊥ AB, and
IA ⊥ P Q. Assume that BP and CQ intersect at the point R 6= A on the circumcircle of ABC such √
that AR k BC. Given that ∠B − ∠C = 36◦ , the value of cos A can be expressed in the form m−p n
for positive integers m, n, p and where n is not divisible by the square of any prime. Find the value of
100m + 10n + p.
27. Let n = 22018 and let S = {1, 2, ..., n}. For subsets S1 , S2 , ..., Sn ⊆ S, we call an ordered pair (i, j)
murine if and only if {i, j} is a subset of at least one of Si , Sj . Then, a sequence of subsets (S1 , . . . , Sn )
of S is called tasty if and only if:

(a) For all i, i ∈ Si .

[
(b) For all i, Sj = Si .
j∈Si

(c) There do not exist pairwise distinct integers a1 , a2 , ..., ak with k ≥ 3 such that for each i, (ai , ai+1 )
is murine, where indices are taken modulo k.
(d) n divides 1 + |S1 | + |S2 | + ... + |Sn |.

Find the largest integer x such that 2x divides the number of tasty sequences (S1 , . . . , Sn ).
28. In 4ABC, the incircle ω has center I and is tangent to CA and AB at E and F respectively. The
circumcircle of 4BIC meets ω at P and Q. Lines AI and BC meet at D, and the circumcircle of
4P DQ meets BC again at X. Suppose that EF = P Q = 16 and P X + QX = 17. Then BC 2 can be
expressed as mn , where m and n are relatively prime positive integers. Find 100m + n.

29. Let q < 50 be a prime number. Call a sequence of polynomials P0 (x), P1 (x), P2 (x), ..., Pq2 (x) tasty if
it satisfies the following conditions:
• Pi has degree i for each i (where we consider constant polynomials, including the 0 polynomial,
to have degree 0)

3
 OMO Spring 2018
March 23 – April 3, 2018

• The coefficients of Pi are integers between 0 and q − 1 for each i.

• For any 0 ≤ i, j ≤ q 2 , the polynomial Pi (Pj (x)) − Pj (Pi (x)) has all its coefficients divisible by q.
As q varies over all such prime numbers, determine the total number of tasty sequences of polynomials.
30. Let p = 2017. Given a positive integer n, an n × n matrix A is formed with each element aij randomly
selected, with equal probability, from {0, 1, ..., p − 1}. Let qn be probability that det A ≡ 1 (mod p).
Let q = lim qn . If d1 , d2 , d3 , . . . are the digits after the decimal point in the base p expansion of q,
n→∞
2
p
X
then compute the remainder when dk is divided by 109 .
k=1