AoPS Community 2018 India IMO Training Camp

India International Mathematical Olympiad Training Camp 2018

www.artofproblemsolving.com/community/c685672
by Ankoganit, MarkBcc168, anantmudgal09, fastlikearabbit, Tsukuyomi, SHARKYKESA, Muradjl

– Practice Tests

– Practice Test 1

1 Let ∆ABC be an acute triangle. D, E, F are the touch points of incircle with BC, CA, AB re-
spectively. AD, BE, CF intersect incircle at K, L, M respectively. If,
AK BL CM
σ= + +
KD LE MF
AK BL CM
τ= . .
KD LE M F
Then prove that τ = 16r .
R
Also prove that there exists integers u, v, w such that, uvw 6= 0,
uσ + vτ + w = 0.

2 A 10 digit number is called interesting if its digits are distinct and is divisible by 11111. Then
find the number of interesting numbers.

3 Let an , bn be sequences of positive reals such that,

1
an+1 = an +
2bn
1
bn+1 = bn +
2an
for all n ∈ N.
Prove that, max (a2018 , b2018 ) > 44.

– Practice Test 2

1 Let ABCD be a convex quadrilateral inscribed in a circle with center O which does not lie
on either diagonal. If the circumcentre of triangle AOC lies on the line BD, prove that the
circumcentre of triangle BOD lies on the line AC.

2 For an integer n ≥ 2 find all a1 , a2 , · · · , an , b1 , b2 , · · · , bn so that

(a) 0P≤ a1 ≤ a2 ≤ · · · ≤ an ≤ 1 ≤ b1 ≤ b2 ≤ · · · ≤ bn ;
(b) P nk=1 (ak + bk ) = 2n;
(c) nk=1 (a2k + b2k ) = n2 + 3n.

© 2019 AoPS Incorporated 1

AoPS Community 2018 India IMO Training Camp

3 A convex polygon has the property that its vertices are coloured by three colors, each colour
occurring at least once and any two adjacent vertices having different colours. Prove that the
polygon can be divided into triangles by diagonals, no two of which intersect in the interior of
the polygon, in such a way that all the resulting triangles have vertices of all three colours.

– Team Selection Tests

– TST 1

1 A rectangle R with odd integer side lengths is divided into small rectangles with integer side
lengths. Prove that there is at least one among the small rectangles whose distances from the
four sides of R are either all odd or all even.
Proposed by Jeck Lim, Singapore

2 Let A, B, C be three points in that order on a line ` in the plane, and suppose AB > BC. Draw
semicircles Γ1 and Γ2 respectively with AB and BC as diameters, both on the same side of `.
Let the common tangent to Γ1 and Γ2 touch them respectively at P and Q, P 6= Q. Let D and
E be points on the segment P Q such that the semicircle Γ3 with DE as diameter touches Γ2
in S and Γ1 in T .
-Prove that A, C, S, T are concyclic.
-Prove that A, C, D, E are concyclic.

3 Find all functions f : R 7→ R such that

f (x)f (yf (x) − 1) = x2 f (y) − f (x),

for all x, y ∈ R.

– TST 2

1 For a natural number k > 1, define Sk to be the set of all triplets (n, a, b) of natural numbers,
with n odd and gcd(a, b) = 1, such that a + b = k and n divides an + bn . Find all values of k for
which Sk is finite.

2 In triangle ABC, let ω be the excircle opposite to A. Let D, E and F be the points where ω is
tangent to BC, CA, and AB, respectively. The circle AEF intersects line BC at P and Q. Let
M be the midpoint of AD. Prove that the circle M P Q is tangent to ω.

3 Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move,
Sir Alex is allowed to perform exactly one of the following two operations:
- Choose any number of the form 2j , where j is a non-negative integer, and put it into an empty
cell.

© 2019 AoPS Incorporated 2

AoPS Community 2018 India IMO Training Camp

- Choose two (not necessarily adjacent) cells with the same number in them; denote that num-
ber by 2j . Replace the number in one of the cells with 2j+1 and erase the number in the other
cell.
At the end of the game, one cell contains 2n , where n is a given positive integer, while the other
cells are empty. Determine the maximum number of moves that Sir Alex could have made, in
terms of n.
Proposed by Warut Suksompong, Thailand

– TST 3

1 Let n be a positive integer. Define a chameleon to be any sequence of 3n letters, with exactly
n occurrences of each of the letters a, b, and c. Define a swap to be the transposition of two
adjacent letters in a chameleon. Prove that for any chameleon X , there exists a chameleon
Y such that X cannot be changed to Y using fewer than 3n2 /2 swaps.

2 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 6= g ◦ f ◦ g for every g in A
with g 6= f . Show that f (T ) = T .

3 Find the smallest positive integer n or show no such n exists, with the following property: there
are infinitely many distinct n-tuples of positive rational numbers (a1 , a2 , . . . , an ) such that both
1 1 1
a1 + a2 + · · · + an and + + ··· +
a1 a2 an

are integers.

– TST 4

1 Let ABC be a triangle and AD, BE, CF be cevians concurrent at a point P . Suppose each of
the quadrilaterals P DCE, P EAF and P F BD has both circumcircle and incircle. Prove that
ABC is equilateral and P coincides with the center of the triangle.

2 Let n ≥ 2 be a natural number. Let a1 ≤ a2 ≤ a3 ≤ · · · ≤ an be real numbers such that

a1 + a2 + · · · + an > 0 and n(a21 + a22 + · · · + a2n ) = 2(a1 + a2 + · · · + an )2 . If m = bn/2c + 1, the
smallest integer larger than n/2, then show that am > 0.

3 Determine all integers n ≥ 2 having the following property: for any integers a1 , a2 , . . . , an whose
sum is not divisible by n, there exists an index 1 ≤ i ≤ n such that none of the numbers

ai , ai + ai+1 , . . . , ai + ai+1 + . . . + ai+n−1

is divisible by n. Here, we let ai = ai−n when i > n.

© 2019 AoPS Incorporated 3

AoPS Community 2018 India IMO Training Camp

Proposed by Warut Suksompong, Thailand

© 2019 AoPS Incorporated 4

Art of Problem Solving is an ACS WASC Accredited School.