The 40th China Mathematical Olympiad
Day 1
α2
1. Let α > 1 be an irrational number and L be a integer such that L > α−1 . A
sequence x1 , x2 , · · · satisfies that x1 > L and for all positive integers n,
(
bαxn c if xn 6 L
xn+1 = xn .
α if xn > L
Prove that
(i) {xn } is eventually periodic.
(ii) The eventual fundamental period of {xn } is an odd integer which doesn’t depend
on the choice of x1 .
2. Let ABC be a triangle with incenter I. Denote the midpoints of AI, AC and CI by
L, M and N respectively. Point D lies on segment AM such that BC = BD. Let
the incircle of triangle ABD be tangent to AD and BD at E and F respectively.
Denote the circumcenter of triangle AIC by J, and the circumcircle of triangle
JM D by ω. Lines M N and JL meet ω again at P and Q respectively. Prove that
P Q, LN and EF are concurrent.
3. Let a1 , a2 , . . . , an be integers such that a1 > a2 > · · · > an > 1. Let M =
lcm (a1 , a2 , . . . , an ). For any finite nonempty set X of positive integers, define
Xx
f (X) = min .
16i6n ai
x∈X
Such a set X is called minimal if for every proper subset Y of it, f (Y ) < f (X)
always holds.
2
Suppose X is minimal and f (X) > an . Prove that
|X| 6 f (X) · M.
The 40th China Mathematical Olympiad
Day 2
4. The fractional distance between two points (x1 , y1 ) and (x2 , y2 ) is defined as
q
kx1 − x2 k2 + ky1 − y2 k2 ,
where kxk denotes the distance between x and its nearest integer. Find the largest
real r such that there exists four points on the plane whose pairwise fractional
distance are all at least r.
5. Let p be a prime number and f be a bijection from {0, 1, . . . , p − 1} to itself. Suppose
that for integers a, b ∈ {0, 1, . . . , p − 1}, |f (a) − f (b)| 6 2024 if p | a2 − b. Prove that
there exists infinite many p such that there exists such an f and there also exists
infinite many p such that there doesn’t exist such an f .
Pn Pn 2
Pn 3
6. Let a1 , a2 , . . . , an be real numbers such that i=1 ai = n, i=1 ai = 2n, i=1 ai =
3n.
(i) Find the largest constant C, such that for all n > 4,
max {a1 , a2 , . . . , an } − min {a1 , a2 , . . . , an } > C.
(ii) Prove that there exists a positive constant C2 , such that
3
max {a1 , a2 , . . . , an } − min {a1 , a2 , . . . , an } > C + C2 n− 2 ,
where C is the constant determined in (i).