Vietnam IMO Booklet 2017

Vietnamese Ministry of Training and Education
Vietnamese Mathematical Competitions 2017
VIETNAMESE
Mathematical Competitions
2017
for high school students
VMC 2017
Hanoi, July 2017
Table of Contents
1 Vietnamese Mathematical Olympiad 2017 7

1.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2 Vietnamese Team Selection Test for IMO 2017 9

2.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
3 Solution of VMO 2017 11

4 Solution of Vietnam TST for IMO 2017 24
Preface
The Vietnam Mathematical Olympiad 2017 for high school students took
place in all cities of Vietnam on 05-06th January, 2017. After that com-
petition, a two-day IMO Team selection test was organized. The top 48
students and one student who got a Silver medal at IMO 2016 took two
tests on 25th and 26th of March.
Based on the TST result, the Vietnamese team for the 58th International
Mathematical Olympiad 2017 in Rio de Janeiro, Brazil were selected:
1. Phan Nhat Duy
2. Le Quang Dung
3. Nguyen Canh Hoang
4. Hoang Huu Quoc Huy
5. Pham Nam Khanh
6. Do Van Quyet
Dr. Le Anh Vinh (The Vietnam Institute of Educational Sciences - Hanoi)
and Dr. Le Ba Khanh Trinh (Vietnam National University - Ho Chi Minh
city) were appointed as the Leader and the Deputy Leader of the Viet-
namese IMO team 2017. The team is also accompanied by Mr. Nguyen
Khac Minh (Ministry of Education and Training). This booklet, includes
problems and solutions of VMO and TST this year, which was edited by
Le Phuc Lu (FPT Software Ho Chi Minh City), Nguyen Van Quy (Hanoi
University of Science). We also say thanks to the trainers help us in com-
pletion the booklet: Dr. Tran Nam Dung, Vo Quoc Ba Can, Tran Quang
Hung, Nguyen Van Linh, Nguyen Huy Tung, Luong Van Khai.
6
The Vietnamese team at IMO 2017

Phan Nhat Duy Le Quang Dung Nguyen Canh Hoang
Hoang Huu Quoc Huy Pham Nam Khanh Do Van Quyet
Team Training Administrators
Le Ba Khanh Trinh Le Anh Vinh Nguyen Khac Minh

Problems from the contests
1 Vietnamese Mathematical Olympiad 2017
1.1 Day 1
Problem 1. Given a real number a and consider the sequence (un )
defined by
s
1 2n + 3 1
u1 = a, un+1 = + un + , ∀n ∈ N∗ .
2 n+1 4
1. If a = 5, prove that (un ) has a finite limit and finds that limit.
2. Find all the values of a such that the sequence (un ) defines and has
finite limits.
Problem 2. Does there exist a polynomial P (x) with integer coefficients
√
3
√
3
√ √
such that P 1 + 2 = 1 + 2 and P 1 + 5 = 2 + 3 5?
Problem 3. Let ABC be an acute, non isosceles triangle with (O) is its
circumcircle. Denote H as the orthocenter and BE, CF as the altitudes
of triangle ABC. Suppose that AH intersects (O) at D differs from A.
1. Let I be the midpoint of AH, EI meets BD at M and F I meets
CD at N . Prove that M N is perpendicular to OH.
2. The lines DE, DF intersect (O) at P, Q respectively (P and Q are
differ from D). The circle (AEF ) intersects (O) and AO at R, S
respectively (R and S differ from A). Prove that BP, CQ, RS are
concurrent.
8
Problem 4. Let n be a positive integer and n > 1. The square table

ABCD of size n consists of n2 unit cells, each of them is colored by one
of three colors: black, white, gray. A way to color this table is called
"nice" if each cell on the diagonal AC is colored by gray and each pair of
cells that symmetric respect to AC are colored by the same color, both
white or both black. One can fill in each gray cell by the number 0, each
black cell by negative integer and each white cell by positive integer. For
each positive integer k, a way to fill in the table is called "k-balanced" if
it satisfies all following conditions:
• All cells of the table are filled by the integers belong to the segment
[−k; k].
• If a row meets a column at a black cell then the sets of positive
integers on that row and that column are disjoint. Similarly, if a
row meets a column at a white cell then the sets of negative integers
on that row and that column are disjoint.
1. For n = 5, find the minimum value of k such that there exists a
k-balanced way to fill in the table below.
2. For n = 2017, find the minimum value of k such that for all nice way
to color the table, we can fill in the table by k-balanced way.
1.2 Day 2
Problem 5. Find all functions f : R → R such that

f xf (y) − f (x) = 2f (x) + xy
for all real numbers x, y.

Problem 6. Show that
2. VIETNAMESE TEAM SELECTION TEST FOR IMO 2017 9
1008
k
≡ 0 (mod 20172 ).
X
a) kC2017
k=1
504
(−1)k C2017
k
≡ 3(22016 − 1) (mod 20172 ).
X
b)
k=1
Problem 7. Let ABC be an acute triangle inscribed in the circle (O)

and I is the circumcenter of triangle OBC. The point G belongs to the
arc BC (not contains O) of (I). The circle (ABG) intersects AC at E

and circle ACG intersects AB at F (points E, F differ from A).
1. Denote K as the intersection of BE and CF . Prove that AK, BC
and OG are concurrent.
2. Let D be a fixed point on the arc BC that contains O of (I) and GB
meets CD at M , GC meets BD at N . Suppose that M N intersects
(O) at P, Q Prove that when G moves on (I), the circumcircle of
triangle GP Q always pass through two certain fixed points.
2 Vietnamese Team Selection Test for IMO 2017
2.1 Day 1
Problem 1. There are 44 distinct holes on a line and 2017 ants. Each
ant crawled up from a hole, then moved to another hole and crawled down.
Denote T as the set of time points that the ants crawled up or crawled
down from some hole. Suppose that the speed of the ants are pairwise
distinct and they did not change its speed. Prove that if |T | ≤ 45 then
there exist two ants did not meet. Note that two ants met when there
exist a time point such that they were at the same location on the line,
including the holes.
Problem 2. For every positive integer n, let xn = C2nn .
2017k
1. Show that if < n < 2017k for some positive integer k then xn
2
is a multiple of 2017.
2. Find all positive integer h > 1 such that there exist positive integers
N, T such that for all n > N then (xn ) is a periodic sequence mod h
with period T .
Problem 3. Let ABC be a triangle with I is its incenter and the
circle (I) is tangent to BC, CA, AB at D, E, F respectively. Denote Ib , Ic
as the excenters of triangle ABC respect to vertices B, C. Let P, Q be the
10
midpoints of segments Ib E, Ic F . Suppose that (P AC) intersects AB at

the second point R and (QAB) intersects AC at the second point S.
1. Prove that P R, QS, AI are concurrent.
2. Suppose that DE, DF intersect Ib Ic at K, J and EJ meets F K at
M . The lines P E, QF intersect (P AC), (QAB) at X, Y (X differs
from P and Y differs from Q). Prove that BY, CX and AM are
concurrent.
2.2 Day 2
Problem 4. Let B, C be two fixed points on the fixed circle (O) (BC is
not the diameter of (O)). The points A moves on (O) such that AB > BC
and M is the midpoint of AC. The circle of diameter BM intersects (O)
at R. Suppose that RM intersects (O) at the second point Q and cut BC
at P . The circle of diameter BP intersects AB, BO at the second points
K, S respectively.
1. Prove that SR passes through the midpoint of KP .
2. Denote N as the midpoint of BC. The radical axis of two circles of
diameter AN, BM intersects SR at E. Prove that M E always pass
through the certain fixed point when A moves on (O).
Problem 5. Given 2017 positive real numbers a1 , a2 , . . . , a2017 . For
each positive integer n > 2017, let
n o
an = max ai1 ai2 ai3 | i1 + i2 + i3 = n, 1 ≤ i1 ≤ i2 ≤ i3 ≤ n − 1 .
Prove there exists some positive integers m ≤ 2017 and N > 4m such that
an an−4m = a2n−2m for every n > N.
Problem 6. For a positive integer n, consider a1 , a2 , . . . , a2n as a
permutation of the first 2n positive integers. A permutation is called
"nice" if ai + an+i = 2n + 1, i = 1, 2, 3, . . . , n and ai − ai+1 is not congruent
to aj − aj+1 modulo 2n + 1 for all 1 ≤ i < j ≤ 2n (suppose that a2n+1 = a1 ).
1. For n = 6, give an example of the nice permutation.
2. Prove that for all n, there alway exist some nice permutation.
Solution for the tests
3 Solution of VMO 2017
Problem 1
Given a real number a and consider the sequence (un ) defined by

s
1 2n + 3 1
u1 = a, un+1 = + un + , ∀n ∈ N∗ .
2 n+1 4
1. If a = 5, prove that (un ) has a finite limit and finds that limit.
2. Find all the values of a such that the sequence (un ) defines and
has finite limits.
Solution
We will solve directly part 2), from which to deduce the result of part
1). It can be seen
q
that the sequence (un ) defines if and only if u2 defines.
Since u2 = 2 + 2 a + 41 , then u2 defines if and only if
1 5
1
a≥− .
10
1
We will prove that the sequence (un ) converges to 3 for every a ≥ − 10 .
1 2x+3
It is easy to see that un ≥ 2 , ∀n ≥ 2. Note that f (x) = x+1 is a strictly
decreasing function over R+ so for every positive integers n, we have
2n + 3 2(n + 1) + 3
> .
n+1 (n + 1) + 1
12
If there exists a number n0 ∈ N such that un0 ≥ un0 +1 then we have

v s
1 u 2(n0 + 1) + 3 1 1 2n0 + 3 1
u
un0 +2 = + t un0 +1 + ≤ + un0 + = un0 +1 .
2 (n0 + 1) + 1 4 2 n0 + 1 4
Similarly, we have un0 ≥ un0 +1 ≥ un0 +2 ≥ un0 +3 ≥ · · · This means that

the sequence (un ) does not increase from n0 onward. Simultaneously,
the sequence

is also

bounded lower for every n ≥ 2 so there exists limit
1
lim un = L L ≥ 2 . Now, convert equation (1) to limit, we get
s
1 1
L = + 2L + .
2 4
Solve this equation, we have L = 3. In summary, if there exists n0 as above
then lim un = 3.
Next, we consider the case: the number n0 as above does not exist, in
other words the sequence (un ) is strictly decreasing. We will prove (un )
is also bounded above. Indeed, since un+1 > un and 2n+3n+1 < 3 for every
n ≥ 2 so we have
s s
1 1 1 2n + 3 1
+ 3un + > + un + = un+1 > un , ∀n ≥ 2.
2 4 2 n+1 4
√
Solving this inequation of un , we have un < 4+2 17 for every n ≥ 2. There-
√
fore the sequence (un ) is strictly decreasing and bounded upper by 4+2 17
so it has a finite limit. Hence, by convert equation (1) to limit, we also
have lim un = 3.
1
In summary, for every a ≥ − 10 the sequence (un ) defines and converges
to 3.
Problem 2
Does there exist a polynomial P (x) with integer coefficients such that
√
3
√
3
√ √
P 1+ 2 = 1 + 2 and P 1 + 5 = 2 + 3 5?
Solution
Suppose that there exists such polynomial P (x). Let Q(x) = P (1 + x) − 1

√
3
√3
√ √
then Q(x) ∈ Z[x]. We have Q 2 = 2 and Q 5 = 1 + 3 5.
3. SOLUTION OF VMO 2017 13
√
Therefore, Q(x) − x has an irrational root 3 2. Since x3 − 2 is irreducible
√
over Z[x] and has the same root 3 2, we get x3 − 2 | Q(x) − x. Then there
exists R(x) with integer coefficients such that
Q(x) − x = (x3 − 2)R(x).

√ √ √
Because R(x) ∈ Z[x] so R 5 = a + b 5 for some a, b ∈ Z. Let x = 5

then:
√ √ √ √
1 + 3 5 = 5 5 − 2 a + b 5 = 25b − 2a + (5a − 2b) 5,
This implies 5a − 2b = 3 and 2a = 25b − 1, which has not a pair integer

(a, b) satisfying, a contradictions. So the answer is no.
Problem 3
Let ABC be an acute, non isosceles triangle with (O) is its circum-
circle. Denote H as the orthocenter and BE, CF as the altitudes of
triangle ABC. Suppose that AH intersects (O) at D differs from A.
1. Let I be the midpoint of AH, EI meets BD at M and F I meets
CD at N . Prove that M N is perpendicular to OH.
2. The lines DE, DF intersect (O) at P, Q respectively (P and Q
differ from D). The circle (AEF ) intersects (O) and AO at R, S
respectively (R and S differ from A). Prove that BP, CQ, RS
are concurrent.
Solution
1) Denote J as the center of nine points circle of triangle ABC then (J)
passes through E, I, F and the point J is also the midpoint of segment
OH. It is easy to see that D and H are symmetric with respect to the
line BC then triangle BDH is isosceles with BD = BH. Since triangle
IEH has IE = IH then
∠IEH = ∠IHE = ∠BHD = ∠BDH,
which implies that BDEI is a cyclic quadrilateral. But DB cuts EI at

M then
M E · M I = M B · M D.
14
M
I
E
F O
J
H
B C
D
N
Thus the power of the point M to circles (J) and (O) are equal. Similarly,
the power of the point N to circles (J) and (O) are also equal. So we can
conclude that M N is the radical axis of (O) and (J), thus M N ⊥ OJ.
But O, H, J are collinear then M N ⊥ OH.
2) Let X be the midpoint of EF and K be the intersection of AH and

BC. It is easy to see that two triangles BF E and KHE are similar,
which implies that two triangle BF X and DHE are also similar, thus
∠F BX = ∠HDE = ∠F BP . Then three points B, X, P are collinear;
similar to three points C, X, Q.
A P
Q
S E
I
X R
F
O
H
B K C
M
D L
Denote AL as the diameter of circle (O) then we can see that SH passes
through L and quadrilateral HBLC is a parallelogram, which implies that
HL passes through the midpoint M of BC. It is easy to check that two
triangle SEC and SF B are similar then two triangle SEF and SCB are
also similar. These triangles have the medians SX and SM respectively
then ∠F SX = ∠BSM . We also have two triangles SF B and SRL are
similar then two triangles SF R and SBL are also similar. Thus
∠F SR = ∠BSL = ∠BSM = ∠F SX.
From this we can conclude that three points S, X, R are collinear or SR

passes through X. Therefore, three lines BP, CQ and RS are concurrent
at the midpoint X of the segment EF .
Problem 4
Let n be a positive integer and n > 1. The square table ABCD of
size n consists of n2 unit cells, each of them is colored by one of three
colors: black, white, gray. A way to color this table is called "nice" if
each cell on the diagonal AC is colored by gray and each pair of cells
that symmetric respect to AC are colored by the same color, both
white or both black. One can fill in each gray cell by the number
0, each black cell by negative integer and each white cell by positive
integer. For each positive integer k, a way to fill in the table is called
"k-balanced" if it satisfies all following conditions:
• All cells of the table are filled by the integers belong to the
segment [−k; k].
• If a row meets a column at a black cell then the sets of positive
integers on that row and that column are disjoint. Similarly, if
a row meets a column at a white cell then the sets of negative
integers on that row and that column are disjoint.
1. For n = 5, find the minimum value of k such that there exists a
k-balanced way to fill in the table below.
2. For n = 2017, find the minimum value of k such that for all nice
way to color the table, we can fill in the table by k-balanced
way.
Solution
16
1) Let a, b, c be the number fill on the cells at position (1; 2), (2; 1) and
(3; 4), (4; 3) and (4; 5), (5; 4). It is easy to check that all a, b, c must pairwise
distinct, then k ≥ 3.
We have the way to fill in the table with k = 3 as follows:
Thus the minimum value of k in this case is 3.

2) First, consider the nice coloring way as the chessboard in which the cell
(i, j) colored by black if and only if i + j is even.
Take two white positions on the table at location (a, b) and (c, d), 1 ≤
a, b, c, d ≤ 2017.
• If a + c is even then b + d is also even, which implies that a + d and
b + c are both odd. Then, one of two cells (a, d) and (b, c) will be
colored by black since they cannot lie on the diagonal AC. Thus the
numbers filled in white cells are different.
• If a + c is odd then b + d is also odd, consider cell (d, c) while filled in
by the same number as (c, d) then we can apply the same argument
as above to conclude that the numbers filled in the white cells are
different.
Hence, all positive numbers on the right upper of the table are pairwise
distinct. This implies that
20172 − 1
k ≥ 2 + 4 + 6 + · · · + 2016 = 1008 · 1009 = .
4
We shall prove that for all symmetric coloring ways, one can use at most
20172
4 positive integers to fill in the board which satisfy the given conditions
(the argument is the same for negative integers).
Consider the graph of 2017 vertices, namely A1 , A2 , . . . , A2017 . If row i and
column j intersect at a white cell which filled in by a number a > 0, then
we connect Ai Aj and call a as the weight of this edge. This graph is well
defined since the symmetric properties and from the given condition, we
can conclude that: two arbitrary vertices that not connected belongs to
edges of different weights. We have to show that for all graph of n > 1
2
vertices, there is a way to assign at most n4 distinct weights to the edges
(∗).
We shall prove (∗) by induction. It is easy to check with n = 1, 2, 3.
Consider n ≥ 4 and suppose that the conclusion is true for a graph of n − 3
vertices, we consider the graph of n vertices. There are two cases:
2
1. If the number of edges in the graph is not more than n4 then we can
easily assign a unique weight to an edge which satisfy the condition.
2
If the number of edges in the graph is more than n4 then there are
three vertices Ai , Aj , Ak which are pairwise connected. This is true
because from Mantel’s theorem, we already know that: If a graph
2
has n vertices and more than n4 edges then it contains a triangle
(which means three vertices are pairwise connected).
We assign to Ai Aj , Aj Ak and Ak Ai the same weight and assign no
more than n − 3 distinct weights to the edges connect between one
of three vertices Ai , Aj , Ak and n − 3 other vertices. By applying
2
induction hypothesis, we can assign at most (n−3)
4 distinct weights
to the edges connect among n − 3 other vertices. Furthermore, we
have
(n − 3)2 n2
1 + (n − 3) + ≤ .
4 4
This implies that (∗) also holds for n.

20172 20172 −1
For n = 2017, we have 4 = 4 and this is exactly the minimum
value of k.
18
Problem 5
Find all functions f : R → R such that

f xf (y) − f (x) = 2f (x) + xy (1)
for all real numbers x, y.

Solution
By taking x = 1 into (1), we get

f f (y) − f (1) = y + 2f (1), ∀y ∈ R. (2)
Hence f is bijection and so, there exist a unique real number a such that
f (a) = 0. Plugging x = a into (1), we have

f af (y) = ay, ∀y ∈ R. (3)

Plugging y = 0 in to (3), we have f af (0) = 0 = f (a). Combined with f
is injective, we get af (0) = a. Hence, a = 0 or f (0) = 1.
Consider

the case a = 0, i.e f (0) = 0. Plugging y = 0 into (1), we have
f −f (x) = 2f (x). Since f is surjective, we conclude that f (x) = −2x for
all x ∈ R. But this function is not satisfying the equation (1). Hence, a 6= 0
and we get f (0) = 1.
Plugging x = 0 into (1), we have f (−1) = 2. Plugging y = a into (3), we
have a2 = f (0) = 1, i.e a = 1 (because f (−1) = 2), i.e f (1) = 0.
Since f (1) = 1, we can write the equation (2) as the form

f f (y) = y, ∀y ∈ R. (20 )
By plugging f (y) instead of y into (1) and using (20 ), we get

f xy − f (x) = 2f (x) + xf (y), ∀x, y ∈ R.
f (x)
In this equation, consider x 6= 0 and putting y = x , we have
!
f (x)
1 = 2f (x) + xf ,
x
hence !
f (x) 1 − 2f (x)
f = , ∀x 6= 0.
x x
f (x)
By putting y = x into (1) and using the above result, we have

f 1 − 3f (x) = 3f (x), ∀x 6= 0.
Note that f is bijective and f (0) = 1, so for all x 6= 0, we can see that
1 − 3f (x) can get all real values, except −2. Therefore, from the above
result, we conclude that f (x) = −x + 1 for all x 6= −2.
In particular, f (3) = −2. Plugging y = 3 into (20 ), we have f (−2) = 3.

Therefore, f (x) = −x + 1 for all x ∈ R. It is easy to see that this function
satisfying the condition.
Problem 6
Show that
1008
k
≡ 0 (mod 20172 ).
X
1. kC2017
k=1
504
(−1)k C2017
k
≡ 3(22016 − 1) (mod 20172 ).
X
2.
k=1
Solution
1) We have changed
1008 1008 1008
X
k
X k · 2017! X 2016!
kC2017 ≡ ≡ 2017 ·
k=1 k=1
k!(2017 − k)! k=1
(k − 1)!(2017 − k)!
1007 1007
X 2016! X
k
≡ 2017 · ≡ 2017 · C2016
k=0
k!(2016 − k)! k=0
 
1007 2016
X
k 2017  X
k 1008 
≡ 2017 · C2016 ≡ · C2016 − C2016
k=0
2 k=0
2017 2016 1008

≡ · 2 − C2016 (mod 20172 ).
2
On the other hand, because 2017 is a prime so by Fermat’s little theorem:
22016 ≡ 1 (mod 2017). Moreover, we also have
1008 1009 · 1010 · · · 2016 − 1008!

C2016 −1 =
1008!
(2017 − 1)(2017 − 2) · · · (2017 − 1008) − 1008!
= .
1008!
It is easy to see that the numerator is divisible by 2017 and 1008! is coprime
with 2017 so
1008
C2016 ≡ 1 ≡ 22016 (mod 2017).
20
Therefore, the given sum is divisible by 20172 .

2) We write ab ≡ dc (mod m) for a, b, c, d ∈ Z, bd 6= 0 and m ∈ Z+ , m > 1 if
the numerator of the simplified form of ad−bc
bd is divisible by m.
First, we have remarks that, for every prime p:

p
Cpk ≡ (−1)k−1 (mod p2 ).
k
Indeed, we have
p! p (p − k + 1)(p − k + 2) · · · (p − 1)
Cpk = = ·
k!(p − k)! k (k − 1)!
so
 
k−1
p p  (p − k + 1)(p − k + 2) · · · (p − 1) − (−1) (k − 1)! 
Cpk − (−1)k−1 = .
k k (k − 1)!
It is easy to see that the expression in brackets is divisible by p so the

statement is proven.
(−1)k−1
From this, we also have p1 Cpk ≡ k (mod p). Therefore
504 504 504

2017 X 2017
(−1)k C2017
k
(−1)k (−1)k−1 (−1)2k−1
X X
≡ ≡
k=1 k=1
k k=1
k
504
1
(mod 20172 ).
X
≡ −2017
k=1
k
So we have to prove
504
1
≡ 3(22016 − 1) (mod 20172 )
X
−2017
k=1
k
or
504
X 1 3(22016 − 1)
− ≡ (mod 2017).
k=1
k 2017
Let Sn = 11 + 12 + · · · + n1 , n ∈ Z+ then 1
1 − 12 + · · · − 2n
1
= S2n − Sn . Hence
(−1)k−1
1008
X X (−1)k−1 1008
2016 X (−1)k−1
S504 = S1008 − = S2016 − − .
k=1
k k=1
k k=1
k
1008
P
1 1
Note that S2016 = k + 2017−k ≡ 0 (mod 2017) we have to prove
k=1
2016
X (−1)k−1 1008
X (−1)k−1 3(22016 − 1)
+ ≡ (mod 2017).
k=1
k k=1
k 2017
Using the above statement, we have to prove

 
1 2016
X
k
1008
X
k  3(22016 − 1)
C2017 + C2017 ≡ (mod 2017).
2017 k=1 k=1
2017
However, this is a identity because

 
2016 1008 2016
X
k
X
k k
X 1 2016
X
k 3 2017
X
k
C2017 + C2017 ≡ C2017 + C2017 ≡  C2017 − 2
k=1 k=1 k=1
2 k=1
2 k=0
3(22017 − 2)
≡ ≡ 3(22016 − 1) (mod 2017).
2
The proof is completed.
Problem 7
Let ABC be an acute triangle inscribed in the circle (O) and I is the
circumcenter of triangle OBC. The point G belongs to the arc BC
(not contains O) of (I). The circle (ABG) intersects AC at E and
circle ACG intersects AB at F (points E, F differ from A).
1. Denote K as the intersection of BE and CF . Prove that AK, BC
and OG are concurrent.
2. Let D be a fixed point on the arc BC that contains O of (I)
and GB meets CD at M , GC meets BD at N . Suppose that
M N intersects (O) at P, Q Prove that when G moves on (I), the
circumcircle of triangle GP Q always pass through two certain
fixed points.
Solution
1) We have
∠EGF = ∠BGE + ∠CGF − ∠EGF

= 360◦ − 2∠BAC − (180◦ − 2∠BAC) = 180◦
then three points E, G, F are collinear. Since ∠ABK +∠ACK = ∠AGE +

∠AGF = 180◦ then K belongs to the circle (O).
22
A
B C
F
G
It is easy to check that G is the Miquel point then two triangles GBA
and GKC are similar, which implies that ∠BGA = ∠KGC. We also
have GO is the angle bisector of ∠BGC then GO is the angle bisector of
∠AGK. Combine with OA = OK, we can conclude that AOKG is cyclic
quadrilateral. Consider the radical axis of circles (O), (AOKG), (BOC),
we can see that AK, OG and BC are concurrent.
2) In this part, we just need (O), (I) are two fixed circles that pass through
B, C, the point D is fixed on (I) while G moves on (I). By applying
 
BCD 
Pascal’s theorem for the tuple  , one can check that the line
CBG
M N passes through the intersection of the tangent line at B, C, namely
J of the fixed circle (I). Suppose that JD meet (I) at the second point
X then X is the fixed point and the quadrilateral BCDX is harmonic
then G(BC, DX) = −1.Denote T as the intersection of M N and BC then
G(BC, DT ) = −1, which means GX passes through T . Thus
T X · T G = T B · T C = T P · T Q.
Y
O Q
N
J
M
P
D
B C
I
X
This implies that (GP Q) passes through the fixed point X. Suppose that
Y is the intersection of (GP Q) and DX (which differs from X) then
JX · JY = JP · JQ = PJ/(O)
which is a constant then Y is fixed. Therefore, the circles (GP Q) passes

through two fixed points X, Y .
24
4 Solution of Vietnam TST for IMO 2017
Problem 1
There are 44 distinct holes on a line and 2017 ants. Each ant crawled
up from a hole, then moved to another hole and crawled down. Denote
T as the set of time points that the ants crawled up or crawled down
from some hole. Suppose that the speed of the ants are pairwise
distinct and they did not change its speed. Prove that if |T | ≤ 45
then there exist two ants did not meet.
Note that two ants met when there exist a time point such that they
were at the same location on the line, including the holes.
Solution
We call a time point "special" if at the time, there some ant crawled
up/down from the hole. It is easy to see that we just need to solve the
problem in case |T | = 45 (if |T | < 45, we consider some more special time
points and that will make the below argument stronger).
Consider the system of coordination Oxy in which Ox expresses to the lo-

cation of holes on the line and Oy expresses to the time. The coordination
of holes are x1 , x2 , . . . , x44 and special times are y1 , y2 , . . . , y45 .
An ant move from the point (xa , yb ) to the point (xc , yd ) if this ant crawled
from the hole xa at the time yb and move to the hole xc at the time yd .
Since that speed of ant did not change, the graph express for that moving
is a segment connect two correspondent points.
Thus in total, we have 2017 segments and since the speed of ants are
pairwise distinct, the lines have different directions. To finish the problem,
we need to show that at least two segment among them does not intersect.
Note that the number of end points of these segment is no more than
45 · 44 = 1980 < 2017 then we will prove the generalization version of this
problem as: If there are n points on the plane, then there are no more than
n segments connect them such that no two segments parallel or overlap.
(∗)
4. SOLUTION OF VIETNAM TST FOR IMO 2017 25
We shall prove (∗) by induction. It is easy to check for n = 2, 3.

For n ≥ 4, suppose that the argument is true for n − 1 points. We consider
two cases:
1. If among n points, there is one point is the end point of at most one
segment, then by removing it (also the segment has it as the end
point), we come to the case of n − 1 points.
2. If each point is the end point of at least two segments, then we will
show that the number of segments is exactly the same as the number
of points. Indeed, if there is some point is the end point of three
segments, for example the point A is the end point of AB, AC, AD.
If the point A lies inside triangle BCD then the second segment from
B cannot cut both AC and AD. Otherwise, we can suppose that the
ray AC lie between two rays AB, AD then the second segment from
C cannot cut both AB and AD. This implies that each point is the
end point of exactly two segments then the number of segment is n.
Hence (∗) also holds for n which complete the proof.
Problem 2
n .
For every positive integer n, let xn = C2n
2017k
1. Show that if < n < 2017k for some positive integer k then
2
xn is a multiple of 2017.
2. Find all positive integer h > 1 such that there exist positive
integers N, T such that for all n > N then (xn ) is a periodic
sequence mod h with period T .
Solution
26
1) We prove that the statement is true for all odd prime p instead of 2017.
pk
Suppose there exists a positive integer k such that < n < pk . We have
2

n
vp (xn ) = vp (C2n ) = vp (2n)! − 2vp (n!) .
pk
Because < n < pk so pk < 2n < 2pk < pk+1 , hence
2
$ % $ % $ %
2n 2n 2n
vp (2n!) = + 2 +···+ k .
p p p
On the other hand, for every x ∈ R, we have b2xc ≥ 2bxc, the equality
1 pk
holds for {x} < . Combined with the condition < n < pk , we have
2 2
$ % $ % $ %!
n n n
vp (2n)! > 2 + 2 +···+ k = 2vp (n!) ,
p p p
.
or vp (xn ) > 0 so we conclude that xn .. p.
2) Suppose h > 1 is the number satisfying the problem requirement. For
every odd prime number p then p | h, we have the remainders sequence
pk
xn modulo p is also periodic. Using the result of part 1), for < n < pk
2
then
xn ≡ 0 (mod p).
pk
Choose k be big enough for > T +1, we conclude that all the remainders
2
of xn divide p equal 0 for all n ≥ n0 , where n0 ∈ Z+ is large enough.
However, choose t ∈ Z+ which is large enough for pt − 1 > 2n0 and set
pt − 1
n= we have vp (xn ) = 0, so xn is not divisible by p, absurd.
2
Therefore h has only prime divisors of 2 or h = 2k with k is a positive
integer. Ik k > 1, we choose r = k − 1 and consider the number n has the
form n = 2a1 + · · · + 2ar , where a1 > max{T, N } where T, N are constants
in the hypothesis of h. Then
v2 (xn ) = 2S2 (n) − S2 (2n) = r,
where S2 (x) is the sum of the digits in the binary representation. Hence
xn ≡ 2k−1 (mod h). However, for every i ∈ Z+ that i < 2a1 then the 1
digit in the binary representation of n + i adds at least 1 unit, so that
xn+i ≡ 0 (mod h). Since a1 > max{T, N } then xn ≡ xn+T ≡ 0 (mod h),
absurd.
So k = 1 and so h = 2. This is the answer of problem, because it is easy

to see that xn is an even number for every positive integer n, as follows:
if n = 2a1 + · · · + 2ar with 0 ≤ a1 < · · · < ar then
2n = 2a1 +1 + · · · + 2ar +1
so
v2 (xn ) = 2Sn (n) − S2 (2n) = r ≥ 1.
Hence xn even. Therefore, h = 2 is the number we have to find.
Problem 3
Let ABC be a triangle with I is its incenter and the circle (I) is
tangent to BC, CA, AB at D, E, F respectively. Denote Ib , Ic as the
excenters of triangle ABC respect to vertices B, C. Let P, Q be the
midpoints of segments Ib E, Ic F . Suppose that (P AC) intersects AB
at the second point R and (QAB) intersects AC at the second point
S.
1. Prove that P R, QS, AI are concurrent.
2. Suppose that DE, DF intersect Ib Ic at K, J and EJ meets F K
at M . The lines P E, QF intersect (P AC), (QAB) at X, Y (X
differs from P and Y differs from Q). Prove that BY, CX and
AM are concurrent.
Solution
1) Since EF and Ib Ic are both perpendicular to AI then Ib Ic F E is the

trapezoid. So P Q is the midline of both trapezoid Ib Ic F E and triangle
AEF. Thus P, Q belong to the radical axis of the degenerate circle (A, 0)
and (I). Similarly, Q belongs to the radical axis of (B, 0) and (I). Hence,
QA2 = QF · QY = QB 2 , which implies that (QAB) is tangent to (I) at Y .
Similarly, (P AC) is also tangent to (I) at X.
28
Thus, (I) is the S − Mixtilinear of triangle ASB then the incenter of

triangle ABS is the midpoint N of the segment EF which implies that SQ
is the angle bisector of ∠ASB and then SQ passes through N . Similarly,
RP also passes through N . Therefore, P R, QS, AI are concurrent at the
point N .
2) In the circle (I), the line Ib Ic is the antipole of N then JE, KF, DN are
concurrent at the point M that lies on circle (I). We have the following
theorem: (Steinbart’s theorem) Let ABC be a triangle with (I) and this
circle is tangent to BC, CA, AB at D, E, F respectively. Take three points
X, Y, Z on the circle (I), then AX, BY, CZ are concurrent if and only if
DX, EY, F Z are concurrent.
By applying this, we can see that to prove three lines AM, BY, CZ are
concurrent, we have to prove that F X, EY, DM are concurrent.
We have ∠EY F = ∠AEF = ∠Ib AC then quadrilteral Ic AEY is cyclic.
Similarly, the quadrilateral AIb XF is also cyclic. These mean the point
X, Y define above are the same as definition in problem.
Consider the transformation S which is the union between the inversion
AB·AC and the reflection respect to the line R . We have S : (O) ↔
IA AI
BC, (I) ↔ (T ) with (T ) is the ex-mixtilinear respect to vertex A of triangle
ABC. This circle is tangent to AC, AB at E 0 , F 0 respectively then E ↔
E 0, F ↔ F 0.
From the Sawayama’s lemma, the excenter Ia is the midpoint of segment
E 0 F 0 . By applying the Pappus’s theorem for two tupples (Ic , A, Ib ) and
(E 0 , Ia , F 0 ), we have Ib E 0 meets Ic F 0 at the point Z which belongs to BC.
Denote G as the tangent point of (T ) with (O). We already know that

Ia G passes through the point L, the midpoint of the arc BAC of circle
(O) which is also the midpoint of Ib Ic . But Ib Ic k E 0 F 0 then since Thales’s
theorem, we have L, Z, G, Ia are collinear.
We have S : E 0 Ib ↔ (Ic AE), F 0 Ic ↔ (Ib AF ), D ↔ G, I ↔ Ia then GIa ↔

(AID). Since E 0 Ib , F 0 IC , Ia G are concurrent then circles
(AIc E), (AIb F ), (AID)
are coaxial. We have N M · N D = N E · N F = N A · N I then AM ID is

cyclic. Consider the radical axis of three circles (I), (Ic AE), (Ib AF ), we
have EY cuts F X at U which is the radical center of these circles. Con-
tinue to consider the radical axis of three circles (I), (Ic AE), (AID), we
have M D cuts EY at U 0 which is the radical center of these circles. But
(AIc E), (AIb F ), (AID) are coaxial, which implies that U ≡ U 0 .
Therefore, three lines M D, EY, F X are concurrent at U. The problem is
solved completely.
30
Problem 4
Let B, C be two fixed points on the fixed circle (O) (BC is not the
diameter of (O)). The points A moves on (O) such that AB > BC
and M is the midpoint of AC. The circle of diameter BM intersects
(O) at R. Suppose that RM intersects (O) at the second point Q
and cut BC at P . The circle of diameter BP intersects AB, BO at

the second points K, S respectively.
1. Prove that SR passes through the midpoint of KP .
2. Denote N as the midpoint of BC. The radical axis of two circles
of diameter AN, BM intersects SR at E. Prove that M E always
pass through the certain fixed point when A moves on (O).
Solution
1) It is easy to check that BQ is the diameter of circle (O). Denote I as

the intersection of SR and P K. We have
∠SP I = ∠SBK = ∠QCA
and
∠P SI = ∠P BR = ∠CQR.
This implies that two triangles P SI and CQM are similar. By the same
way, we also have two triangles KSI and AQM are similar. But M is the
midpoint of the segment AC then I is the midpoint of P K.
2) Redefine the point E as the projection of C to AB. Denote H as the in-
tersection the altitudes AD, BL of triangle ABC. Note that the quadrilat-
eral LM N D is cyclic then CM · CL = CN · CD and HA · HD = HB · HL,
which implies that CH is the radical axis of two circles of diameter AN
and BM .We have E belongs to CH then it also belongs to the radical axis
of two circles of diameter AN and BM . Since ∠BEH = ∠BRP = 90◦ then
the quadrilateral BHER is cyclic, thus
∠HRE = ∠EBH = ∠OBC = ∠P BS = ∠P RS
which implies that S, R, E are collinear. Then E is the intersection of SR

and the radical axis of two circles of diameter AN, BM.Denote X as the
intersection of EM and BQ. Let T be the midpoint of segment BC then
the quadrilateral ET M L is cyclic. Thus
∠M EC = 90◦ −∠M ET = 90◦ −∠ALT = 90◦ −∠BAC = ∠BAL = ∠BCQ.

Q
T M
E O X
K
S
L
I H
P
B N D C
This means that the quadrilateral BCXE is cyclic, and then ∠BXC =
BEC = 90◦ . Therefore, X is the projection of C onto BQ, which is a fixed
point and the line EM passes through X.
Problem 5
Given 2017 positive reals a1 , a2 , . . . , a2017 . For every n > 2017, let
n o
an = max ai1 ai2 ai3 | i1 + i2 + i3 = n, 1 ≤ i1 ≤ i2 ≤ i3 ≤ n − 1 .
Prove there exists positive integers m ≤ 2017 and N > 4m such that
an an−4m = a2n−2m for every n > N.
Solution
For every n > 0, let bn = ln an . We can reduce the problem to: Given 2017
reals b1 , b2 , . . . , b2017 . For every n > 2017, let
n o
bn = max bi1 + bi2 + bi3 | i1 + i2 + i3 = n, 1 ≤ i1 ≤ i2 ≤ i3 ≤ n − 1 .
Prove there exists positive integers m ≤ 2017 and N > 4m such that bn +
bn−4m = 2bn−2m for every n > N.
32

b` bi
Consider ` (1 ≤ ` ≤ 2017) such that ` = max i 1 ≤ i ≤ 2017 . We have
the following statement:
Claim 1. For every n ∈ Z+ :
bn b`
≤ .
n `
Proof. We prove by induction on n. The statement is clearly true for

n ≤ 2017 by the definition of `. We consider the case n > 2017. Assume it
is true for all k < n. From the definition of bn , there exists j1 , j2 , j3 ∈ N∗
satisfying j1 + j2 + j3 = n such that
bn = bj 1 + bj 2 + bj 3 .
Using the induction hypothesis, we have

b` b` b` b`
bn ≤ j1 · + j2 · + j3 · = n · ,
` ` ` `
b`
so bnn ≤ `. Therefore the statement is also true for n. The claim has
proven.
Now, for every positive integer n, let cn = nb` − `bn then from the above
claim we have cn ≥ 0 for every n. We also have, for n ≥ 2017:
cn+2` = (n + 2`)b` − `bn+2`

≤ (n + 2`)b` − `(bn + b` + b` )
= nb` − `bn = cn .
Hence
cn+2k` ≤ cn+2(k−1)` ≤ · · · ≤ cn , ∀n ≥ 2017, k ≥ 1.
Let x be the smallest positive integer such that 2x` > 2017 and set
M = max{ci | 1 ≤ i ≤ 4x` − 1}.
Then, for every n > 2x`, set n = 2kx` + r (with 0 ≤ r < 2x`), we have
cn ≤ cr+2(k−1)x` ≤ cr+2(k−2)x` ≤ · · · ≤ cr+2x` ≤ M.
We have the following statements:

Claim 2. For every positive integer n, there exist natural numbers
s1 , s2 , . . . , s2017 such that
cn = s1 c1 + s2 c2 + · · · + s2017 c2017 .
Proof. We prove by induction on n. The statement is clearly true for

n ≤ 2017 (just choose sn = 1 and si = 0 with i 6= n). We just need to
consider the case n > 2017 is sufficient. Suppose it is true for k < n. From
the definition of bn , we deduce
cn = min{ci1 +ci2 +ci3 | 1 ≤ i1 ≤ i2 ≤ i3 ≤ n−1, i1 +i2 +i3 = n}, ∀n > 2017.

Thus there exist j1 , j2 , j3 ∈ N∗ satisfying j1 + j2 + j3 = n such that
cn = cj 1 + cj 2 + cj 3 .
By the induction hypothesis, there exist natural numbers
u1 , u2 , . . . , u2017 , v1 , v2 , . . . , v2017 , w1 , w2 , . . . , w2017
such that
cj1 = u1 c1 + u2 c2 + · · · + u2017 c2017 ,
cj2 = v1 c1 + v2 c2 + · · · + v2017 c2017 ,
cj2 = w1 c1 + w2 c2 + · · · + w2017 c2017 .
Therefore, we have
cn = s1 c1 + s2 c2 + · · · + s2017 c2017 ,
where si = ui + vi + wi for 1 ≤ i ≤ 2017. Hence the statement is also true

for n. The claim has proven.
Claim 3. The sequence (cn ) get only finite values.
Proof. This statement is inferred directly from the bounded of cn and the
result of above claim.
Now, since cn get only finite values and
cn+2kx` ≤ cn+2(k−1)x` ≤ · · · ≤ cn
for every n ≥ 2017 so there exist N1 is big enough such that cn = cn−2x`
for every n > N1 . Then, we have
nb` − `bn = (n − 2x`)b` − `bn−2x` , ∀n > N1 ,
or
bn = 2b` + bn−2x` , ∀n > N1 .
34
Then, we conclude that
bn−2x` = 2b` + bn−4x` , ∀n > N1 + 2x`.
From two above results, we get
bn + bn−4x` = 2bn−2x` , ∀n > N1 + 2x`.

Choose N = N1 + 2x` and m = x`, we have the desired result.
Problem 6
For a positive integer n, consider a1 , a2 , . . . , a2n as a permutation of the
first 2n positive integers. A permutation is called nice if ai + an+i =
2n + 1, i = 1, 2, 3, . . . , n and ai − ai+1 is not congruent to aj − aj+1
modulo 2n + 1 for all 1 ≤ i < j ≤ 2n (suppose that a2n+1 = a1 ).
1. For n = 6, give an example of the nice permutation.
2. Prove that for all n, there alway exist some nice permutation.
Solution
1) We consider the following permutation 1, 2, 4, 8, 3, 6, 12, 11, 9, 5, 10, 7.

It is easy to check that 1 + 12 = 2 + 11 = 4 + 9 = 8 + 5 = 3 + 10 = 6 + 7. Fur-
thermore, the difference between two consecutive number in modulo 13 in
order are 1, 2, 4, 8, 3, 6, 12, 11, 9, 5, 10, 7, which are all distinct. Therefore,
this permutation is nice.
2) Let A be the set of nice permutation and B be the set of way to put
numbers 1, 2, . . . , 2n on the vertices of regular polygon X1 X2 X3 . . . X2n , in
such a way that:
1. The sum of two numbers belong to the end points of a diameter of
circumcircle of this polygon 2n + 1;
2. There is no consecutive numbers that has the sum is divisible by
2n + 1.
We shall prove that there is a bijection A → B and then, to prove the
existence of the nice permutation, we just need to prove |A| = |B| > 0.
First step. There is a bijection from A to B.
Consider a nice permutation in A, namely (a1 , a2 , . . . , a2n ) then for each
i = 1, 2n, we choose bi ∈ {1, . . . , 2n} such that bi ≡ ai+1 − ai (mod 2n + 1).
Then all numbers bi are pairwise distinct. We denote a2n+1 = a1 and
b2n+1 = b1 .
We put all these number onto the circle in that order, which means bi for
Xi . It is easy to see that
bi + bi+n ≡ ai+1 − ai + ai+1+n − ai+n = 2(2n + 1) ≡ 0 (mod 2n + 1).
Since 0 < bi + bi+n < 2(2n + 1), we have bi + bi+n = 2n + 1. Furthermore,

we also have
i−1
X
ai = (ai − ai−1 ) + (ai−1 − ai−2 ) + · · · + (a2 − a1 ) + a1 = a1 + bk
k=1
and ai are pairwise distinct in modulo 2n + 1, then there does not exist
two indices i, j such that
j−1
X
aj − ai = bk ≡ 0 (mod 2n + 1).
k=i
Thus, the above putting way of bi satisfies the condition of B. Consider a

way in B and bi is put on Xi , i = 1, 2n then consider the sequences
i
X
a1 = b 1 , a 2 = b1 + b2 , a 3 = b 1 + b2 + b3 , ..., ai = bk
k=1
and the sum is taken in modulo 2n + 1. Then, we can see that all numbers
ai are positive and also pairwise distinct. Otherwise, suppose that there
are some i 6= j such that ai = aj then
j−1
X
0 = aj − ai = bk (mod 2n + 1),
k=i
which is a contradiction. Furthermore, bi + bi+n ≡ ai − ai−1 + ai+n −

ai+n−1 ≡ 0 (mod 2n + 1) which implies that
ai + ai+n ≡ ai−1 + ai+n−1 (mod 2n + 1) for all i ≥ 2.
Hence, the sum ai + ai+n for all i = 1, 2n have the remainder when divide
to 2n + 1 are a ∈ {0, 1, 2, . . . , 2n}. Note that, there are 2n sums like that
and they are pairwise non overlap then
2n
X 2n
X
k= (ai + ai+n ) ≡ 2na (mod 2n + 1),
k=1 i=1
but gcd(2n, 2n + 1) = 1 then we need to have a = 0 or ai + ai+n = 2n + 1

for all i = 1, 2n. This implies that ai is a nice permutation, which belongs
to A. Then we can conclude that there is a bijection from A to B.
36
Second step. One can check that the number of putting way such that
bi + bi+n = 2n +1 for all i = 1, 2n is n! · 2n (since numbers 1 → 2n belongs to
the different pairs with the sum equal to 2n + 1 and we also can swap two
numbers on Xi , Xi+n ). We denote the set of all these ways by S. Suppose
that in some putting way of S, there is some consecutive numbers of length
k have the sum is divisible by 2n + 1 then k ≥ 3 and if we denote Sk is the
subset of S with k element, we have n · 2n−k · (n − k)! · Sk putting ways.

Indeed, we have n way to choose the start position of the sequences (it is
easy to see that k symmetric numbers respect to the center of polygon also
satisfy that property), then there are 2n − 2k remaining numbers which
are free to distribute, and the number of way to put is 2n−k · (n − k)!.
Thus, the number of putting way such that bi + bi+n = 2n + 1 but the sum
of some consecutive numbers is divisible by 2n + 1 is not more than
n
2n−k (n − k)!Sk .
X
S=n
k=3
We shall prove some estimations:

1 k−1 k−1
a) Sk ≤ C2n . Note that there are exactly C2n subset size k − 1 of
k
first 2n positive integers. For each set, there is no more than one
way to add one more number such that the sum of these numbers is
a multiple of 2n + 1. In the other hand, for each subset size k which
has the sum is a multiple of 2n + 1, there is exactly k subsets size
k−1
k − 1 of first 2n positive integers. Thus k · Sk ≤ 1 · C2n .
k−1 k−1
b) C2n ≤ 4k−1 Cn−1 for all n ≥ 5, k ≥ 3, n ≥ k (and for n = 1, 2, 3, 4 we
can point out a specific nice permutation). This can be proved by
induction on n with the following inequality
k k 2n − k + 1 k−1 n − k k−1 2n − k + 1 k−1

C2n ÷ Cn−1 = C2n ÷ Cn−1 ≤ 4 < 4k .
k k n−k
x0 x1 x2 xn
c) + + +···+ < ex for all n.
0! 1! 2! n!
Finally, we have
n n
1 k 1 k−1 k−1
2n−k (n − k)! Cn−1 2n−k (n − k)! Cn−1
X X
S≤n ≤n 4
k=3
k k=3
k
n
1X 2k e2 − (1 + 2 + 2)
= 2n n! < 2n n! < 2n n!.
4 k=3 k! 4
Therefore, |B| ≥ 2n n! − S > 0. This completes the proof.

Vietnam IMO Booklet 2017

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Vietnam IMO Booklet 2017

Uploaded by

Copyright:

Available Formats

Vietnamese Ministry of Training and Education

Vietnamese Mathematical Competitions 2017

1 Vietnamese Mathematical Olympiad 2017 7

2 Vietnamese Team Selection Test for IMO 2017 9

3 Solution of VMO 2017 11

The Vietnamese team at IMO 2017

Phan Nhat Duy Le Quang Dung Nguyen Canh Hoang

Hoang Huu Quoc Huy Pham Nam Khanh Do Van Quyet

Team Training Administrators

Le Ba Khanh Trinh Le Anh Vinh Nguyen Khac Minh

Problems from the contests

1 Vietnamese Mathematical Olympiad 2017

Problem 4. Let n be a positive integer and n > 1. The square table

for all real numbers x, y.

Problem 7. Let ABC be an acute triangle inscribed in the circle (O)

arc BC (not contains O) of (I). The circle (ABG) intersects AC at E

2 Vietnamese Team Selection Test for IMO 2017

Problem 2. For every positive integer n, let xn = C2nn .

midpoints of segments Ib E, Ic F . Suppose that (P AC) intersects AB at

Solution for the tests

3 Solution of VMO 2017

Given a real number a and consider the sequence (un ) defined by

If there exists a number n0 ∈ N such that un0 ≥ un0 +1 then we have

Similarly, we have un0 ≥ un0 +1 ≥ un0 +2 ≥ un0 +3 ≥ · · · This means that

Suppose that there exists such polynomial P (x). Let Q(x) = P (1 + x) − 1

Q(x) − x = (x3 − 2)R(x).

Because R(x) ∈ Z[x] so R 5 = a + b 5 for some a, b ∈ Z. Let x = 5

This implies 5a − 2b = 3 and 2a = 25b − 1, which has not a pair integer

∠IEH = ∠IHE = ∠BHD = ∠BDH,

which implies that BDEI is a cyclic quadrilateral. But DB cuts EI at

2) Let X be the midpoint of EF and K be the intersection of AH and

∠F SR = ∠BSL = ∠BSM = ∠F SX.

From this we can conclude that three points S, X, R are collinear or SR

Thus the minimum value of k in this case is 3.

Find all functions f : R → R such that

for all real numbers x, y.

By taking x = 1 into (1), we get

By plugging f (y) instead of y into (1) and using (20 ), we get

In particular, f (3) = −2. Plugging y = 3 into (20 ), we have f (−2) = 3.

1008 1009 · 1010 · · · 2016 − 1008!

Therefore, the given sum is divisible by 20172 .

First, we have remarks that, for every prime p:

It is easy to see that the expression in brackets is divisible by p so the

504 504 504

Using the above statement, we have to prove

However, this is a identity because

The proof is completed.

∠EGF = ∠BGE + ∠CGF − ∠EGF

then three points E, G, F are collinear. Since ∠ABK +∠ACK = ∠AGE +

G(BC, DT ) = −1, which means GX passes through T . Thus

which is a constant then Y is fixed. Therefore, the circles (GP Q) passes

4 Solution of Vietnam TST for IMO 2017

Consider the system of coordination Oxy in which Ox expresses to the lo-

We shall prove (∗) by induction. It is easy to check for n = 2, 3.

v2 (xn ) = 2S2 (n) − S2 (2n) = r,

So k = 1 and so h = 2. This is the answer of problem, because it is easy

v2 (xn ) = 2Sn (n) − S2 (2n) = r ≥ 1.

Hence xn even. Therefore, h = 2 is the number we have to find.

1) Since EF and Ib Ic are both perpendicular to AI then Ib Ic F E is the

Thus, (I) is the S − Mixtilinear of triangle ASB then the incenter of

Denote G as the tangent point of (T ) with (O). We already know that

We have S : E 0 Ib ↔ (Ic AE), F 0 Ic ↔ (Ib AF ), D ↔ G, I ↔ Ia then GIa ↔

(AIc E), (AIb F ), (AID)

are coaxial. We have N M · N D = N E · N F = N A · N I then AM ID is

Suppose that there exists such polynomial P (x). Let Q(x) = P (1 + x) − 1