The Online Math Open Fall Contest

November 6 17, 2015

Acknowledgements
Head Problem Authors
Yang Liu (Chief of Problems)
Ashwin Sah
Yannick Yao

Problem Contributors
Evan Chen
Michael Kural
James Lin
Michael Ma

Website Manager
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 [email protected].

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 2015 Fall 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
November 6 17, 2015
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 [email protected] 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 [email protected]. (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 Fall 2015

November 6 17, 2015
1. Evalute

s       
8
9
15
16
+
+
+
.
2
2
2
2

2. At a national math contest, students are being housed in single rooms and double rooms; it is known
that 75% of the students are housed in double rooms. What percentage of the rooms occupied are
double rooms?
3. How many integers between 123 and 321 inclusive have exactly two digits that are 2?
4. Let be a circle with diameter AB and center O. We draw a circle A through O and A, and another
circle B through O and B; the circles A and B intersect
at a point C distinct from O. Assume

that all three circles , A , B are congruent. If CO = 3, what is the perimeter of 4ABC?
5. Merlin wants to buy a magical box, which happens to be an n-dimensional hypercube with side length
1 cm. The box needs to be large enough to fit his wand, which is 25.6 cm long. What is the minimal
possible value of n?
6. Farmer John has a (flexible) fence of length L and two straight walls that intersect at a corner perpendicular to each other. He knows that if he doesnt use any walls, he can enclose a maximum possible
area of A0 , and when he uses one of the walls or both walls, he gets a maximum area of A1 and A2
A2
1
respectively. If n = A
A0 + A1 , find b1000nc.
7. Define sequence {an } as following: a0 = 0, a1 = 1, and ai = 2ai1 ai2 + 2 for all i 2. Determine
the value of a1000 .
8. The two numbers 0 and 1 are initially written in a row on a chalkboard. Every minute thereafter,
Denys writes the number a + b between all pairs of consecutive numbers a, b on the board. How many
odd numbers will be on the board after 10 such operations?
9. Let s1 , s2 , . . . be an arithmetic progression of positive integers. Suppose that
ss1 = x + 2,

ss2 = x2 + 18,

and ss3 = 2x2 + 18.

Determine the value of x.

10. For any positive integer n, define a function f by
f (n) = 2n + 1 2blog2 nc+1 .
Let f m denote the function f applied m times.. Determine the number of integers n between 1 and
65535 inclusive such that f n (n) = f 2015 (2015).
11. A trapezoid ABCD lies on the xy-plane. The slopes of lines BC and AD are both 31 , and the slope of
line AB is 23 . Given that AB = CD and BC < AD, the absolute value of the slope of line CD can
be expressed as m
n , where m, n are two relatively prime positive integers. Find 100m + n.
12. Let a, b, c be the distinct roots of the polynomial P (x) = x3 10x2 + x 2015. The cubic polynomial
Q(x) is monic and has distinct roots bc a2 , ca b2 , ab c2 . What is the sum of the coefficients of
Q?
13. You live in an economy where all coins are of value 1/k for some positive integer k (i.e. 1, 1/2, 1/3, . . . ).
You just recently bought a coin exchanging machine, called the Cape Town Machine. For any integer
n > 1, this machine can take in n of your coins of the same value, and return a coin of value equal to
the sum of values of those coins (provided the coin returned is part of the economy). Given that the
product of coins values that you have is 20151000 , what is the maximum number of times you can use
the machine over all possible starting sets of coins?

OMO Fall 2015

November 6 17, 2015
14. Let a1 , a2 , . . . , a2015 be a sequence of positive integers in [1, 100]. Call a nonempty contiguous
subsequence of this sequence good if the product of the integers in it leaves a remainder of 1 when
divided by 101. In other words, it is a pair of integers (x, y) such that 1 x y 2015 and
ax ax+1 . . . ay1 ay 1

(mod 101).

Find the minimum possible number of good subsequences across all possible (ai ).
15. A regular 2015-simplex P has 2016 vertices in 2015-dimensional space such that the distances between
every pair of vertices are equal. Let S be the set of points contained inside P that are closer to its
center than any of its vertices. The ratio of the volume of S to the volume of P is m
n , where m and n
are relatively prime positive integers. Find the remainder when m + n is divided by 1000.
16. Given a (nondegenerate) triangle ABC with positive integer angles (in degrees), construct squares
BCD1 D2 , ACE1 E2 outside the triangle. Given that D1 , D2 , E1 , E2 all lie on a circle, how many
ordered triples (A, B, C) are possible?
17. Let x1 . . . , x42 be real numbers such that 5xi+1 xi 3xi xi+1 = 1 for each 1 i 42, with x1 = x43 .
Find the product of all possible values for x1 + x2 + + x42 .
18. Given an integer n, an integer 1 a n is called n-well if


n
= a.
bn/ac
Let f (n) be the number of n-well numbers, for each integer n 1. Compute f (1)+f (2)+. . .+f (9999).
19. For any set S, let P (S) be its power set, the set of all of its subsets. Over all sets A of 2015 arbitrary
finite sets, let N be the maximum possible number of ordered pairs (S, T ) such that S P (A), T
P (P (A)), S T , and S T . (Note that by convention, a set may never contain itself.) Find the
remainder when N is divided by 1000.
20. Amandine and Brennon play a turn-based game, with Amadine starting. On their turn, a player must
select a positive integer which cannot be represented as a sum of nonnegative multiples of any of the
previously selected numbers. For example, if 3, 5 have been selected so far, only 1, 2, 4, 7 are available
to be picked; if only 3 has been selected so far, all numbers not divisible by three are eligible. A player
loses immediately if they select the integer 1.
Call a number n feminist if gcd(n, 6) = 1 and if Amandine wins if she starts with n. Compute the sum
of the feminist numbers less than 40.
21. Toner Drum and Celery Hilton are both running for president. A total of 2015 people cast their vote,
giving 60% to Toner Drum. Let N be the number of representative sets of the 2015 voters that could
have been polled to correctly predict the winner of the election (i.e. more people in the set voted for
Drum than Hilton). Compute the remainder when N is divided by 2017.
22. Let W = . . . x1 x0 x1 x2 . . . be an infinite periodic word consisting of only the letters a and b. The
minimal period of W is 22016 . Say that a word U appears in W if there are indices k ` such that
U = xk xk+1 . . . x` . A word U is called special if U a, U b, aU, bU all appear in W . (The empty word is
considered special) You are given that there are no special words of length greater than 2015.
Let N be the minimum possible number of special words. Find the remainder when N is divided by
1000.
23. Let p = 2017, a prime number. Let N be the number of ordered triples (a, b, c) of integers such that
1 a, b p(p 1) and ab ba = p c. Find the remainder when N is divided by 1000000.
24. Let ABC be an acute triangle with incenter I; ray AI meets the circumcircle of ABC at M 6= A.
Suppose T lies on line BC such that M IT = 90 . Let K be the foot of the altitude from I to T M .
77
BK
m
Given that sin B = 55
73 and sin C = 85 , and CK = n in lowest terms, compute m + n.
2

OMO Fall 2015

November 6 17, 2015
25. Define kA Bk = (xA xB )2 + (yA yB )2 for every two points A = (xA , yA ) and B = (xB , yB ) in the
plane. Let S be the set of points (x, y) in the plane for which x, y {0, 1, . . . , 100}. Find the number
of functions f : S S such that kA Bk kf (A) f (B)k (mod 101) for any A, B S.
26. Let ABC be a triangle with AB = 72, AC = 98, BC = 110, and circumcircle , and let M be the
midpoint of arc BC not containing A on . Let A0 be the reflection of A over BC, and suppose M B
meets AC at D, while M C meets AB at E. If M A0 meets DE at F , find the distance from F to the
center of .


27. For integers
0 m, n 64, let (m, n) be the number of nonnegative integers k for which m/2k and

n/2k are both odd integers. Consider a 65 65 matrix M whose (i, j)th entry (for 1 i, j 65) is
(1)(i1,j1) .
Compute the unique integer 0 r < 1000 such that det M r (mod 1000).
28. Let N be the number of 2015-tuples of (not necessarily distinct) subsets (S1 , S2 , . . . , S2015 ) of {1, 2, . . . , 2015}
such that the number of permutations of {1, 2, . . . , 2015} satisfying (i) Si for all 1 i 2015 is
odd. Let k2 , k3 be the largest integers such that 2k2 |N and 3k3 |N respectively. Find k2 + k3 .
29. Given vectors v1 , . . . , vn and the string v1 v2 . . . vn , we consider valid expressions formed by inserting
n 1 sets of balanced parentheses and n 1 binary products, such that every product is surrounded
by a parentheses and is one of the following forms:
A normal product ab, which takes a pair of scalars and returns a scalar, or takes a scalar and
vector (in any order) and returns a vector.
A dot product a b, which takes in two vectors and returns a scalar.
A cross product a b, which takes in two vectors and returns a vector.
An example of a valid expression when n = 5 is (((v1 v2 )v3 ) (v4 v5 )), whose final output is a scalar.
An example of an invalid expression is (((v1 (v2 v3 )) (v4 v5 )); even though every product is
surrounded by parentheses, in the last step one tries to take the cross product of a vector and a scalar.
Denote by Tn the number of valid expressions (with T1 = 1), and let Rn denote the remainder when
Tn is divided by 4. Compute R1 + R2 + R3 + . . . + R1,000,000 .
30. Ryan is learning number theory. He reads about the M
obius function : N Z, defined by (1) = 1
and
X
(n) =
(d)
d|n
d6=n

for n > 1 (here N is the set of positive integers). However, Ryan doesnt like negative numbers, so he
invents his own function: the dubious function : N N, defined by the relations (1) = 1 and
X
(n) =
(d)
d|n
d6=n

for n > 1. Help Ryan determine the value of 1000p + q, where p, q are relatively prime positive integers
satisfying

p X (15k )
=
.
q
15k
k=0