INMO Mock 2
INMO Mock 2
INMO Mock 2
Sophie Fellowship
November 13, 2022
1. There are m ⩾ 3 positive integers, not necessarily distinct, that are arranged in a
circle so that any positive integer divides the sum of its neighbors. Show that if there
is exactly one 1, then for any positive integer n, there are at most ϕ(n) copies of n.
2. Let O and H be the circumcenter and orthocenter of ABC. Given points D, E on seg-
ments AB, AC and H ′ , O′ the orthocenter and circumcenter of ADE. Prove that
HH ′ ∥ OO′ ⇐⇒ BD = CE
1 1 1 1
+ + ··· + ⩽ 1 − n−1
lcm(a1 , a2 ) lcm(a2 , a3 ) lcm(an−1 , an ) 2
f (x) + f (f (x)) = x + k
for all x ∈ N?
5. A game begins with a pile of n stones. Alice and Bob take turns removing either 1
stone or one half (rounded down) of the stones from the pile, with Alice taking the
first turn. The player who leaves exactly one stone at the end of their turn wins the
game. Who has the winning strategy?
6. Find all composite numbers n such that for every pair of positive integers x, y with
product n, we have that x + y is a power of two.