Winter Schools of Mathematics Vietnam PDF

Blog TOÁN HỌC CHO MỌI NGƯỜI
−1 https://thcmn.wordpress.com/
https://www.facebook.com/thcmn/
blogtoanhocchomoinguoi@gmail.com
TRAN NAM DUNG (Chief Author)
VO THANH DAT – HOANG DINH HIEU – LUONG VAN KHAI – NGUYEN DUY TUNG
DO THUY ANH – DO TRAN NGUYEN HUY – PHAM THI HONG NHUNG – NGO HOANG ANH
PROBLEMS AND SOLUTIONS

FROM
WINTER SCHOOLS OF MATHEMATICS
IN VIETNAM
FEBRUARY, 2017
PREFACE
“THE MORE PEOPLE YOU GO WITH, THE FURTHER YOU REACH.”
Before Vietnamese Mathematics Olympiad (VMO), students in Vietnam join in some

Winter Schools of Mathematics, which are held in many areas of our country. In these schools,
many well-known Mathematics teachers try to help them review all the necessary materials
used in VMO, emphasize the most important theories, and give out mock examinations to
familiarize the students with solving the problems faster. Besides, students also receive
advice from the coaches, who participated in VMO in the past and now come back to convey
their experiences to the following generations. All these activities are to give competitors the
best preparation for their most important Mathematics Contest in their student lives.
With hope that students who want to participate in VMO next year have a useful
document to review, and international students have a good view about how Vietnamese
competitors study Math and prepare for VMO, we publish the book “Problems and Solutions
from Winter Schools of Mathematics in Vietnam”. In this attachment, we provide full
solutions to most of the exercises, but for some of them we just give simple instructions so
that readers can yourselves find out the solutions.
We really appreciate Mr. Luu Ba Thang (Ha Noi University of Education), Mr. Tran Quoc
Luat (Ha Tinh High School for the Gifted, Ha Tinh Province), Mr. Vu Nguyen Duy (Huynh Man
Dat High School for the Gifted, Kien Giang Province) for all their support. We also would like
to thank our brother Mr. Lê Phúc Lữ (FPT Software, Hồ Chí Minh City) for providing us the
LaTeX template, our friends Đỗ Hà Ngọc Anh (Lê Quý Đôn High School for the Gifted, Bà Rịa –
Vũng Tàu Province) for correcting all our grammar mistakes, and Lâm Quang Quỳnh Anh
(VNU-HCM High School for the Gifted) for designing the cover page.
This is the first time we have ever published a book in English, so we may have some
mistakes in this document. We really want to receive your comments, so that in other
projects, we will not make any mistakes at all. Please send your responses through email
blogtoanhocchomoinguoi@gmail.com. For more information and attachments,
please visit our fanpage https://www.facebook.com/thcmn/ or our blog
https://thcmn.wordpress.com/.
Thanks a lot!
.
Problems and Solutions from Winter School of Mathematics in Vietnam
Table of contents
1 PROBLEM STATEMENTS 9
1.1 Winter School of Vietnam Institute for Advanced Studying
Math . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.1.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.1.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . 11
1.2 Northern Winter School . . . . . . . . . . . . . . . . . . . . 11
1.2.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . 11
N
1.2.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . 12
1.3 Northern Central Winter School . . . . . . . . . . . . . . . 13
1.3.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . 13
CM
1.3.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.4 Southern Winter School . . . . . . . . . . . . . . . . . . . . 14
1.4.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.4.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . 15
2 SOLUTIONS 17
2.1 Winter School of Vietnam Institute for Advanced Studying
Math . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
TH
2.2 Northern Winter School . . . . . . . . . . . . . . . . . . . . 27

2.3 Northern Central Winter School . . . . . . . . . . . . . . . 35
2.4 Southern Winter School . . . . . . . . . . . . . . . . . . . . 43
7
Problems and Solutions from Winter School of Mathematics in

Vietnam
N
CM
TH
8 http://www.facebook.com/thcmn
Part 1
TH
9
CM
N
PROBLEM STATEMENTS

Vietnam
1.1. Winter School of Vietnam Institute for Ad-

vanced Studying Math
1.1.1. Day 1
Problem 1. Denote xn is the unique positive root of the following equation:
xn + xn−1 + ... + x = n + 2
Prove that the sequence (xn ) converges to a positive real number. Find that
limit.
Problem 2. Find all functions f : Q → Q satisfying these following conditions
N
for all x ∈ Q:
1. f (x + 1) = f (x) + 1.
CM
2. f x3 = f 3 (x).

Problem 3. Given two fixed point B,C lying on a circle (O). A variable point
A moves on that circle and always forms with B,C an acute-angled triangle.
d intersects line BC and (O) at D and E, respec-
The interior bisector of ABC
tively. A point F lies on the segment BC such that FD = FE.
1. Let H be the orthogonal projection of A on EF. Prove that H always

TH
lies on a fixed circle.
2. A circle (I) with center I is tangent to array AB, array AC, and line EF
at M, N, and P, respectively (Center I and point A belong to the same
half-plane in accordance to line EF). Let Q be the point on MN such
that PQ⊥EF. Prove that line AQ always passes through a fixed point.
Problem 4. At the 2016 Winter School, all teachers presented 100 Math prob-
lems (a hard problem is called “yam” ) for their students. Whether a problem
is “yam” or not, there are exactly 20 students who can solve it. To prepare
for the Ceremony, the School’s Committee will select qualified students for
the certificates. In each particular way of selection, a problem is considered
"quacky" if it is a "yam" but 20 students who have solved it aren’t awarded
the certificates, or it is not a "yam" but all 20 students who have solved it are
awarded the certificates. Prove that there exists a selection so that among 100
given problems, there are no more than 4 "quacky" problems.

Vietnam
1.1.2. Day 2
Problem 5. Determine whether there exists 2016 distinct prime numbers p1 , p2 , . . . , p2016
and positive integer n such that:
2016
1 1
∑ = .
i=1 p2i + 1 n2
Problem 6. Given an acute triangle ABC with incircle (I) is tangent to BC,CA, AB
at D, E, F, respectively. Let H be the orthocenter of 4DEF and K is the foot
of the perpendicular from H to BC.
1. Let J be the midpoint of EF. Prove that AD intersects KJ at a point

lying on (T ), which is the circumcircle of triangle DHK.
N
2. AD intersects (I) at the second point P. Let M, N are the points lying on
DE, DF, respectively, such that MPE d = NPF d = 90o . Prove that JD is
the radical axis of circle (T ) and the circumcircle of 4MNP.
CM
Problem 7. Find the smallest real constant c so that for all real numbers x, y, z
that x + y + z = 1, we have the following inequality:
3
x + y3 + z3 − 1 ≤ c x5 + y5 + z5 − 1

When will the equality holds for that value of c?

TH
1.2. Northern Winter School

1.2.1. Day 1
Problem 1. Given a positive sequence {bn }∞
n=0 such that:

b0 = 1
√ p √ (n = 1, 2, 3, ..)
bn = 2 + bn−1 − 2 1 + bn−1
Denote Sn = ∑ni=1 bi 2i . prove that the sequence {Sn } has a finite limit. Find
that limit.
Problem 2. Find all functions f : (0; +∞) → (0; +∞) such that
√ √ √
1. f (xyz) + f (x) + f (y) + f (z) = f ( xy) f ( yz) f ( zx) for all x, y, z > 0.
2. f (x) < f (y) ∀ 1 ≤ x < y.
http://thcmn.wordpress.com 11

Vietnam
Problem 3. Given an acute-angle triangle ABC (AB 6= AC) with circumcircle
(O) and orthocenter H. D and E lie on segments AB and AC respectively such
that AD = AE and D, H, E are collinear. Circle (ADE) intersects circle (ABC)
at the second point L.
1. Prove that when A moves on major arc BC of circle (O) (such that
4ABC is still a acute-angle triangle and AB 6= AC), then the tangent
line in (ADE) at D and E intersect at a fixed point.
2. Let M be the midpoint of BC. Prove that MH⊥AL.
Problem 4. For each positive integer n, denote sn as the number of ways to

represent n into the sum(s) of ordered sequence(s) with each of its terms be-
N
longs to the set {1, 3, 4}. Prove that s2016 is a perfect square.
CM
1.2.2. Day 2
Problem 5. Given ABCD as the cyclic quadrilateral of circle (O) with two
perpendicular diagonals AC and BD. AD intersects BC at P. Segment PQ is
the diameter of circle (PCD). Points M, N are the midpoints of two types of arc
CD in circle (PCD). QM intersects BD,CD at E, F respectively. QN intersects
AC,CD respectively at K, L. Prove that two circles (EDF) and (KCL) are
tangent to each other.
TH
Problem 6. Given two positive integers m and n. The sequence a(m, n) of real
numbers has the following properties:
a(0, 0) = 2, a(0, n) = 1, a(n, 0) = 2, n ≥ 1;
a(m, n) = a(m − 1, n) + a(m, n − 1), m, n ∈ N∗ .
Prove that, for each positive integer k, all the roots of the following polynomial
k
Pk (x) = ∑ a(i, 2k + 1 − 2i)xi
i=0
are real numbers.

Problem 7. A positive integer n is called beauty if for all positive integers a
and b, the following statement is true: If n | a4 b + 1 then n | a12 + b. Prove that
n is beauty if and only if n | 26 216 − 1 and 257 - n.

Vietnam
1.3. Northern Central Winter School
1.3.1. Day 1
Problem 1. Find the largest positive real number k such that the following
inequality
a2 + b2 − 2
p ≥k
2 (a + b) − 2
holds for all distinct real numbers a, b satisfying ab = 1.
Problem 2. Let f be a function satisfying the following conditions:
N

f : [1; +∞) → [1; +∞)
∀x ≥ 1.
x. f (x + 1) ≤ [ f (x)]2 − 1
CM
Prove that f (x) ≥ x + 1, ∀x ≥ 1.
Problem 3. Let ABC be a acute-angled triangle (AC > BC) with orthocenter
H and circumcircle (O). CH intersects AB at D and intersects (O) the second
time at AE. Let F be the intersection of AC and BE, I be the intersection of A
and BC, J be the intersection of AB and IF.
1. Let A0 be the reflection of A through CH. Prove that BA

BA0 = BJ
BD .
TH
2. Let K be the intersection of HA0 and BC. Prove that ODK

d = 90o .
Problem 4. Given a positive integer n. A square with side n is created from

2n(n + 1) unit segments. How many ways are there to divide those unit seg-
ments into n(n + 1) pairs, each of which have 2 unit segments satisfying all of
the following conditions:
1. In a pair, there is a vertical and a horizontal segment with the same

node, creating a L shape.
2. There are no two pairs of the division having 4 segments with the same
end. In another word, there are no two L”s” with the same vertex.

Vietnam
1.3.2. Day 2
Problem 5. Does there exist a function f : (0; +∞) → (0; +∞) satisfying
f (2016 + x f (y)) = y f (x + y + 2016) x, y > 0?
Problem 6. Let ABC be a acute-angled triangle with AB < AC and a circum-

circle (O). D is the projection of A on BC. The line passing through D; per-
pendicular to AB intersects CA at E. The line which passes through D and is
perpendicular to AC intersects AB at F. EF cuts the tangent line of (O) at A
at G. M, R are the midpoints of BC and AD, respectively.
1. Prove that GR⊥AM.
N
2. Let I, J be the intersections of DE, DF and GR, AG intersects BC at S;
K, L be the midpoints of JE, IF, respectively. Prove that OS//KL.
CM
Problem 7. Let p, q be positive integers. Write number 1 on the board and
repeat the following algorithm: Replace the current number on the board by
its sum with p or with q. Find the conditions of p, q to assure that the algo-
rithm can be repeated infinitely without creating a number on the board that
is neither a multiple of p nor a multiple of q.
TH
1.4. Southern Winter School
1.4.1. Day 1
Problem 1. Let x, y be positive real numbers such that x + y = 2.
1. Prove that
1 1
n
+ n ≥ xn+1 + yn+1 ∀n ∈ N∗ .
x y
2. For all n, can we replace n + 1 with a positive integer k (k > n + 1) so

that the inequality
1 1
n
+ n ≥ xk + yk
x y
holds true with all x, y > 0, x + y = 2?

Vietnam
Problem 2. Let (an ) be a sequence defined by:

a1 = 1, a2 = 2,
(n = 1, 2, 3, ..)
an+2 = 3an+12 −an + n12
Prove that (an ) has a defined limitation.
Problem 3. Let ABC be an acute-angled triangle with its circumcircle (I). (I)
is tangent to BC,CA, AB at D, E, F respectively. J is the midpoint of EF. BJ
and CJ intersect CA and AB at H and K; EF intersects BC and HK at M and
N, respectively. Prove that AM = AN.
Problem 4. Consider a 2n x 2n square. Each square is colored with only one
color, white or black, such that
i. The number of black squares on each line are pairwise different.
N
ii. The number of black squares on each column are pairwise different.
1. How many black squares are there in the square?
CM
2. How many pairs of consecutive color-different squares? (Two squares
are called consecutive if and only if they have a same side.)
1.4.2. Day 2
Problem 5. Find all functions f: R → R with the property that
f ( f (x) + 2y) = 10x + f ( f (y) − 3x)
TH
holds for all x, y ∈ R.

Problem 6. There are 23 positive integers (not necessarily distinct) written
on a line. Prove that we can place the symbols “+”, “x” or the parentheses
reasonably so that the obtained expression is divisible by to 2000.
Problem 7. Let ABC be a triangle and P be a point inside. D is the pro-
jection of P on BC. E, F are the points satisfying the following conditions:
PE⊥AC,CE⊥BC, PF⊥AB, BF⊥BC, G is symmetric to D through BC.
1. Prove that AG⊥EF.
2. Let S, T be the intersection of EF and CA, AB, respectively. Q, R are
symmetric to P through the midpoints of GE, GF. (l1 ) be the line that
passes through S and perpendicular to AQ, (l2 ) be the line that passes
through T and perpendicular to AR. Prove that (l1 ) and (l2 ) intersect at
a point on AG.

Vietnam
N
CM
TH
Part 2
SOLUTIONS
TH
17
CM
N

Vietnam
2.1. Winter School of Vietnam Institute for Ad-

vanced Studying Math
Problem 1
Denote xn is the only root of the following equation:
xn + xn−1 + ... + x = n + 2
Prove that the sequence (xn ) converges to a positive real number. Find
that limit.
Solution. Notice xn > 1 for all n ∈ N∗ . We will prove that xn > xn+1 . Consider
N
the polynomial Pn (x) = xn + xn−1 + · · · + x, we could see that Pn (x) is mono-
tonically increasing on the interval (0, +∞) for all n ≥ 1. From Pn (xn ) = n + 2
and Pn+1 (xn+1 ) = (n + 1) + 2, we get
CM
Pn+1 (xn+1 ) = Pn (xn ) + xnn+1 > n + 3.
So xn > xn+1 . That means the sequence (xn ) converges to a real limit. Thus
that limit is 1 cause for every a > 1, there exist a large enough integer n such
that an > n + 2.
Problem 2
TH
Find all functions f : Q → Q that satisfy these following conditions for

all x ∈ Q:
i. f (x + 1) = f (x) + 1.
ii. f x3 = f 3 (x).

Solution. From the first condition, we can prove that:
f (x) = x + n ∀x ∈ Q, n ∈ Z. (2.1.2.1)
Also, as all x ∈ Q could be represented as x = qp (p, q ∈ Z, q ≥ 2). We fix a

positive integer k ≥ 2. On the one hand, by using (2.1.2.1) and the second
condition, we have:
3 ! 3
p k p 2 k−2 2k−1 6k
f +q =f + 3p .q + 3p.q +q
q q3

Vietnam
3
p
=f 3
+ 3p2 .qk−2 + 3p.q2k−1 + q6k
q

p
3
=f + 3p2 .qk−2 + 3p.q2k−1 + q6k . (2.1.2.2)
q
On the other hand, using the second condition will result in:
3 ! 3 3
p p p
f + qk =f + qk = f +q k
q q q
2
p 3 p p
.q2k + q6k .
N
k
=f +3f .q + 3 f (2.1.2.3)
q q q
Comparing (2.1.2.2) and (2.1.2.3) and dividing both sides byq2k , we get
CM
2
p2

p 1 p p
f . k+f = k+2 +
q q q q q

Now, by letting k → +∞ : f qp = qp .
Conversely, we can easily check that f (x) = x is a valid solution.
TH
Problem 3
Given two fixed point B,C lying on a circle (O). A variable point A moves
on that circle and always forms with B,C an acute-angled triangle. The
d intersects line BC and (O) at D and E, respec-
interior bisector of ABC
tively. A point F lies on the segment BC such that FD = FE.
1. Let H be the orthogonal projection of A on EF. Prove that H al-

ways lies on a fixed circle.
2. A circle (I) with center I is tangent to array AB, array AC, and line
EF at M, N, and P, respectively (Center I and point A belong to the
same half-plane in accordance to line EF). Let Q be the point on
MN such that PQ⊥EF. Prove that line AQ always passes through a
fixed point.

Vietnam
N
CM
TH
Solution.
1. Since EF and BC are anti-parallel lines of BAC,

d A, O, H are collinear.
Thus H lies on the fixed circle of diameter OE.
2. Assume that EF intersects AB, AC at K, L respectively. We will prove

that AQ passes through the midpoint J of KL.
• Assume that PQ intersects (I) and line d passed through A in

parallel to EF at R and S. Since d is the polar of Q in the cir-
cle (I) (MN is the polar of point A and AS⊥IQ), we can infer
that (P, Q, R, S) = −1 ⇒ A (P, Q, R, S) = −1. Thus if EF intersects
AR, AQ at J, G respectively, then JG = JE.
• Also, KG = LE since G is the tangent point of the excircle rela-
tive to angle A of 4AKL (from the homothecy (A, AGAR )), J is the

Vietnam
midpoint KL. Since BC and KL are anti-parallel lines, AQ is the
symmedian through A of 4ABC. So AQ passes through the in-
tersection of tangents at B and C to circle (O), which is a fixed
point.
Comment. Other solutions to prove AQ passes through midpoint J of KL.
• Solution 2: AD intersects MN at W . A line passing through Q and KL in-

tersects AB, AC at U,V respectively. We can easily conclude that IUMQ
d = IMN,
and INV Q are cyclic. Then IUV d IVU d = INM.d Thus 4IUV is
an isosceles triangle with IV = IU. Therefore, Q is the midpoint of
N
UV ⇒ J is the midpoint of KL.
• Solution 3: M, Q, N are the foot of the perpendicular lines from I to

three sides of triangle AUV . According to Simson theorem, I lies on the
CM
circumcircle of 4AUV . Furthermore, I lies on the interior bisector of
angle A. From Q is the midpoint of UV , J is the midpoint of KL.
Problem 4
At the 2016 Winter School, all teachers presented 100 Math problems (a
hard problem is called "yam" ) for their students. Whether a problem is
TH
“yam” or not, there are exactly 20 students who can solve it. To prepare
for the Ceremony, the School’s Committee will select qualified students
for the certificates. In each particular way of selection, a problem is con-
sidered "quacky" if it is a "yam" but 20 students who have solved it aren’t
awarded the certificates, or it is not a "yam" but all 20 students who have
solved it are awarded the certificates. Prove that there exists a selection
so that among 100 given problems, there are no more than 4 "quacky"
problems.
Solution. Calling the number of students n, we can see that n ≥ 20 since a

problem was solved by exactly 20 students. We need to show that the Com-
mittee could select some students for certificates so that no problems are
"quacky". Assume that the opposite statement is true, which means every se-
lection has at least one "quacky" problem. We will count the number of pairs
(K, b), in which K is a way to give certificates and b is a "quacky" problem
from the K way, by counting in two ways.

Vietnam
1. Firstly, by using induction, we easily get there are total 2n ways to give
certificates with at least a "quacky" problem in each way. So the number
of pairs (K, b) is no less than 2n .
2. Secondly, an arbitrary problem b could only be "quacky" if it is a "yam"

with 20 students are all awarded, or it is not a "yam" and none of those
students is awarded. Thus a problem b could only have 2n−20 K ways to
let b become a "quacky" problem in the K way. Therefore, the number
of pairs (K, b) is equal to 100. 2n−20 .
Comparing these two ways, we obtain 100.2n−20 ≥ 2n , or 100 ≥ 220 , contra-

diction.
N
Problem 5
Determine whether there exist 2016 distinct prime numbers p1 , p2 , . . . , p2016

and positive integer n such that:
CM
2016
1 1
∑ 2
=
i=1 pi + 1 n2
Solution. Assume that there exist 2016 distinct prime numbers p1 , p2 , . . . ., p2016
and a positive integer n such that
TH
2016
1 1
∑ 2
=
i=1 pi + 1 n2
Denote
!
2016 2016
P
p2i + 1 ⇒ n2 .

P= ∏ ∑ = P. (2.1.5.1)
i=1 i=1 p2i + 1
1. Solution 1: We solve the problem by using the congruence relation by

modulo 3 for equation (2.1.5.1).
• If pi 6= 3 for all i, then p2i +1 ≡ −1 (mod 3). Then P ≡ 1 (mod 3)

and each fraction p2P+1 ≡ −1 (mod 3). So the left side of the
i
equality is divisible by 3 and the right side is not, contradiction.
• If there is a number j such that p j = 3, p2j + 1 ≡ 1 (mod 3), and
for 2015 numbers i 6= j, p2i + 1 ≡ −1 (mod 3). Thus P ≡ −1

Vietnam
1
(mod 3). In the sum ∑2016
i=1 p2i + 1
, there’s one term that is congru-
ent to −1 (mod 3), and 2015 terms are congruent to 1 (mod 3),
thus the sum ≡ 1 (mod 3). Combining with n2 ≡ 1, 0 (mod 3), we
have a contradiction, since the left side of the equation is ≡ −1
(mod 3).
Therefore, there do not exist 2016 prime numbers and positive integer
n that satisfy the problem’s condition.
2. Solution 2:

• If there is a number pi = 2, then v2 p2j + 1 = 1for all odd num-

bers p j , so v2 (P) = 2015. Also, v2 p2P+1 = 2014 for all j 6= i
N
j

and v2 p2P+1 = 2015 if j = i. From there, if we put 22014 as the
j
common factor for the sum ∑2016 P

i=1 p2 +1 , then we remain a sum of
CM
i
2015 odd terms and 1 even term. Thus:
!
2016
P
v2 ∑ 2 = 2014,
i=1 pi + 1
Therefore, v2 n2 = 1. Contradiction!

• Assume that all pi numbers are odd, then v2 (P) = 2016. Also,
for all i, p2i + 1 has the form of 8k + 2 = 2 (4k + 1). Thus, every
TH
term p2P+1 has the form of 22015 (4k + 1). After putting 22015 as the
i
common factor of the sum ∑2016
i=1
P
p2i +1
, we will have a sum of 2016
of them ≡1 (mod 4), and the sum ≡ 0 (mod 4).
terms with each
Therefore, v2 ∑2016 P
i=1 p2 + 1 ≥ 2015 + 2 > v2 (P) . Contradiction!
i
So our assumption is false, and the problem is solved.

Vietnam
Problem 6
Given an acute-angled triangle ABC with incircle (I) is tangent to BC,CA, AB

at D, E, F, respectively. Let H be the orthocenter of 4DEF and K is the
foot of the perpendicular from H to BC.
1. Let J be the midpoint of EF. Prove that AD intersects KJ at a point

lying on (T ), the circumcircle of triangle DHK,.
2. AD intersects (I) at the second point P. Let M, N are the points ly-
d = NDF
ing on DE, DF, respectively, such that MPE d = 90o . Prove
that JD is the radical axis of circle (T ) and the circumcircle of
4MNP.
N
CM
TH
Solution.
1. • Solution 1: Let E 0 , F 0 be the feet of the attitudes from E, F of

∆DEF respectively. As KDE 0 F 0 is an isosceles trapezoid, K, D, E 0 , F 0
and H lie on the circle with diameter HD. Also, 4KF 0 E 0 = 4DE 0 F 0 ∼
4DEF and KJ, DA are the symmedians inside 4KF 0 E 0 and 4DEF
respectively ⇒ Fd d ⇒ F 0 KDL is a cyclic quadrilateral.
0 KJ = EDA
So L ∈ (T ) .
• Solution 2: If DI meets (I) at S then H, J, S are collinear and HJ =

Vietnam
d = JDS
JS. Also, HDA d (DH, DI) is the isogonal pair) and JDS
d=
d (HJ = JS) ⇒ HDL
HKJ d = HKL d ⇒ L ∈ (T ) .
2. • Solution 1: First, we prove that (MNP) is the Appolonius circle

(C) of vertex D ∈ 4DEF. As P is the intersection of the symme-
dian and (DEF) , P ∈ (C). Thus (I) and (C) have D, P as common
points. Both line DEM and circle (C) have the common point D,
d = 90o ⇒ M ∈ (C). Similarly, point N also lies on circle
with EPM
(C). Thus (MNP) ≡ (C).
Second, we prove that the intersection Q of DJ and (T ) lies on
(C). By algebraic calculation
EJ
JE 2 = FF 02 = JQ.JD ⇒ 4JFQ ∼ 4JDE ⇒ QE = ED. .
DJ
N
FJ QE ED
By the same argument, we get QF = FD. DJ ⇒ QF = FD ⇒Q∈
(C). Therefore, DJ is the radical axis of circle (C) and (T ).
CM
• Solution 2:
d = 90o − NFP
– PND d = 90o − PED d = PMD d ⇒ D ∈ (MNP).
Note that PQ//HD ⇒ PQJ = HDQ = HDP
d d d + PDJ.d On the
other hand, (DP, DJ) and (DH, DS) are isogonal pairs ⇒ HDP
d =
d Thus PQJ
JDS. d ⇒ PQJ
d = PDS d + PEDd = 90o . Also, DNPd +
o
d = 90 ⇒ PQJ d = DNP d ⇒ DNPQ is a concyclic quadri-
NFP
lateral ⇒ Q ∈ (MNP).
TH
– Now let DJ, DH intersect (I) at U,V respectively. Note that

DP is the symmedian of 4DFE and 4FPE, so
(
4DFJ ∼ 4DPE d = PED
FJD d
⇒ ⇒ FJD
d = FJP.d
4FPJ ∼ 4DPE d = PED
FJP d
(2.1.6.1)
Besides, VdPJ = Vd PF + FPJ.
d Since Vd PF = EPSd (due to the
isogonal pairs) and FPJ = DPE (due to the similar triangles),
d d
VdPJ = DPE
d + EPS d = 90o . Thus Vd
PJ = HQJ d = 90o ⇒ H
and V are symmetric about FE. Combining with (2.1.6.1), P
and Q are symmetric about FE, which means PQ//HD.

Vietnam
Problem 7
Find the smallest real constant c so that for all real numbers x, y, z that
x + y + z = 1, we have the following inequality:
3
x + y3 + z3 − 1 ≤ c x5 + y5 + z5 − 1

When will the equality holds for that value of c?
Solution. Assume that constant c satisfies the given assertion. With x = y =

z = 31 , we get
8 80
≤ c.
9 81
N
9 9
or c ≥ 10 . We prove that c = 10 is the minimum value satisfying the assertion
of the problem.
From x + y + z = 1, we have
CM
x3 + y3 + z3 − 1 = x3 + y3 + z3 − (x + y + z)3 = −3 (x + y) (y + z) (z + x),
x5 + y5 + z5 − 1 = x5 + y5 + z5 − (x + y + z)5
5
= − (x + y) (y + z) (z + x) [(x + y)2 + (y + z)2 + (z + x)2 ].
2
Therefore, if the denominator differs to 0,
TH
5
x + y5 + z5 − 1 5 h i 5 [2 (x + y + z)]2 10
2 2 2
= (x + y) + (y + z) + (z + x) ≥ . =
|x3 + y3 + z3 − 1| 6 6 3 9
From this, we can conclude that for all real number x, y, z that satisfy x + y +
z = 1,
x + y3 + z3 − 1 ≤ 9 x5 + y5 + z5 − 1
3
10
By simple calculation, we obtain that the equality holds for x = y = z = 13 or
(x, y, z) as the permutation of (a, −a, 1) in which a is some real number.
Comment. The inequality is also true with x3 + y3 + z3 = 0.

Vietnam
2.2. Northern Winter School

Problem 1
Given a positive sequence {bn }∞

n=0 such that:

b0 = 1
√ p √ (n = 1, 2, 3, ..)
bn = 2 + bn−1 − 2 1 + bn−1
Denote Sn = ∑ni=1 bi 2i . prove that the sequence {Sn } has a finite limit.
Find that limit.
√
Solution. Denote an = 1 + bn , n ≥ 0. Then an > 1, a0 = 2. Also, an =
N
√ −n 2−n
an−1 ⇒ an = 22 . Thus Sn = 2 − 2. 2 2−n−1 . Let n → ∞, we obtain
2x − 1

lim Sn = lim 2 − 2. = 2 − 2. ln 2.
CM
n→∞ x→0 x
Problem 2
Find all functions f : (0; +∞) → (0; +∞) such that

√ √ √
1. f (xyz) + f (x) + f (y) + f (z) = f ( xy) f ( yz) f ( zx) ∀ x, y, z > 0.
TH
2. f (x) < f (y) ∀ 1 ≤ x < y.
Solution.
• Replace x = y = z = 1 in (1), 4 f (1) = f (1)3 so f (1) = 2.
• Replace x = ts, y = st , z = st in (1), we get f (t) . f (s) = f (t.s) + f t

s .
• Replace s = 1 : f (t) = f 1t .

• Combine with condition (2), we get f (t) ≥ f (1) = 2 ∀t > 0. Therefore,

1
there exist g (t) ≥ 1 such that f (t ) = g (t) + g(t) .
• By induction and condition (1), we get g (t n ) = gn (t) ∀n ∈ Z. Then

g (t q ) = gq (t) for all q ∈ Q. Thus for every fixed number t > 1, we
have f (t q ) = aq + a−q , a = g (t) , and q ∈ Q.

Vietnam
• Since f is a monotonic function on the range (0; 1] and [1, +∞), then
f (t r ) = ar + a−r for all real number r. Therefore, if k satifies t k = a,
then
f (x) = xk + x−k ∀x ∈ R.
Problem 3
Given an acute-angle 4ABC(AB 6= AC) with circumcircle (O) and or-

thocenter H. D and E lie on segments AB and AC respectively such that
AD = AE and D, H, E are collinear. Circle (ADE) intersects circle (ABC)
at the second point L.
N
1. Prove that when A circulates on major arc BC of circle (O) (such
that 4ABC is still a acute-angle triangle and AB 6= AC), then the
tangents in (ADE) at D and E intersect at a fixed point.
CM
2. Let M be the midpoint of BC. Prove that MH⊥AL.
TH
Solution. Without loss of generality, we can assume that AB < AC. Let F and
G be the feet of the altitudes at points A and B of 4ABC, N is the midpoint of

Vietnam
minor arc BC of circle (O). Then O, M, N are collinear, line AN is the interior
bisector of BAC
d and also the perpendicular bisector of segment DE. Let I be
the center of circle (ADE) and P be the intersection of DE and AN.
1. We will prove that all two tangents at D and E of (ADE) pass through
d = EDN
N. Equivalently, we need to prove that DEN d = A (angle A of
triangle ABC). By algebraic calculation, we can obtain these equalities:
B−
b Cb
• HAP
d =
2 (Denote Bb and Cb as the angles of 4ABC).
• AH = 2R. cos A (R is the radius of circle (O)).
d = 2R. cos A. cos B−
• AP = AH. cos HAP
b Cb
2 .

N
• AN = 2R. sin Cb + A2 = 2R. cos B−2 C .
b b b
• PE = AP. tan A2 = 2R. cos A. cos B−2 C . tan A2 .

b b b b
CM
From these, we have:
2R. cos B−2 C − 2R cos A. cos B−2 C

d = PN = AN − AP =
b b b b
tan DEM
PE PE 2R cos A. cos B−C
b b
2
1 − cos A 2 sin2 A2 . cos A2 A

= A
= A A
= tan
cos A. tan 2 cos 2 . sin 2 2
TH
d = A.
Thus DEN d = A.
b Similarly, EDN b Therefore, two tangents at D and
E to the circle (ADE) intersect at the fixed point N when point A circu-
lates on major arc BC of circle (O).
2. Because OI⊥AL, we need to prove that MH k OI. It follows that we

prove HMOJ is a parallelogram, with J is the intersection of OI and
AH, and, specifically, OM = HJ. We already obtain that OM = 2AH =
R. cos A. Thus proving AJ = R. cos A is sufficient to obtain the given as-
sertion. Indeed, 4AJI ∼ 4NOI, so, with r is the radius of circle (ADE):
AJ ON ON Rr Rr
= ⇒ AJ = AI. = =
AI IN IN AN − AI AN − r
Also,
DE PE 2R.cos A.cos B−2 C
b b
r= = =
2cos2 A2

2. sin A sin A

Vietnam
Therefore,
2R.cos A.cos B−2 C

b b
R
Rr 2cos2 A2
b
AJ = =
B−
b Cb 2R.cos A.cos B−2 C
b b
2R.cos 2 −r 2R.cos B−
b Cb
−
2 2cos2 A2
b
R.cos A
= = R. cos A,
2 cos2 A2 − cos A
b
and we have proved the required assertion.
Problem 4
N
For each positive integer n, denote sn as the number of ways to represent
CM
n into the sum(s) of ordered sequence(s) with each of its terms belongs
to the set {1, 3, 4}. Prove that s2016 is a perfect square.
Solution. Notice that s1 = 1, s2 = 1, s3 = 3, s4 = 4 since:
1=1
2 = 1+1
TH
3 = 1+1+1 = 3
4 = 1+1+1+1 = 1+3 = 3+1 = 4
For n = 5, we consider these following cases:
i. If the last term of the sum is 1 then the numbers of ways to represent is
sn−1 .
ii. If the last term of the sum is 3 then the numbers of ways to represent is
sn−3 .
iii. If the last term of the sum is 4 then the numbers of ways to represent is
sn−4 .
From these cases, we obtain the recurrence relation as below:

s1 = 1, s2 = 1, s3 = 3, s4 = 4
sn = sn−1 + sn−3 + sn−4 , n ≥ 5

Vietnam
To prove s2016 is a perfect square, we prove that for all positive integer n, s2n
is also a perfect square. By direct calculation, s2 = 1, s4 = 22 , s6 = 32 , s8 =
52 , s10 = 82 , We can easily predict this statement: s2n = Fn+1
2 , with (F ) is the
n
Fibonacci Sequence, and prove this by induction.
• With n = 1, the statement is true.
• Assume that the statement is true for all positive integer k ≤ n = 2m.
Using the property of the Fibonacci Sequence, we have
s2m+2 = s2m+1 + s2m−1 + s2m−2
N
= (s2m + s2m−2 + s2m−3 ) + s2m−1 + s2m−2
CM
= s2m + 2s2m−2 + (s2m − s2m−4 )
2
= 2Fm+1 + 2F 2m − Fm−1
2
= (Fm+1 + Fm )2 + (Fm+1 − Fn )2 − Fm−1

2
2 2 2 2
TH
= Fm+2 + Fm−1 − Fm−1 = Fm+2 .
Therefore, the statement is also true for n = 2m + 2. By induction, we have

proven the statement, which means s2016 is a perfect square.
Problem 5
Given ABCD as the cyclic quadrilateral inscribed in circle (O) with two
perpendicular diagonals AC and BD. AD intersects BC at P. Segment PQ
is the diameter of circle (PCD). Points M, N are the midpoints of two
types of arc CD in circle (PCD). QM intersects BD,CD at E, F respec-
tively. QN intersects AC,CD respectively at K, L. Prove that two circles
(EDF) and (KCL) are tangent to each other.

Vietnam
N
CM
Solution. Let S be the intersection of AC and BD. The bisector of ASD
d inter-
sects AD, BC at R,U respectively.
• DRU
d = DAS
d + ASR
d = CBD
d + BSU d ⇒ 4PRU is isosceles at P.
d = CUR
TH
• PM is the bisector of PRU

d ⇒ PM ⊥ RU ⇒ PM is parallel to the bisector
d ⇒ Sx ⊥ MQ. Besides, DSC
Sx of DSC d = 90o ⇒ SEQ
d = 45o . But ESKQ
is an inscribed quadrilateral ⇒ LKC d = 45o .
d = SEQ
• Let T 6= C is another intersection of (CD) and (KCL) ⇒ LKC

d = LTC
d =
o
45 ⇒ DT L = 45 .
d o
• M, N are the midpoints of arc CD respectively ⇒ QM, QN are the bi-

d ⇒ (DCLF) = −1, but DTC
sectors of DQC d = 90o ⇒ TC is the bisector
dF ⇒ LT
of LT dF = 90o ⇒ DT dF = 135o ⇒ DT d = 180o ⇒ T ∈
dF + DEF
(DEF).
• Construct the tangent Ty of (LTC). yT

d D = yT dL = TCL−
dL− DT d CT dF =
TdFD ⇒ Ty is also the tangent of (DEF) ⇒ our two circles are tangent
to each other.

Vietnam
Problem 6
Given two positive integers m and n. The sequence a(m, n) of real num-
bers has the following properties:
a(0, 0) = 2, a(0, n) = 1, a(n, 0) = 2, n ≥ 1;
a(m, n) = a(m − 1, n) + a(m, n − 1), m, n ∈ N∗ .

Prove that, for each positive integer k, all the roots of the following poly-
nomial
k
Pk (x) = ∑ a(i, 2k + 1 − 2i)xi
i=0
are real numbers.
N
Solution. Let Qk (x) = ∑ki=0 a (i, 2k − 2i) xi . From the sequence a(m, n), we
have:
CM

Pk (x) = xPk−1 (x) + Qk (x)
Qk (x) = xQk−1 (x) + Pk−1 (x)
It follows that Qk (x) = Pk (x) − xPk−1 (x) and therefore:
Pk (x) = (2k + 1) Pk−1 (x) − x2 Pk−1 (x) , k ≥ 2.
with P1 (x) = 3x + 1 and P2 (x) = 5x2 + 5x + 1.

We prove the following statement: For each integer k ≥ 2, all the roots of the
TH
polynomials Pk (x) and Pk−1 (x) are all real numbers and are distinct from each
other. Specifically, if a1 < a2 < a3 . . . . < ak−1 and b1 < b2 < b3 · · · < bk are
all the roots of Pk−1 (x) and Pk (x) respectively, then:
b1 < a1 < b2 < a2 . . . . < ak−1 < bk
That statement can be proved by induction and by considering the sign of

Pk+1 (x) based on considering that of Pk (x) and Pk−1 (x) .
Comment.
1. 0 is not the root of Pk (x) , k ≥ 1. Therefore, the sign of Pk (x) and that
of x2 .Pk (x) are always the same.
2. The coefficient of xk of Pk (x) is a (2k, 1) > 0, thus Pk (+∞) > 0 , and

the sign of Pk (−∞) depends on whether k is odd or even.

Vietnam
Problem 7
A positive integer n is called beauty if for all positive integers a and b,

the following statement is true: If n | a4b + 1 then n | a12 + b. Prove that
n is beauty if and only if n | 26 216 − 1 and 257 - n.
Solution. Consider a positive integer a such that (a, n) = 1. Then, there exists
b such that a4 b + 1 ≡ 0 (mod n). As a16 ≡ 1 (mod n), we have just proven
that for all (a, n) = 1, a16 ≡ −1 (mod n).
• If n is odd, choose a = 2, we get n | a16 − 1 = 3.5.17.257 = M.
• If n is even, rewrite n = 2t .n1 (t ∈ Z+ , n1 ∈ Z+ , n1 is odd). Choose a =

n1 + 2, then a is odd and (a, n1 ) = 1. As a16 − 1 ≡ 0 (mod n), a16 −
N
1 ≡ 0 (mod n)1 ⇒ n1 | M. On the other hand, choose a ≡ 5 (mod 8)
and a ≡ 1 (mod n)1 . We have v2 (a16 − 1) = v2 (a2 − 1) + v2 (16) − 1 =
3 + 4 − 1 = 6 ⇒ t ≤ 6. So n | 26 (216 − 1). Choose a = 7, we get
CM
n | 716 − 1 = (72 − 1)(72 + 1)(74 + 1)(78 + 1),
so n is not divisible by 257, which means n | 26 .3.5.17.
Now, assume that n | 26 .3.5.17, and a, b ∈ N∗ such that n | a4 b + 1.
• If 2t | n (t = 1, 2, 3, 4, 5, 6), then from 2t | a4 b + 1 and 26 | a16 − 1, we get

2t | a4 (a8 + b) ⇒ 2t | b + a8 .
TH
• If 3 | n, then a4 ≡ 1 (mod 3) ⇒ b ≡ −1 (mod 3). So a8 +b ≡ 0 (mod 3).
– If 5 | n | a4 b + 1, then a4 ≡ 1 (mod 5) ⇒ b ≡ −1 (mod 5). So,

5 | a8 + b.
– If 17 | n | a4 b+1, then a1 6 ≡ 1 (mod 1)7 ⇒ 17 | a4 (a8 +b) ⇒ 17 | a8 +
b.
In conclusion, all n such that n | 26 (216 − 1) are beautiful numbers.

Vietnam
2.3. Northern Central Winter School

Problem 1
Find the largest positive real number k such that the following inequality
a2 + b2 − 2
p ≥k
2 (a + b) − 2
holds for all distinct real numbers a, b satisfying ab = 1.
Solution. We need to find the largest positive real number k such that
N
1
a2 + 2 − 2
k≤ s a ∀ a > 0, a 6= 1.
1
2 a+ −2
CM
a
Consider the function

a2 + a12 − 2
f (a) = q ∀ a > 0, a 6= 1
2 a + 1a − 2

q q
2 1 1
2 1

a + a2 − 2 2 a+ a +2 (a + 1) 2 a+ a +2
TH
= = ,
2 a + a1 − 4

2a
so lim f (a) = 8. In addition,
a→1
4(a + 1)2
f (a) > > 8 ∀ a > 0, a 6= 1,
2a
so k = 8 satisfies the condition of the problem.
Assume that there exists another positive real number k > 8 satisfying the
condition of the problem, which means k ≤ f (a); ∀a > 0, a 6= 1. As lim f (a) =
a→1
8, lim f 1 + 1n = 8. So for ε = k − 8, there exists M ∈ N∗ such that

n→+∞

f 1 + 1 − 8 < ε = k − 8 ∀ n > M.

n

1
⇒ f 1+ < k; ∀n > M,
n

Vietnam
contradiction. So our assumption is false, which means k = 8 is the largest
positive real number that makes our inequality hold true.
Problem 2
Let f be a function satisfying the following conditions:

f : [1; +∞) → [1; +∞)
∀x ≥ 1.
x. f (x + 1) ≤ [ f (x)]2 − 1
Prove that f (x) ≥ x + 1, ∀x ≥ 1.
Solution.
N
• Firstly, by induction, we prove that
1
f (x) > x1− 2n ∀ n ∈ N∗ , x ≥ 1. (2.3.2.1)
CM
– f (x + 1) ≥ 1 ⇒ x f (x + 1) ≥ x ⇒ ( f (x))2 ≥ x + 1 > x. So (2.3.2.1)
is true for n = 1.
Suppose that (2.3.2.1) is true until n = k ≥ 1. We have
1 1
1− 1−
f (x + 1) > (x + 1) 2k >x 2k
1 1
2− 1−
⇒ ( f (x))2 > ( f (x))2 − 1 ≥ x f (x + 1) > x 2k ⇒ f (x) > x 2k+1 .
TH
So (2.3.2.1) is true for n = k + 1, and by induction, it is true ∀ n ∈

N∗ .
– From (2.3.2.1), let n → +∞, we get f (x) ≥ x, ∀x ≥ 1.
• Now, one more time by induction, we prove that
1
f (x) > x + 1 − ∀ n ∈ N∗ , x ≥ 1. (2.3.2.2)
2n
2
– f (x + 1) ≥ x + 1 ⇒ ( f (x))2 ≥ x(x + 1) + 1 > x + 12 ⇒ f (x) >
x + 12 . So (2.3.2.2) is true for n = 1.
Suppose that (2.3.2.2) is true till n = k ≥ 1. We have
1 1
f (x + 1) > (x + 1) + 1 −
k
= x+2− k
2 2
2
1 1 1 1
⇒ ( f (x))2 > x x + 2 − k + 1 = x + 1 − k+1 + k − k+1
2 2 2 4

Vietnam
2
1
> x + 1 − k+1 .
2
So (2.3.2.2) is true for n = k + 1, and by induction, it is true ∀ n ∈
N∗ .
– From (2.3.2.2), let n → +∞, we get f (x) ≥ x + 1, ∀x ≥ 1.
Problem 3
Let ABC be an acute triangle (AC > BC) with orthocenter H and circum-
circle (O). CH intersects AB at D and interscts (O) the second time at E.
N
Let F be the intersection of AC and BE, I be the intersection of A and
BC, J be the intersection of AB and IF.
1. Let A0 be the reflection of A through CH. Prove that BA

BA0 = BJ
BD .
CM
2. Let K be the intersection of HA0 and BC. Prove that ODK
d = 90o .
TH
Solution.

Vietnam
JA DA JA − JB DA − DB
1. F(I, D, B,C) = −1 ⇒ (JDBA) = −1 ⇒ = ⇒ = ⇒
JB DB JB DB
AB A B 0 BA0 BD
= ⇒ = .
JB DB BA BJ
2. We can easily prove that AEA0 H is a rhombus ⇒ HA0 //AE ⇒ BK BI =
BA 0 BD 0
BA = BJ ⇒ DK//IJ. So, according to Brocard’s theorem, we get HA //AE ⇒
BK BA0 BD
BI = BA = BJ ⇒ DK//IJ. So, according to Brocard’s theorem, we get
OD⊥IJ ⇒ ODKd = 90o .
Problem 4
N
Let be given a positive integer n. A square with side n is created from
2n(n + 1) unit segments. How many ways are there to divide those unit
segments into n(n + 1) pairs, each of which have 2 unit segments satisfy-
CM
ing all of the following conditions:
1. In a pair, there is a vertical and a horizontal segment with the same

end, creating a L shape.
2. There are no two pairs of the division having 4 segments with the
same end. In another word, there are no two L”s” with the same
vertex.
TH
Solution. The net has (n + 1)2 vertices. We call those that are vertices of a
letter L is a conjunction vertex.
• According to the conditions above, there are no two letters L that have
the same vertex. As a result, the number of conjunction vertices is equal
to the number of pairs of letter L, which are both equal to n(n+1). Now,
we can conclude that there are (n + 1)2 − n(n + 1) = n + 1 vertices that
are not conjunction vertices. We call them isolated vertices.
• Consider a row. Because there are only n horizontal segments, there are
at most n conjunction vertices. As a result, there is at least an isolated
vertex on a row.
• From the result above, we can easily see that there is only an isolated
vertex on every column and every row. We call a set S containing n + 1
vertices of the net a “reasonable” set if there are no two vertices in the

Vietnam
set lying in the same row or the same column.
We have proved that with every division satisfying the condition, the set
of n + 1 isolated vertices of the division is reasonable. We now prove
the reverse, which means every “reasonable” set will be correspondent
with one and only one division satisfying the condition.
N
CM
• The principle of building the vectors is that every vector on a row will
have its arrow turning to the isolated vertex. There will be no two vec-
tors creating a V shape because if that happens, the two vectors will have
TH
different directions, which means there are 2 vertices on the line or ar-
row containing the segment. The result contradicts with the assumption
above.
• Assume that there is another division different from the division above.
In this case, there is a vector with its arrow turning in a different di-
rection with the standard vector. We call it “bad” vectors. Without loss
of generalization, we assume that the division has a horizontal “bad’
vector. This vector will have its arrow turning to a conjunction vertex
Q. As Q is a conjunction vertex, the horizontal vector from Q will also
be a “bad” vector. . . As a result, we will go to point R at the rear end
having only one “bad” vector turning to. Then, we can conclude that R
is an isolated vertex, contradiction. So our assumption is false.
• In conclusion, the number of divisions satisfying the conditions is equal
to the “reasonable” sets. We can easily see that the number of “reason-
able” sets is equal to (n + 1)!, so the result of this problem is (n + 1)!.

Vietnam
Problem 5
Does there exist a function f : (0; +∞) → (0; +∞) satisfying
f (2016 + x f (y)) = y f (x + y + 2016) x, y > 0? (2.3.5.1)
Solution. We will prove that there does not exist any function satisfying the
condition above.

1
a) Replace x by f (y) 1
at (2.3.5.1), we get f f (y) + y + 2016 = f (2017)
y , ∀y >
f (2017)
0.. As receive all values in (0; +∞), f is surjective.
N
y
b) Suppose that f is not bijective, which means there exists a > b > 0 such
that f (a) = f (b). Let T = a − b > 0.
CM
• Replace x by a, b at (2.3.5.1) respectively, we get
a f (x+a+2016) = f (2016 + x f (a)) = f (2016 + x f (b)) = b f (x+b+2016), ∀x > 0

a
⇒ f (x) = f (x + T ), ∀x > b + 2016
b
a n
⇒ f (x) = f (x + nT ), ∀n ∈ N∗ , ∀x > b + 2016.
b
As f is surjective, there exists a real number y such that f (y) > 1.
TH
Take a big-enough value of n such that y ff(y)+nT

(y)−1 > b.
y+nT
• Replace x by f (y)−1 at (2.3.2.5), we get

y + nT y + nT
f 2016 + f (y) = y f + y + 2016
f (y) − 1 f (y) − 1

y f (y) + nT y f (y) + nT
⇒ f 2016 + + nT = y f 2016 +
f (y) − 1 f (y) − 1
n
b y f (y) + nT y f (y) + nT
⇒ f 2016 + = y f 2016 +
a f (y) − 1 f (y) − 1
n
b
⇒ = y. (2.3.5.2)
a
As a is fixed and a, b > 0, (2.3.5.2) will be wrong when n is big
enough. So f is bijective.

Vietnam
Replace y = 1 at (2.3.5.1) and use the bijection of f , we get 2016 +
x f (1) = x + 2017 ⇒ x f (1) = x + 1 ∀ x > 0, which is not able to hap-
pen. So there does not exist function f satisfying the condition of the
problem.
Problem 6
Let ABC be a acute-angled triangle with AB < AC and a circumcircle (O).

D is the projection of A on BC. The line which passes through D and is
perpendicular to AB intersects CA at E. The line which passes through D
and is perpendicular to AC intersects AB at F. EF cuts the tangent line of
N
(O) at A at G. M, R is the midpoints of BC and AD, respectively.
1. Prove that GR⊥AM.

CM
2. Let I, J be the intersections of DE, DF and GR; K, L be the mid-
points of JE, IF, respectively. Prove that OS//KL.
TH
Solution.
1. Let N be the midpoint of EF. DF, DE intersect CA, AB at P, Q respec-

tively. We can easily get D is the orthocenter of 4DEF ⇒ RN is the
perpendicular bisector of PQ ⇒ RN ⊥ PQ. Besides, DBQ d = QDA d =
d ⇒ BCPQ is an inscribed quadrilateral ⇒ AQ⊥AO⊥PQ⊥RN ⇒ R
QPA
is the orthocenter of 4AGN ⇒ GR ⊥ AM.

Vietnam
2. ∠MAC = ∠RJD, ∠RDJ = ∠ACM ⇒ 4AMC ∼ 4JRD. By the same
argument, we get 4AMB ∼ 4IRD ⇒ RJ.MC = RD.AM = RI.MB, but
MB = MC ⇒ R is the midpoint of IJ ⇒ AJDI is a parallelogram ⇒
DI 2RL
4AIE ∼ 4AJF ⇒ DJ = AJ FJ RL
AI = EI = 2RK = RK . Note that JDI = LRK ⇒
d d
4DIJ ∼ 4RLK ⇒ BAT d = RKL d = DJI d ⇒ AT is the symmedian
d = MAC
of 4ABC ⇒ ST touches (O) ⇒ OS⊥AT ⊥KL ⇒ OS//KL.
Problem 7
Let p, q be positive integers. Write a number 1 on the board and repeat

the following algorithm: Replace the current number on the board with
N
its sum with p or with q. Find the conditions of p, q to assure that the
algorithm can repeat infinitely without creating a number on the board
that is neither a multiple of p nor a multiple of q.
CM
Solution. We will point out that p, q must not be relatively prime so as to
satisfy the condition of the problem.
• Suppose that (p, q) = d ≤ 2. The number on the board belongs to type

1 + mp + nq (m, n ∈ N∗ ). That number is entirely not the multiple of p
or q.
• Suppose that (p, q) = 1, we will prove that when we infinitely repeat that
TH
algorithm, sooner or later a multiple of p or q will appear. As (p, q) = 1,

there exists the inversion of p modulo q and the inversion of q modulo
. .
p. So, there exists a, b ∈ N∗ such that ap + 1..q, bq + 1..p ⇒ 1 + ap +
. .
mq..q ∀ m, 1 + bq + np..p ∀ n. Therefore, our number will be the multiple
of p or q when our choice for p reaches a or our choice for q reaches b.

Vietnam
2.4. Southern Winter School

Problem 1
Let x, y be positive real numbers such that x + y = 2.
1. Prove that
1 1
n
+ n ≥ xn+1 + yn+1 ∀n ∈ N∗ . (2.4.1.1)
x y
2. For all n, can we replace n + 1 with a positive integer k (k > n + 1)

so that the inequality
N
1 1
n
+ n ≥ xk + yk (2.4.1.2)
x y
holds true with all x, y > 0, x + y = 2?
CM
Solution.
1. Pay attention that

1 1
n
+ n ≥ xn+1 + yn+1
x y
⇔ (x + y)2n+1 (xn + yn ) ≥ 22n+1 xn yn x2n+1 + y2n+1 .

(2.4.1.3)
TH
x
Let a = , (2.4.1.3) is equivalent to
y
an ( an+1 + 1 a + 1 2n+1

≤ . (2.4.1.4)
an + 1 2
Now we will prove (2.4.1.4) by induction.
• For n = 1, we need to prove
a a2 + 1 a+1 3

≤ .
a+1 2
But this is true because according to AM-GM inequality:
1 2a + a2 + 1 (a + 1)4

2
1 2
x a + 1 = (2a) a + 1 ≤ =
2 2 2 8

Vietnam
a a2 + 1 a+1 3

⇒ ≤ ,
a+1 2
and the inequality holds for n = 1.
• Suppose that the inequality holds for n = k, or
ak ( ak+1 + 1 a + 1 2k+1

≤ . (2.4.1.5)
ak + 1 2
From (2.4.1.5), we deduce that

2(k+1)+1 2
x + 1 2k+1

a+1 x+1
= .
2 2 2
N
2
xk xk+1 + 1

x+1
≥ . . (2.4.1.6)
2 xk + 1
CM
• For n = k + 1, we need to prove
ak+1 ( ak+1+1 + 1 a + 1 2(k+1)+1

≤ .
ak+1 + 1 2
Using (2.4.1.6), we see that the inequality above can be proved if

the problem below is true:
TH
2
ak ak+1 + 1 ak+1 ak+2 + 1

a+1
. ≥
2 ak + 1 ak+1 + 1
ak+2 + 1 ak + 1

(a + 1)2
⇔ ≥ 2
4a ak+1 + 1
ak+2 + 1 ak + 1

(a + 1)2
⇔ −1 ≥ 2 −1
4a ak+1 + 1
(a − 1)2 ak (a − 1)2
2
2 k+1 k+1
⇔ ≥ 2 ⇔ (a−1) a + 1 − 4a ≥ 0,
4a ak+1 + 1
which is always true according to AM-GM inequality. So the in-
equality holds for n = k + 1.
Therefore, our inequality is true for all n.

Vietnam
2. Suppose that there exists x, y > 0 such that (2.4.1.2) is true for k > n + 1.
Note that (2.4.1.2) can be written as below:
(x + y)(n+k) (xn + yn ) ≥ 2(n+k) xn yn (xk + yk ). (2.1.4.7)

x
Let a = and rewrite (2.1.4.7), we need to prove
y
a + 1 n+k an ak + 1

f (a) = − ≥ 0.
2 an + 1
After calculating, we get
(n + 1)(n + 1 − k)
f 00 (1) = .
N
4
• If f 00 (1) ≥ 0, then k ≤ n + 1, contradiction.
• If f 00 (1) < 0, then 1 is the maximal point of f (a), so in the neigh-
CM
borhood of 1, we get f (a) < f (1) = 0, contradiction.
So it is impossible to replace n + 1 by any real number k > n + 1 such

that (2.4.1.2) is true.
Problem 2
TH
Let (an ) be a sequence defined by:

a1 = 1, a2 = 2,
(n = 1, 2, 3, ..)
an+2 = 3an+12 −an + n12
Prove that (an ) has a finite limit.
Solution. By induction, we can easily prove that (an ) is an increasing se-

quence.
Let (bn ) be a sequence defined by:

3
b1 =


2


 an
bn = an+1 − (n = 1, 2, 3, ..)
 2

 1
 bn+1 = bn +

n2

Vietnam
From that we get
3 1 1 1
bn = + 2 + 2 +...+ ∀n ∈ N∗
2 1 2 (n − 1)2
3 7
⇒ bn < + 2 ∀n ∈ N∗ ⇒ bn < ∀n ∈ N∗
2 2
Hence:
7 an 7 7 7 a1
an+1 < + < . . . < + 2 + . . . + n + n ∀n ∈ N∗
2 2 2 2 2 2
1
7 1 − 2n 1
⇒ an+1 < . + n ∀n ∈ N∗ ⇒ an < 8 ∀n ∈ N∗
1
N
2 2
1−
2
Therefore (an ) has a finite limit due to the Weierstrass’s theorem.
CM
Problem 3
Let ABC be an acute-angled triangle with its incircle (I). (I) is tangent to
BC,CA, AB at D, E, F respectively. J is the midpoint of EF. BJ and CJ
intersect CA and AB at H and K; EF intersects BC and HK at M and N,
respectively. Prove that AM = AN.
TH
Solution. AI⊥MN at J.
Using Menelaus theorem for those triangles AEF with:
NE KF HA
N ∈ EF, K ∈ AF, H ∈ AE : . . =1
NF KA HE
MF CE BA
M ∈ EF, B ∈ AF,C ∈ AE : . . =1
ME CA BF

Vietnam
JE BF HA
J ∈ EF, B ∈ AF, H ∈ AE : . . =1
JF BA HE
JE KF CA
J ∈ EF, K ∈ AF,C ∈ AE : . . =1
NF KA CE
NE MF
From 4 expressions above and JE = JF we imply that = . Therefore
NF ME
J is the midpoint of MN ⇒ AMN is an isosceles triangle at A, which means
AM = AN.
Problem 4
Consider a 2n x 2n square. Each square is colored with only one color,

white or black, such that
N
i. The number of black squares on each line are pairwise different.
ii. The number of black squares on each column are pairwise differ-
ent.
CM
1. How many black squares are there in the square?
2. How many pairs of consecutive color-different squares? (Two squares

are called consecutive if and only if they have a same side.)
Solution.
TH
1. The maximum and minimum number of black unit squares in each col-
umn and row are 2n and 0, respectively.
There are 2n + 1 values in the range from 0 to 2n. Follow by condition
(i), since we have 2n columns, there exist only a value k ≤ 2n that is not
the number of black unit squares of any columns on the board.
Thus the total number of black unit squares on the board is n(2n + 1) −
k.
Also, since there are 2n columns, by combining condition (ii), it follows
. .
that n(2n + 1) − k .. 2n ⇒ n − k .. 2n ⇒ n = k.
Therefore, there are 2n2 black unit squares on the board.
2. Firstly, we consider the columns. Assume that a is the number of black

unit squares on a particular column. Since a white or a black unit square
on the same column can only be adjacent to at most 2 different colored
unit squares, there is no less than 2 ∗ min(a, 2n − a) pairs on that col-
umn. Thus the maximum number of pairs such that two unit squares are

Vietnam
on the same column is 4.0 + . . . + 4.(n − 1) = 2n(n − 1).
Secondly, we consider the rows. We can easily see that every row can
be alternate with exactly another column, which means a line with a
black square units can only be alternate with a column with 2n − a black
squares. So there are at least n −1 pairs of columns that are not alternate
with each other.
Finally, We deduce that the total number of pairs such that 2 two unit
squares are on the same row is 2n(2n−1)−(n−1). Therefore, the value
that satisfies the required assertion is 6n2 − 5n + 1.
An example configuration: We number the rows downward from 1 to 2n.

The rows numbered even is colored such that it will be alternate with
the row numbered odd right above. Meanwhile, the rows numbered odd
N
will be colored by this law: The row numbered 2i + 1 (0 ≤ i ≤ n − 1)
will have exactly i black square units and the jth black square unit will
be the 2 jth square unit of the row, from left to right.
CM
Problem 5
Find all functions f : R → R with the property that
f ( f (x) + 2y) = 10x + f ( f (y) − 3x) . (4.2.5.0)

TH
holds for all x, y ∈ R.
Solution. Suppose that the function f : R → R satisfies (4.2.5.0).
• In (4.2.5.0), replace x = 0, we get
f ( f (0) + 2y) = f ( f (y)) ∀y ∈ R. (4.2.5.1)
− f (x)
• In (4.2.5.0), replace y = , we get
2
− f (x)
f (0) = 10x + f ( f ( ) − 3x) ∀x ∈ R.
2
Therefore f (x) is surjective.

Vietnam
• We will prove that f (x) is injective. Indeed, if f (x) is not injective, there
exists two distinct real numbers a and b such that f (a) = f (b).
After respectively replacing y = a and y = b in (4.2.5.0), we easily get
f ( f (x) + 2a) = f ( f (x) + 2b) ∀x ∈ R.
Because f (x) is surjective, we imply that f (x + a) = f (x + b) ∀x ∈ R.

Replace x by x − a and let c = b − a, we get f (x) = f (x + c) ∀x ∈ R.
Therefore, by induction we easily get f (x) = f (x + nc) ∀x ∈ R, n ∈ Z.
Replace x by x + c in (4.2.5.0), we get f ( f (x + c) + 2y = 10x + 10c +
f ( f (y) − 3x − 3c) ∀x, y ∈ R ⇒ f ( f (x) + 2y) = 10x + 10c + f ( f (y) −
3x) ∀x, y ∈ R ⇒ c = 0, contradiction (a 6= b). Therefore f (x) is injective.
So from (4.2.5.1) we get
N
f (y) = 2y + f (0) ∀y ∈ R ⇒ f (x) = 2x + α ∀x ∈ R
We see that all the functions f (x) = 2x + α ∀x ∈ R satisfy (4.2.5.0),

and they are all solutions to the problem.
CM
Problem 6
There are 23 positive integers (not necessarily distinct) written on a line.

Prove that we can place the symbols “+”, “x” or the parentheses reason-
ably so that the obtained expression is divisible by to 2000.
TH
Solution. This lemma below is used in the solution.

Lemma. Given n integers arranged on a line. There always exists a number
that is divisible by n or some consecutive numbers in line that have their sum
divisible by n.
Come back to our problem. Note that 2000 = 42 .53 .
• Now, let’s divide 23 integers into 5 consecutive groups containing con-
secutive numbers on the given line. The first three groups, each contains
5 numbers. The last two groups, each contains 4 numbers.
• In each of the first three groups, there always exist a number that is
divisible by 5 or some consecutive numbers in line that have their sum
divisible by 5. We put these numbers in parentheses and symbols "+"
between them. Between the other numbers or groups of numbers, we
put symbols "x". Between the three groups we put symbols "x". So that
the obtained expression from the first 15 numbers is divisible by 53 .

Vietnam
• In each of the last two groups, there always exist a number that is di-
visible by 4 or some consecutive numbers in line that have their sum
divisible by 4.We put these numbers in parentheses and symbols "+"
between them. Between the other numbers or groups of numbers, we
put symbols "x". Between the two groups we put symbols "x". So that
the obtained expression from the last 8 numbers is divisible by 42 .
Then put a "x" between two obtained expressions.
We have already had the expression that satisfied the given conditions.
Problem 7
Let ABC be a triangle and P be a point inside. D is the projection of P

on BC. E, F are the points satisfying the following conditions: PE⊥AC,
N
CE⊥BC, PF⊥AB, BF⊥BC, G is symmetric to D through BC.
1. Prove that AG⊥EF.

CM
2. Let S, T be the intersection of EF and CA, AB, respectively. Q, R
are symmetric to P through the midpoints of GE, GF. (l1 ) be the
line that passes through S and perpendicular to AQ, (l2 ) be the line
that passes through T and perpendicular to AR. Prove that (l1 ) and
(l2 ) intersect at a point on AG.
TH

Vietnam
Solution.
1. Let K be the projection of A on EF and G0 is the common point of AK

and BC. We will prove that G0 is symmetric to D through BC, hence the
problem is solved. Indeed, using the sine formula in triangle, we imply:
G0 B sin ACB
d sin Gd0 AB
= . .
G0C sin ABC sin Gd
0 AC
We also have Gd 0 AB = PFE,

d Gd 0 AC = PEF,
d ACB d = CEP,
d ABCd = BFP
d
due to the perpendicular lines above. Therefore,
G0 B sin CEP
d sin PFE
d sin CEP
d PE DC
= . = . = .
G0C sin BFP
N
d sin PEF
d d PF
sin BFP DB
Thus G0 is symmetric to D through BC ⇒ G0 ≡ G.
2. PEQG and PFRG are both parallelograms so QE = PG = RF and

CM
QE//PG//RF. Therefore, EQRF is a parallelogram ⇒ QR//EF ⇒
QR⊥AG. Let L be the intersection of QR and AG.
Let X,Y consecutively be the intersects of (l1 ) and AQ, (l2 ) and AR. Let
M, N consecutively be the intersects of GQ and AC, GR and AB. We eas-
ily see that SXQM, TY RN, SKGM, T KGN are inscribed quadrilaterals,
so
AX.AQ = AS.AM = AK.AG = AT .AN = AY .AR
TH
Let I be the intersection of (l1 ) and AG, I 0 be the intersection of (l2 ) and
AG. Easily, we get ILQX and I 0 LRY are inscribed quadrilaterals, then
AI.AL = AQ.AX = AR.AY = AI 0 .AL
Therefore I ≡ I 0 .
The problem is completely solved.

Winter Schools of Mathematics Vietnam PDF

Uploaded by

Document Information

Original Title

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

Winter Schools of Mathematics Vietnam PDF

Uploaded by

Copyright:

Available Formats

Blog TOÁN HỌC CHO MỌI NGƯỜI

PROBLEMS AND SOLUTIONS

“THE MORE PEOPLE YOU GO WITH, THE FURTHER YOU REACH.”

Before Vietnamese Mathematics Olympiad (VMO), students in Vietnam join in some

2.2 Northern Winter School . . . . . . . . . . . . . . . . . . . . 27

Problems and Solutions from Winter School of Mathematics in

Problems and Solutions from Winter School of Mathematics in

1.1. Winter School of Vietnam Institute for Ad-

1. Let H be the orthogonal projection of A on EF. Prove that H always

lies on a fixed circle.

Problems and Solutions from Winter School of Mathematics in

1. Let J be the midpoint of EF. Prove that AD intersects KJ at a point

When will the equality holds for that value of c?

1.2. Northern Winter School

2. f (x) < f (y) ∀ 1 ≤ x < y.

Problems and Solutions from Winter School of Mathematics in

2. Let M be the midpoint of BC. Prove that MH⊥AL.

Problem 4. For each positive integer n, denote sn as the number of ways to

a(0, 0) = 2, a(0, n) = 1, a(n, 0) = 2, n ≥ 1;

a(m, n) = a(m − 1, n) + a(m, n − 1), m, n ∈ N∗ .

are real numbers.

Problems and Solutions from Winter School of Mathematics in

1.3. Northern Central Winter School

Problem 2. Let f be a function satisfying the following conditions:

1. Let A0 be the reflection of A through CH. Prove that BA

2. Let K be the intersection of HA0 and BC. Prove that ODK

Problem 4. Given a positive integer n. A square with side n is created from

1. In a pair, there is a vertical and a horizontal segment with the same

Problems and Solutions from Winter School of Mathematics in

f (2016 + x f (y)) = y f (x + y + 2016) x, y > 0?

Problem 6. Let ABC be a acute-angled triangle with AB < AC and a circum-

1. Prove that GR⊥AM.

1.4. Southern Winter School

2. For all n, can we replace n + 1 with a positive integer k (k > n + 1) so

Problems and Solutions from Winter School of Mathematics in

holds for all x, y ∈ R.

Problems and Solutions from Winter School of Mathematics in

Problems and Solutions from Winter School of Mathematics in

2.1. Winter School of Vietnam Institute for Ad-

Denote xn is the only root of the following equation:

Find all functions f : Q → Q that satisfy these following conditions for

Solution. From the first condition, we can prove that:

Also, as all x ∈ Q could be represented as x = qp (p, q ∈ Z, q ≥ 2). We fix a

Problems and Solutions from Winter School of Mathematics in

1. Let H be the orthogonal projection of A on EF. Prove that H al-

Problems and Solutions from Winter School of Mathematics in

1. Since EF and BC are anti-parallel lines of BAC,

2. Assume that EF intersects AB, AC at K, L respectively. We will prove

• Assume that PQ intersects (I) and line d passed through A in

Problems and Solutions from Winter School of Mathematics in

Comment. Other solutions to prove AQ passes through midpoint J of KL.

• Solution 2: AD intersects MN at W . A line passing through Q and KL in-

• Solution 3: M, Q, N are the foot of the perpendicular lines from I to

Solution. Calling the number of students n, we can see that n ≥ 20 since a

Problems and Solutions from Winter School of Mathematics in

2. Secondly, an arbitrary problem b could only be "quacky" if it is a "yam"

Comparing these two ways, we obtain 100.2n−20 ≥ 2n , or 100 ≥ 220 , contra-

Determine whether there exist 2016 distinct prime numbers p1 , p2 , . . . , p2016

1. Solution 1: We solve the problem by using the congruence relation by

• If pi 6= 3 for all i, then p2i +1 ≡ −1 (mod 3). Then P ≡ 1 (mod 3)

Problems and Solutions from Winter School of Mathematics in

common factor for the sum ∑2016 P

So our assumption is false, and the problem is solved.