Good luck!!

Problem Sets By Agamjeet Singh

 CONTENTS I

Contents

Contents I

1 Before INMO 1
1 Combi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
2 Geo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
3 FE and Ineq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
4 Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
5 NT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2 APMO Practice Set 4

1 Combinatorics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2 Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.1 FE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2 Ineq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3 Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
4 Number Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
 Geo 1

Chapter 1

Before INMO

~1 Combi

Problem 1.1 (EGMO 2017). Let n ≥ 1 be an integer and let t1 < t2 < · · · < tn be positive integers. In
a group of tn + 1 people, some games of chess are played. Two people can play each other at most
once. Prove that it is possible for the following two conditions to hold at the same time:
(i) The number of games played by each person is one of t1 , t2 , . . . , tn .
(ii) For every i with 1 ≤ i ≤ n, there is someone who has played exactly ti games of chess.
Problem 1.2 (EGMO 2016). Let k and n be integers such that k ≥ 2 and k ≤ n ≤ 2k − 1. Place
rectangular tiles, each of size 1 × k, or k × 1 on a n × n chessboard so that each tile covers exactly k
cells and no two tiles overlap. Do this until no further tile can be placed in this way. For each such
k and n, determine the minimum number of tiles that such an arrangement may contain.

~2 Geo

Problem 2.1 (EGMO 2018). Let ABC be a triangle with CA = CB and ∠ACB = 120◦ , and let M be
the midpoint of AB. Let P be a variable point of the circumcircle of ABC, and let Q be the point
on the segment CP such that QP = 2QC. It is given that the line through P and perpendicular to
AB intersects the line M Q at a unique point N . Prove that there exists a fixed circle such that N
lies on this circle for all possible positions of P .
Problem 2.2 (Some USA TSTST). Let ABC be a triangle. Its excircles touch sides BC, CA, AB at
D, E, F , respectively. Prove that the perimeter of triangle ABC is at most twice that of triangle
DEF .
Problem 2.3. Triangle ABC is inscribed in circle ω. A circle with chord BC intersects segments
 FE and Ineq 2

AB and AC again at S and R, respectively. Segments BR and CS meet at L, and rays LR and LS
intersect ω at D and E, respectively. The internal angle bisector of ∠BDE meets line ER at K.
Prove that if BE = BR, then ∠ELK = 21 ∠BCD.
Problem 2.4 (EGMO 2016). Let ABCD be a cyclic quadrilateral, and let diagonals AC and BD
intersect at X.Let C1 , D1 and M be the midpoints of segments CX, DX and CD, respecctively.
Lines AD1 and BC1 intersect at Y , and line M Y intersects diagonals AC and BD at different points
E and F , respectively. Prove that line XY is tangent to the circle through E, F and X.

~3 FE and Ineq

Problem 3.1 (EGMO 2021). Find all functions f : Q → Q such that the equation

f (xf (x) + y) = f (y) + x2

holds for all rational numbers x and y.

Problem 3.2. Let n be a positive integer. Given is a subset A of {0, 1, ..., 5n } with 4n + 2 elements.
Prove that there exist three elements a < b < c from A such that c + 2a > 3b
Problem 3.3. Let u1 , u2 , . . . , u2019 be real numbers satisfying

u1 + u2 + · · · + u2019 = 0 and u21 + u22 + · · · + u22019 = 1.

Let a = min (u1 , u2 , . . . , u2019 ) and b = max (u1 , u2 , . . . , u2019 ). Prove that
1
ab ⩽ − .
2019
Problem 3.4. Suppose that a, b, c, d are positive real numbers satisfying (a + c)(b + d) = ac + bd.
Find the smallest possible value of
a b c d
+ + + .
b c d a
Problem 3.5 (2013 A3). Let Q>0 be the set of all positive rational numbers. Let f : Q>0 → R be a
function satisfying the following three conditions:
(i) for all x, y ∈ Q>0 , we have f (x)f (y) ≥ f (xy);
(ii) for all x, y ∈ Q>0 , we have f (x + y) ≥ f (x) + f (y);
(iii) there exists a rational number a > 1 such that f (a) = a.
Prove that f (x) = x for all x ∈ Q>0 .
Problem 3.6. Find all triples (a, b, c) of real numbers such that ab + bc + ca = 1 and

a2 b + c = b2 c + a = c2 a + b.
 NT 3

~4 Sequences

Problem 4.1 (2014 A1). Let a0 < a1 < a2 . . . be an infinite sequence of positive integers. Prove that
there exists a unique integer n ≥ 1 such that
a0 + a1 + a2 + · · · + an
an < ≤ an+1 .
n
Problem 4.2 (2013 A1). Let n be a positive integer and let a1 , . . . , an−1 be arbitrary real numbers.
Define the sequences u0 , . . . , un and v0 , . . . , vn inductively by u0 = u1 = v0 = v1 = 1, and uk+1 =
uk + ak uk−1 , vk+1 = vk + an−k vk−1 for k = 1, . . . , n − 1.
Prove that un = vn .
Problem 4.3 (EGMO 2022). Given a positive integer n ≥ 2, determine the largest positive integer
N for which there exist N + 1 real numbers a0 , a1 , . . . , aN such that (1) a0 + a1 = − n1 , and (2)
(ak + ak−1 )(ak + ak+1 ) = ak−1 − ak+1 for 1 ≤ k ≤ N − 1.

~5 NT

Problem 5.1 (EGMO 2022). Let N = {1, 2, 3, . . . } be the set of all positive integers. Find all functions
f : N → N such that for any positive integers a and b, the following two conditions hold: (1)
f (ab) = f (a)f (b), and (2) at least two of the numbers f (a), f (b), and f (a + b) are equal.
Problem 5.2 (EGMO 2020). The positive integers a0 , a1 , a2 , . . . , a3030 satisfy

2an+2 = an+1 + 4an for n = 0, 1, 2, . . . , 3028.

Prove that at least one of the numbers a0 , a1 , a2 , . . . , a3030 is divisible by 22020 .

Problem 5.3 (EGMO 2015). Determine whether there exists an infinite sequence a1 , a2 , a3 , . . . of
positive integers which satisfies the equality
√
an+2 = an+1 + an+1 + an

for every positive integer n.

 Combinatorics 4

Chapter 2

APMO Practice Set

~1 Combinatorics

Problem 1.1 (India EGMO TST 2023). Let k be a positive integer. A sequence of integers a1 , a2 , · · · is
called k-pop if the following holds: for every n ∈ N, an is equal to the number of distinct elements in
the set {a1 , · · · , an+k }. Determine, as a function of k, how many k-pop sequences there are.
Problem 1.2 (APMO 2020 P3). Determine all positive integers k for which there exist a positive
integer m and a set S of positive integers such that any integer n > m can be written as a sum of
distinct elements of S in exactly k ways.
Problem 1.3 (APMO 2017 P3). Let A(n) denote the number of sequences a1 ≥ a2 ≥ · · · ≥ ak of positive
integers for which a1 + · · · + ak = n and each ai + 1 is a power of two (i = 1, 2, · · · , k). Let B(n)
denote the number of sequences b1 ≥ b2 ≥ · · · ≥ bm of positive integers for which b1 + · · · + bm = n
and each inequality bj ≥ 2bj+1 holds (j = 1, 2, · · · , m − 1). Prove that A(n) = B(n) for every positive
integer n.
Problem 1.4 (EGMO 2015 P2). A domino is a 2 × 1 or 1 × 2 tile. Determine in how many ways exactly
n2 dominoes can be placed without overlapping on a 2n × 2n chessboard so that every 2 × 2 square
contains at least two uncovered unit squares which lie in the same row or column.
Problem 1.5 (ISL 2007 C1). Let n ≥ 1 be an integer. Find all sequences a1 , a2 , . . . an2 +n consisting of
0 and 1 such that

ai+1 + ai+2 + . . . + ai+n < ai+n+1 + ai+n+2 + . . . + ai+2n

for all 0 ≤ i ≤ n2 − n.
Problem 1.6 (JMO 2013 P2). Each cell of an m × n board is filled with some nonnegative integer. Two
numbers in the filling are said to be adjacent if their cells share a common side. The filling is called
a garden if it satisfies the following two conditions:
(i) The difference between any two adjacent numbers is either 0 or 1 . (ii) If a number is less than or
 Combinatorics 5

equal to all of its adjacent numbers, then it is equal to 0 . Determine the number of distinct gardens
in terms of m and n.
Problem 1.7 (Pranjal INMO PSet). There are n2 lights of some n colours (not necessarily n of each
colour). Prove that they can be arranged on n christmas trees with n lights per christmas tree, such
that no tree has lights of three or more different types.
Problem 1.8 (JBMO SL 2018 C3). Alice and Bob play a game. First Alice paints n of the cells in red.
Then Bob chooses 4 rows and 4 columns from the table and paints all cells in them in black. Alice
wins if there is at least one red cell left. Find the least value of n such that Alice can win the game
no matter how Bob plays.
Problem 1.9 (Russia 2015 11.5). Kelvin the Frog jumps along the coordinate line landing at integer
points. It starts from point 0 ; its first jump has length 3 , the second one has length 5 , the third
one has length 9 , and so on (the k th jump has length 2k + 1 ). The direction of each jump is chosen
by Kelvin. Is it possible that Kelvin eventually visits all points with positive integer coordinates at
least once?
 Algebra 6

~2 Algebra

Problem 2.1 (APMO 2021 P1). Prove that for each real number r > 2, there are exactly two or three
positive real numbers x satisfying the equation x2 = r⌊x⌋.

~2.1 FE

Problem 2.2. Let f : N → N be a function such that f (1) = 1 and

f (n) = n − f (f (n − 1)), ∀n ≥ 2.
Prove that f (n + f (n)) = n for each positive integer n.
Problem 2.3 (India EGMO TST 2023). Let f, g be functions R → R such that for all reals x, y,
f (g(x) + y) = g(x + y)
Prove that either f is the identity function or g is periodic.
Problem 2.4 (ISL 2017 A3). Let S be a finite set, and let A be the set of all functions from S to S. Let
f be an element of A, and let T = f (S) be the image of S under f . Suppose that f ◦ g ◦ f ̸= g ◦ f ◦ g
for every g in A with g ̸= f . Show that f (T ) = T .
Problem 2.5 (IMO 1977 P6). The function f : Z>0 → Z>0 satisfies
f (n + 1) > f (f (n))
for every positive integer n. Show that f is the identity.
Problem 2.6 (EGMO 2021 P2). Find all functions f : Q → Q such that the equation
f (xf (x) + y) = f (y) + x2
holds for all rational numbers x and y.
Problem 2.7 (USA TSTST 2011 P1). Find all real-valued functions f defined on pairs of real numbers,
having the following property: for all real numbers a, b, c, the median of f (a, b), f (b, c), f (c, a) equals
the median of a, b, c. (The median of three real numbers, not necessarily distinct, is the number that
is in the middle when the three numbers are arranged in nondecreasing order.)
Problem 2.8. Solve over R the functional equation
[f (f (x) + y)]2 = (x − y)(f (x) − f (y)) + 4f (x)f (y).
Problem 2.9. Find all functions f : R>0 → R≥0 satisfying
(f (x) + f (y))3 = xf (x) + yf (y) + 3f (xy)(f (x) + f (y))
for all positive real numbers x and y.
 Algebra Ineq 7

Problem 2.10. Solve over positive real numbers the functional equation
 
x
= xyf x2 + y 2


f f (x)y +
y

Problem 2.11 (USAMO 2014 P2). Find all f : Z → Z such that

f (x)2
xf (2f (y) − x) + y 2 f (2x − f (y)) = + f (yf (y))
x
for all x, y ∈ Z such that x ̸= 0.
Problem 2.12 (APMO 2015 P2). Let S = {2, 3, 4, . . .} denote the set of integers that are greater than
or equal to 2. Does there exist a function f : S → S such that

f (a)f (b) = f (a2 b2 ) for all a, b ∈ S with a ̸= b?

~2.2 Ineq

Problem 2.13. Assume that a1 , a2 , · · · is an infinite sequence of reals such that ai +aj ≥ ai+j ∀i, j ∈ N.
Prove that for any n ≥ 1
a1 a2 an
+ + ··· ≥ an
1 2 n
Problem 2.14 (IMO 2014 P1). Let a0 < a1 < a2 . . . be an infinite sequence of positive integers. Prove
that there exists a unique integer n ≥ 1 such that
a0 + a1 + a2 + · · · + an
an < ≤ an+1 .
n
Problem 2.15 (ISL 2013 A2). Prove that in any set of 2000 distinct real numbers there exist two pairs
a > b and c > d with a ̸= c or b ̸= d, such that
 
a − b  1
 c − d − 1 < 100000
 

Problem 2.16 (ISL 2004 A2). Let a0 , a1 , a2 , . . . be an infinite sequence of real numbers satisfying the
equation an = |an+1 − an+2 | for all n ≥ 0, where a0 and a1 are two different positive reals. Can this
sequence a0 , a1 , a2 , . . . be bounded?
Problem 2.17. Find all real numbers x1 , . . . , x2016 that satisfy the following equation for each
1 ≤ i ≤ 2016. ( Here x2017 = x1 .)
x2i + xi − 1 = xi+1
Problem 2.18 (India EGMO TST 2023). Let n ≥ 3 be an integer, and suppose x1 , x2 , · · · , xn are positive
real numbers such that x1 + x2 + · · · + xn = 1. Prove that

x1−x
1
2
+ x1−x
2
3
· · · + x1−x n 1−x1
n−1 + xn < 2.
 Algebra Ineq 8

Problem 2.19 (APMO 2020 P2). Show that r = 2 is the largest real number r which satisfies the
following condition:
If a sequence a1 , a2 , . . . of positive integers fulfills the inequalities
p
an ≤ an+2 ≤ a2n + ran+1

for every positive integer n, then there exists a positive integer M such that an+2 = an for every
n ≥ M.
 Geometry 9

~3 Geometry

Problem 3.1 (India EGMO TST 2023). Let r > 0 be a real number. All the interior points of the disc
D(r) of radius r are colored with one of two colors, red or blue. If r > √π3 , show that we can find
two points A and B in the interior of the disc such that AB = π and A, B have the same color Does
the conclusion in (a) hold if r > π2 ?
Problem 3.2 (APMO 2021 P3). Let ABCD be a cyclic convex quadrilateral and Γ be its circumcircle.
Let E be the intersection of the diagonals of AC and BD. Let L be the center of the circle tangent
to sides AB, BC, and CD, and let M be the midpoint of the arc BC of Γ not containing A and D.
Prove that the excenter of triangle BCE opposite E lies on the line LM .
Problem 3.3 (APMO 2017 P2). Let ABC be a triangle with AB < AC. Let D be the intersection
point of the internal bisector of angle BAC and the circumcircle of ABC. Let Z be the intersection
point of the perpendicular bisector of AC with the external bisector of angle ∠BAC. Prove that the
midpoint of the segment AB lies on the circumcircle of triangle ADZ.
Problem 3.4 (USA EGMO TST 2023 P4). Let ABC be a triangle with AB + AC = 3BC. The
B-excircle touches side AC and line BC at E and D, respectively. The C-excircle touches side AB
at F . Let lines CF and DE meet at P . Prove that ∠P BC = 90◦ .
Problem 3.5. The incircle w of a triangle ABC touches the sides AC and BA at E and F respectively.
N is the midpoint of arc BAC and P is the foot of altitude from the midpoint of BC onto EF .
Prove that the line N P passes through the centre of w
Problem 3.6. Let D be an arbitrary point on side BC of triangle ABC. Let I1 and I2 be the
incenters of triangles ABD and ACD respectively. Let O1 and O2 be the circumcenters of triangles
AI1 D and AI2 D respectively. Prove that the lines I1 O2 and I2 O1 meet on the perpendicular from
D to BC.
Problem 3.7. ABCD is a convex quadrilateral. Points I1 , I2 , J1 , J2 are respectively the incenter,
incentre, A-excenter, A-excentre of ABC, ADC, ABC, ADC. Prove that I1 J2 intersects I2 J1 on the
angle bisector of ∠BCD
Problem 3.8. Let BE and CF be altitudes in a scalene triangle ABC. Let M be the midpoint of
BC and let N be the midpoint of EF . Show that the circumcenter of AM N lies on the line through
A parallel to BC.
Problem 3.9. Let ABC be an acute-angled triangle with AB < AC, and let H be its orthocenter.
The circumference with diameter AH meets the circumscribed circumference of ABC at P ̸= A.
The tangent to the circumscribed circumference of ABC through P intersects line BC at Q. Show
that QP = QH.
 Number Theory 10

~4 Number Theory

Problem 4.1 (India EGMO TST 2023). Alice has an integer N > 1 on the blackboard. Each minute,
she deletes the current number x on the blackboard and writes 2x + 1 if x is not the cube of an
integer, or the cube root of x otherwise. Prove that at some point of time, she writes a number
larger than 10100 .
Problem 4.2. We call natural number n crazy iff there exist natural numbers a, b > 1 such that
n = ab + b. Whether there exist 2023 consecutive natural numbers among which are 2021 crazy
numbers?
Problem 4.3. Let a0 = 4 and define a sequence of terms using the formula an = a2n−1 − an−1 for
each positive integer n : 1. Prove that there are infinitely many prime numbers which are factors of
atleast one term in the sequence? 2. Are there infinitely many prime numbers which are factors of
no terms in the sequence?
Problem 4.4 (USEMO 2019 P4). Prove that for any prime p, there exists a positive integer n such
that
1n + 2n−1 + 3n−2 + · · · + n1 ≡ 2023 (modp).
Problem 4.5 (ISL 2013 N3). Prove that there exist infinitely many positive integers n such that the
largest prime divisor of n4 + n2 + 1 is equal to the largest prime divisor of (n + 1)4 + (n + 1)2 + 1
Problem 4.6 (APMO 2021 P2). For a polynomial P and a positive integer n, define Pn as the number
of positive integer pairs (a, b) such that a < b ≤ n and |P (a)| − |P (b)| is divisible by n. Determine
all polynomial P with integer coefficients such that Pn ≤ 2021 for all positive integers n.
Problem 4.7 (APMO 2021 P5). Determine all Functions f : Z → Z such that f (f (a) − b) + bf (2a) is a
perfect square for all integers a and b.
Problem 4.8 (APMO 2019 P2). Let m be a fixed positive integer. The infinite sequence {an }n≥1 is
defined in the following way: a1 is a positive integer, and for every integer n ≥ 1 we have
(
a2n + 2m if an < 2m
an+1 =
an /2 if an ≥ 2m
For each m, determine all possible values of a1 such that every term in the sequence is an integer.
Problem 4.9 (USA TSTST 2022 P4). Let N denote the set of positive integers. A function f : N → N
has the property that for all positive integers m and n, exactly one of the f (n) numbers
f (m + 1), f (m + 2), . . . , f (m + f (n))
is divisible by n. Prove that f (n) = n for infinitely many positive integers n.
Problem 4.10 (NICE 2021 P1). The fibboican sequence a1 , a2 , . . . is defined by a1 = a2 = 1, and for
integers k ≥ 3, - ak = ak−1 + ak−2 if k is odd - a1k = ak−1
1 1
+ ak−2 if k is even. Prove that, for each
integer m ≥ 1, the numerator of am (when written in simplest form) is a power of 2 .