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 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.1 FE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2 Ineq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3 Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
4 Number Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
 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. Some cells of a rectangular table with n rows and m columns (n < m) are filled with
stones such that there is at least 1 stone in any column. Prove that there is a stone such that the
number stones in the same row is at least m n times the number of stones in the same column

Problem 1.2 (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.
 Algebra 5

~2 Algebra

~2.1 FE

Problem 2.1. 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.2 (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.3. 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 .

~2.2 Ineq

Problem 2.4. 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.5. 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.6. 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.7. 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?
 Geometry 6

~3 Geometry

Problem 3.1. 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.2. 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.3. 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.4. 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.5. 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.
Problem 3.6 (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 ?
 Number Theory 7

~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 .