IMO

MOCK - 1
PROBLEMS HANDOUT
ADITYA BHOJ
June 2025

1 Introduction - )

PR-1.01

Suppose that positive integers 1 < n1 < n2 < · · · < nk (k ≥ 2) and a, b ∈ N satisfy
k 
1 a k−1 1
Y  Y  
1− ≤ < 1− .
i=1 ni b i=1 ni

Prove that
k −1
n1 n2 · · · nk ≤ (4a)2 .

PR-1.02

Let r1 , r2 , . . . , r7 be the distinct complex roots of the polynomial P (x) = x7 − 7. Let

Y
K= (ri + rj ),
1≤i<j≤7

that is, the product of all numbers of the form ri + rj , where i and j are integers for which
1 ≤ i < j ≤ 7. Determine the value of K 2 .

PR-1.03

Z 1 Z 3/2
x2 −1 2 −2x)
q
α= xe 2 cos(x) dx, β= e2(x 1 − cos(4x − 4) dx
0 1

α − cos(1) + e−1/2
Find
β

PR-1.04

1
 Let n > 1 be an integer. In a configuration of an n×n board, each of the n2 cells contains
an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the
snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo
moves one square unit in the direction indicated by the arrow in her cell (possibly leaving
the board). After each move, the arrows in all of the cells rotate 90◦ counterclockwise. We
call a cell good if, starting from that cell, Turbo visits each cell of the board exactly once,
without leaving the board, and returns to her initial cell at the end. Determine, in terms of
n, the maximum number of good cells over all possible starting configurations.

PR-1.05

Compute :
2015
Y 2015
!
Y  
2πiab/2015
log2 1+e
a=1 b=1

Here i is the imaginary unit (that is, i2 = −1).

PR-1.06

The sequence a1 , a2 , . . . of integers satisfies the conditions:

(i) 1 ≤ aj ≤ 2015 for all j ≥ 1,

(ii) k + ak ̸= ℓ + aℓ for all 1 ≤ k < ℓ.

Prove that there exist two positive integers b and N for which
n
(aj − b) ≤ 10072
X

j=m+1

for all integers m and n such that n > m ≥ N .

PR-1.07

Let p be a prime number and q a power of p. Let K be an algebraic closure of Fq . Say

that a polynomial f (X) ∈ K[X] is a q-polynomial if it is of the form
n
i
ai X q
X
f (X) =
i=0

Let f (X) be a q-polynomial of degree q n , with a0 ̸= 0. Show that the set of zeros of f (X)
is an n-dimensional vector space over Fq .

PR-1.08

For a positive integer k ≥ 2, let αk , βk , γk be the complex roots (with multiplicity) of the
cubic equation
(x − k1 )(x − k+1 1 1
)(x − k+2 ) = k1 .

2
Determine the value of ∞
X αk βk γk (1 + αk )(1 + βk )(1 + γk )
.
k=2 k+1

PR-1.09

Let m ≥ 1 be an integer. An mth root of unity is a complex number z such that z m = 1.

An mth root of unity z is called primitive if z d ̸= 1, and z d = 1 for every integer 1 ≤ d < m.
For instance, w = cos( π3 ) + i sin( π3 ) is a 6th root of unity, but not a primitive 6th root of
unity. It is, however, a primitive 3rd root of unity.

(a) Find, with proof, the product of all primitive mth roots of unity (your answer may
depend on m).

(b) Prove that the sum of all primitive mth roots of unity is non-zero if and only if m is
squarefree, i.e. m is not divisible by the square of any prime number.

(c) Suppose that m is squarefree. Prove that every mth root of unity z can be written as
a finite sum or difference of primitive mth roots of unity. In other words, prove that
there is some integer k ≥ 1, primitive mth roots of unity z1 , z2 , . . . , zk (not necessarily
mutually distinct), and ϵi ∈ {−1, +1} for each 1 ≤ i ≤ k, such that

z = a1 z1 + a2 z2 + · · · + ak zk .

(It turns out that the converse is true as well. That is, if m ≥ 1 is not a square-free
integer, then there is some mth root of unity z which cannot be written as a finite sum or
difference of primitive mth roots of unity. This actually follows from (b) and a bit of linear
algebra and field theory.)

PR-1.10

Consider a triangle △ABC and a straight line L which is not parallel to any of the three
sides of the triangle. Let L cut the sides BC, CA and AB at D, E and F respectively, which
are different from the vertices. Then show that:
AF · BD + F B · DC + CE · AF + EA · F B + BD · CE + DC · EA
AF · DC + F B · DC + CE · F B + EA · F B + BD · EA + DC · EA
BD · CE + DC · EA + CE · AF + EA · F B + AF · BD + F B · DC
+
BD · EA + DC · EA + CE · F B + AF · DC + F B · DC + EA · F B
CE · AF + EA · F B + AF · BD + F B · DC + BD · CE + DC · EA
+ ≥ 3.
CE · F B + EA · F B + AF · DC + BD · EA + DC · EA + F B · DC
When does the equality hold?

PR-1.11

3
 Let xi > 0, where i ∈ {1, . . . , 2024} be the zeros of the polynomial
2024
x2024 + ak x2024−k
X

k=1

Then prove (or disprove) the following statements.

1.
2 25
<
a2024 + 3a1 2a2024 − 3a1
2. √
506 ≤ 0.5(−a1 )1.5
1000

(c) The triplet

x1 x2 x3
 
(x, y, z) = , ,
x1 + x3 x2 + x3 x 1 + x2
satisfies xy + yz + zx + 2xyz = 1.

(d) Assume that there exist three roots such that the triplet can form an acute-angled
triangle. Let α, β, γ be the angles of this triangle. Then,

cos4 α + cos4 β + cos4 γ + 2 cos2 α cos2 β cos2 γ < cos2 α + cos2 β + cos2 γ

Hint: Use the identity cos2 A+cos2 B +cos2 C = 1−2 cos A cos B cos C if A+B +C = π
and use appropriate substitution.

PR-1.12

Prove that ∞
X 1 1
S= =ψ−
k=0 f2k+1 + 1 2
√
5+1
where ψ = 2
is the golden ratio; fn = fn−1 + fn−2 , and f0 = 0, f1 = 1.

PR-1.13

Which of the two numbers is larger?

Z 1 −x2 2
e Z 1
ex
dx or dx
0 ex2 0 e−x2

ALL THE BEST !!!!!

:)