Professional Documents
Culture Documents
Problem Corner Solution. Jon GLIMMS (Vancouver, Since ∠BAP = ∠KLP and ∠ABP =
Canada) and ZOLBAYAR Shagdar ∠LKP, ΔABP and ΔLKP are similar.
We welcome readers to submit their (Orchlon International School, Then PA > PB implies PL > PK and so
solutions to the problems posed below Ulaanbaatar, Mongolia). ∠BAP = ∠KLP < ∠LKP. We get
for publication consideration. The
solutions should be preceded by the Suppose the squares are unit length. A can ∠BAP +∠CBP +∠ACP
solver’s name, home (or email) address apply the following strategy. After B = ∠KLP +∠CKL +∠AKM
and school affiliation. Please send made the n-th move, let R(n) denote the < ∠LKP +∠CKL +∠AKM
submissions to Dr. Kin Y. Li, rectangle bounded by the squares in the < ∠BKC = 120°,
Department of Mathematics, The Hong same row or same column as one of the
Kong University of Science & which contradicts the inequality above.
two squares containing the checkers. Let
Technology, Clear Water Bay, Kowloon, a(n) be the length (i.e. long side) and b(n)
Hong Kong. The deadline for sending Other commended solvers: KWAN
be the width (i.e. short side) of R(n). As Chung Hang (Sir Ellis Kadoorie
solutions is May 10, 2013. R(0) is consisted of the lowest row squares, Secondary School (West Kowloon)) and
a(0)=100 and b(0)=1. Following the rules, Cyril LETROUIT (Lycée Jean-
Problem 416. If x1 = y1 =1 and for n>1, A can always make a move to decrease the Baptiste Say, Paris, France).
xn = −3xn−1−4yn−1+n length of R(n). After B made n + 1 moves,
and yn = xn−1+yn−1−2, a(n+1)+b(n+1) will either be a(n)+b(n) or Problem 413. Determine (with proof)
a(n)+b(n)−2. In particular, a(n)+b(n) is all integers n≥3 such that there exists a
then find xn and yn in terms of n only. always odd, non-increasing and a(n) > positive integer Mn satisfying the
b(n). Since the side of the board is finite, condition for all n positive numbers a1,
Problem 417. Prove that there does eventually a(n) + b(n) must decrease to 3
not exist a sequence p0, p1, p2, … of a2, …, an, we have
and A can move his checker to meet B’s
prime numbers such that for all checker in the next move.
positive integer k, pk is either 2pk−1+1 a1 +a2 +L+an ⎛a a a a⎞
≤ Mn ⎜⎜ 2 + 3 +L+ n + 1 ⎟⎟.
or 2pk−1−1. Other commended solvers: CHEUNG n a1a2 Lan ⎝ a1 a2 an−1 an ⎠
Ka Wai (Munsang College (Hong Kong
(Source: 2005 Chinese Taipei Math
Problem 418. Point M is the midpoint Island)) and F5D (Carmel Alison Lam
Olympiad Team Selection Test)
of side AB of acute ΔABC. Points P Foundation Secondary School).
and Q are the feet of perpendicular Solution. F5D (Carmel Alison Lam
from A to side BC and from B to side Problem 412. ΔABC is equilateral and Foundation Secondary School) and
AC respectively. Line AC is tangent to points D, E, F are on sides BC, CA, AB Paolo PERFETTI (Math Dept,
the circumcircle of ΔBMP. Prove that respectively. If Università degli studi di Tor Vergata
line BC is tangent to the circumcircle Roma, via della ricerca scientifica,
∠BAD +∠CBE +∠ACF =120°,
of ΔAMQ. Roma, Italy).
then prove that Δ BAD, Δ CBE and Δ
Problem 419. Let n ≥ 4. M is a subset ACF cover ΔABC. For n=3, let a1, a2, a3 > 0 and
of {1,2,…,2n−1} with n elements. (Source: 2006 Indian Math Olympiad a2 a3 a1
Prove that M has a nonempty subset, x= + + .
Team Selection Test) a1 a2 a3
the sum of all its elements is divisible
by 2n. Solution. Jon GLIMMS (Vancouver, Suppose a3 ≥ a1, a2. Then x> a2/a1,
Canada) and William PENG. a3/a2, a1/a3. So a2>a3/x and a1> a2/x >
Problem 420. Find (with proof) all a3/x2. Hence,
Assume P is in ΔABC not covered by Δ
positive integers x and y such that
BAD, ΔCBE and ΔACF. Then ∠BAD < a1 + a2 + a3 3a3
2x2y+xy2+8x is divisible by xy2+2y. ≤ = 3 x.
∠BAP, ∠CBE < ∠CBP and ∠ACF < 3 aa a a3 a3
∠ACP. Adding these, we have
1 2 3 3 a3
x2 x
*****************
120° < ∠BAP +∠CBP +∠ACP.
Solutions So we can take M3=3. For n>3, assume
**************** Now P cannot be the circumcenter of Δ there is such Mn. Let a1 = c, a2 = c2,…,
ABC (otherwise ∠BAP +∠CBP +∠ACP an= cn. Then
Problem 411. A and B play a game on = 90° would contradict the inequality −1
c + c2 + L + cn ⎛ 1 ⎞
a square board divided into 100×100 above). So PA, PB, PC are not all equal. Mn ≥ ⎜ (n − 1)c + n −1 ⎟
squares. Each of A and B has a checker.
n n ( n +1) / 2
c ⎝ c ⎠
Suppose PA > PB. Let rays AP, BP, CP
Initially A’s checker is in the lower left intersect the circumcircle of Δ ABC at cn 1 c ( n − 3) / 2
corner square and B’s checker is in the points K, L, M respectively. ≥ ( n +1) / 2
= .
c c((n − 1) + c ) n − 1 + c − n
−n
lower right corner square. They take
B
turn to make moves. The rule is that M As c → ∞, c(n−3)/2/(n − 1 + c−n) → ∞.
each of them has to move his checker K
Then Mn cannot be finite,
one square up, down, left or right contradiction.
within the board and A goes first. P
Prove that no matter how B plays, A Problem 414. Let p be an odd prime
can always move his checker to meet number and a1, a2, …, ap−1 be positive
B’s checker eventually. A C integers not divisible by p. Prove that
L there exist integers b1, b2, …, bp−1,
Mathematical Excalibur, Vol. 17, No. 5, Mar.-Apr. 13 Page 4
each equals 1 or −1 such that Kin-Chit O (G.T. (Ellen Yeung) College), altitude from the point C to AB, and G
Titu ZVONARU (Comăneşti, Romania) the centroid of the trangle ABC. Circle
a1b1+a2b2+⋯+ap−1bp−1 and Neculai STANCIU (“George Emil k1 goes through A0 and B0 and touches
is divisible by p. Palade’’ Secondary School, Buzău, the circle k in the point X, different than
Romania). C. Prove that the points D, G, N and X
Solution. Jon GLIMMS (Vancouver, are collinear.
Canada). B
x (IMO Shortlist 2011, modified)
For k = 1, 2, …, p − 1, we will prove 51°-x
the numbers of the form a1c1 + a2c2 + ⋯ M Problem 4. For a given positive
+ akck (where each ci is 0 or 1) when 73° 13°
integer k let S(k) denote the sum of all
divided by p will yield at least k + 1 30° 13°
A C numbers from the set {1,2.…,k}
different remainders. For k = 1, we are relatively prime to k. Let m be a
given that a1 ≢ 0 (mod p). Let x =∠MBC. By the trigonometric form
positive integer and n an odd positive
of Ceva’s theorem, we have
integer. Prove that there exist positive
Suppose a case k < p−1 is true. For the sin 13o sin 73o sin x integers x and y such that m divides x
case k+1, if the numbers a1c1+a2c2+⋯ = 1.
sin 13 sin 30 sin(51o − x)
o o
and 2S(x) = yn.
+akck when divided by p yield at least
k+2 different remainders, then the case (Columbia 2008)
Then 2sin73o = sin51 cosx − cos51 sin x
o o