Selected Proposed Problems
Selected Proposed Problems
Selected Proposed Problems
Krit Boonsiriseth
1 “Official” contests
Problem 1 (ELMO 2018 P2).
Consider infinite sequences a1 , a2 , . . . of positive integers satisfying a1 = 1 and
an | ak + ak+1 + · · · + ak+n−1
for all positive integers k and n. For a given positive integer m, find the maximum possible
value of a2m .
Problem 2 (ELMO 2018 Shortlist C2).
We say that a positive integer n is m-expressible if it is possible to get n from some m digits
and the six operations +, −, ×, ÷, exponentiation ∧ , and concatenation ⊕. For example, 5625
is 3-expressible (in two ways): both 5 ⊕ (5∧ 4) and (7 ⊕ 5)∧ 2 yield 5625.
Does there exist a positive integer N such that all positive integers with N digits are (N −1)-
expressible?
Problem 3 (Thailand IMO Camp 2016, Ashes 2018 P2).
Determine all functions f : N0 → N0 such that
· · · |x| − y − x · · · − y − x = · · · |y| − x − y · · · − x − y
where there are 2019 absolute value signs | · | on each side. Determine, with proof, all possible
values of xy .
1
Problem 5 (HMIC 2020/5).
A triangle and a circle are in the same plane. Show that the area of the intersection of the
triangle and the circle is at most one third of the area of the triangle plus one half of the area
of the circle.
2 InfinityDots MO
Problem 6 (Posted as a sample for InfinityDots MO).
Let S be a set of n positive integers, and f a bijection on S. Show that
X √
f i (i) > 2n − 2n.
i∈S
x, P (x), P (P (x)), . . .
is bounded. Show that if every orbiting number is rational then there are finitely many (or
zero) orbiting numbers.
Problem 10 (InfinityDots MO 2 P2).
Determine all bijections f : Z → Z satisfying
2
Let c1 , c2 , . . . , ck be integers. Consider sequences {an } of integers satisfying
for all n > k +1. Prove that there is a choice of initial terms a1 , a2 , . . . , ak not all zero satisfying:
there is an integer b such that p divides ap − b for all primes p.
Problem 12 (InfinityDots MO 2 P6).
Ana has an n × n lattice grid of points, and Banana has some positive integers a1 , a2 , . . . , ak
which sum to exactly n2 . Banana challenges Ana to partition the n2 points in the lattice grid
into sets S1 , S2 , . . . , Sk so that for all i ∈ {1, 2, . . . , k},
(ii) add an integer k to both elements in the Pythagorean so that it is still a Pythagorean.
Show that starting from each Pythagorean, it is possible to reach any Pythagorean in a finite
number of moves.
Problem 14 (InfinityDots MO 3 P2).
Let a1 , a2 , a3 , . . . be a nonincreasing sequence of positive real numbers such that
Show that there exist infinitely many positive integers m such that
3
Problem 16 (InfinityDots MO 3 P5).
Is there a nonempty finite set S of points on the plane that form at least |S|2 harmonic quadri-
laterals?
Note: a quadrilateral ABCD is harmonic if it is cyclic and AB · CD = BC · DA.
Problem 17 (InfinityDots JMO P2).
Find all pairs (a, b) of positive integers such that (a + 1)b−1 + (a − 1)b+1 = 2ab .
Problem 18 (InfinityDots JMO P3).
There is a calculator with a display and two buttons: −1/x and x + 1. The display is capable
of displaying precisely any arbitrary rational numbers. The buttons, when pressed, will change
the value x displayed to the value of the term on the button. (The −1/x button cannot be
pressed when x = 0.)
At first, the calculator displays 0. You accidentally drop the calculator on the floor, resulting
in the two buttons being pressed a total of N times in some order. Prove that you can press
the buttons at most 3N times to get the display to show 0 again.
Note: partial credit will be given for showing a bound of cN for a constant c > 3.
Problem 19 (InfinityDots JMO P6).
Determine all positive reals r such that, for any triangle ABC, we can choose points D, E, F
trisecting the perimeter of the triangle into three equal-length sections so that the area of
4DEF is exactly r times that of 4ABC.
3 Miscellaneous
Problem 20 (for a high school competition in Thailand; probably well-known though).
Alice throws a fair coin repeatedly until the difference between the number of heads and the
number of tails is exactly 4. What is the expected number of throws Alice made?
Problem 21 (for a high school competition in Thailand).
Define a sequence of integers {an } by a1 = 0, a2 = 1 and
1 1 1 1
Also, for every positive integer n let Sn = 11n + 12n + 13n + ··· + 30n
Evaluate ∞
P
n=1 an Sn .
Problem 22 (“Magic Wheels”, written for a high school competition in Thailand; crudely
translated).
A crazy physicist discovered a type of matter called the abc-wheels. An abc-wheel consists of
some constituent abc-particles, simply denoted by a, b or c, arranged in a circle without two
consecutive particles of the same type. In the laboratory the physicist found that, when left
alone, the abc-wheel will undergo a transformation consisting of three steps:
• Between each pair of constituent particles, a new particle different from both particles in
4
the pair will spawn.
• Consecutive new particles that are of the same type combines into one.
b a c a
c a
b c c
a b
b a b
c c a
b a
a b c c
Before transformation → After the second step → After transformation
Knowing this transformative property of abc-wheels, the physicist determined that certain
abc-wheels will eventually collapse into a single abc-particle; these are dubbed magic wheels.
5
1. Determine whether each of these abc-wheels are magic wheels.
a a a a b a c
b c b c b c a b
a a c c b c
c b c a
b b a b c b
a a b b
c c c a a a
b c c a a b c
(a) [2 pt] (b) [2 pt] (c) [3 pt] (d) [3 pt] (e) [3 pt]
After many experiments with abc-wheels, the physicist wanted to know how many abc-wheels
are magic wheels. Let {xn } denote the number of magic wheels with n constituent particles.
Note: two abc-wheels are considered the same if it is possible to rotate one to create the other,
but reflection is not allowed.
3. (a) [7 pt] Determine the remainder left when x2018 is divided by 2018.
(b) [12 pt] Determine the remainder left when x5122 is divided by 2561.
4. [8 pt] Estimate log10 x2018 . Points will be awarded if the estimation is correct to ±5%.