Professional Documents
Culture Documents
v21 n4 20180315
v21 n4 20180315
Olympiad Corner
Below were the problems of the 2017 Perfect Squares
Serbian Mathematical Olympiad for
high school students. The event was Kin Y. Li
held in Belgrade on March 31 and
April 1, 2017. In this article, we will be looking at If s>0, then from 5 divides 4p2, we get
one particular type of number theory p=5. So 5p+4p4=5625=752 and q=75 is a
Time allowed was 270 minutes. problems, namely problems on integers solution. If s=0, then t=p. So 5p=4p2+1.
that have to do with the set of perfect Now, for integer k≥2, we claim
First Day squares 1, 4, 9, 16, 25, 36, …. This kind 5k>4k2+1. The case k=2 is clear.
of problems have appeared in many Suppose the case k is true. Then
Problem 1. (Nikola Petrović) Let a, b Mathematical Olympiads from different
and c be positive real numbers with countries for over 50 years. Here are 4(k 1) 2 1 8k 4
1 2
a+b+c=1. Prove the inequality some examples. 4k 2 1 4k 1 4k 2 1
1 1 1 5.
a 2b 1 b 2c 1 c 2a 1 Example 1 (1953 Kürschák Math
So 5k+1=5×5k > 5(4k2+1) > 4(k+1)2+1.
Competition Problems). Let n be a
2 (a b c ) .
2 2 2
By mathematical induction, the claim is
positive integer and let d be a positive
true. Therefore, 5p = 4p2+1 has no prime
divisor of 2n2. Prove that n2+d is not a
Problem 2. (Dušan Djukić) A convex solution p.
perfect square.
quadrilateral ABCD is inscribed in a
circle. The lines AD and BC meet at Solution. We have 2n2=kd for some Example 4 (2009 Croatian Math
point E. Points M and N are taken on positive integer k. Suppose n2+d=m2 for Olympiad). Find all positive integers m,
the sides AD, BC respectively, so that some positive integer m. Then m2 = n such that 6m+2n+2 is a perfect square.
AM:MD=BN:NC. Let the circum- n2+2n2/k so that (mk)2=n2(k2+2k). Then
circles of triangle EMN and k2+2k must also be the square of a Solution. If
quadrilateral ABCD intersect at points positive integer, but k2<k2+2k<(k+1)2
6m+2n+2=2(3m×2m−1+2n−1+1)
X and Y. Prove that either the lines AB, leads to a contradiction.
CD and XY have a common point or is a perfect square, then 3m×2m−1+2n−1+1
they are all parallel. Example 2 (1980 Leningrad Math is even. So one of the integers 3m×2m−1
Olympiad). Find all prime numbers p and 2n−1 is odd and the other is even.
(continued on page 4) such that 2p4-p2+16 is a perfect square.
Suppose 3m×2m−1 is odd, then m = 1
Solution. For p=2, 2p4-p2+16=44 is not
and 6m+2n+2 = 8+2n = 4(2n−2+2). So
Editors: 高 子 眉 (KO Tsz-Mei)
a perfect square. For p=3, 2p4-p2+16
2n−2+2 is a perfect square. Since every
梁 達 榮 (LEUNG Tat-Wing) =169=132. For prime p>3, p ≡ 1 or 2
perfect square dived by 4 has remainder
李 健 賢 (LI Kin-Yin), Dept. of Math., HKUST (mod 3) and 2p4-p2+16≡ 2 (mod 3).
0 or 1, so 2n−2+2 cannot be of the form
吳 鏡 波 (NG Keng-Po Roger), ITC, HKPU Assume 2p4-p2+16=k2. Then k2 ≡ 02,12
4k+2. Hence, n-2=1, i.e. n=3. So
Artist: 楊 秀 英 (YEUNG Sau-Ying Camille), MFA, CU or 22 ≡ 0 or 1 (mod 3). So 2p4-p2+16 ≠
(m,n)=(1,3) is a solution.
Acknowledgment: Thanks to Sindy Ting, Math. Dept., k2. Then p=3 is the only solution.
HKUST for general assistance.
If 2n−1 is odd, then n=1 and
On-line: http://www.math.ust.hk/excalibur/ Example 3 (2008 Singapore Math
The editors welcome contributions from all teachers and Olympiad). Find all prime numbers p 6m+2n+2 = 6m+4 ≡ (-1)m+4 (mod 7).
students. With your submission, please include your name, satisfying 5p+4p4 is a perfect square.
address, school, email, telephone and fax numbers (if This means 6m+2n+2 divided by 7 has
available). Electronic submissions, especially in MS Word, p 4 2
are encouraged. The deadline for receiving material for the Solution. Suppose 5 +4p =q for some remainder 3 or 5. However,
next issue is April 21, 2018. integer q. Then
For individual subscription for the next five issues for the
(7k)2 ≡ 0 (mod 7), (7k±1)2 ≡ 1 (mod 7),
17-18 academic year, send us five stamped self-addressed 5 = q -4p = (q-2p ) (q+2p ).
p 2 4 2 2
(7k±2)2≡ 4 (mod 7), (7k±3)2≡ 2 (mod 7).
envelopes. Send all correspondence to:
Since 5 is a prime number, we have So every perfect square divided by 7
Dr. Kin-Yin LI, Math Dept., Hong Kong Univ. of Science
and Technology, Clear Water Bay, Kowloon, Hong Kong cannot have remainder 3, 5 or 6.
q-2p2 = 5s and q+2p2 = 5t Therefore, (m,n) = (1,3) is the only
Fax: (852) 2358 1643
Email: [email protected]
for some integers s, t with t > s ≥ 0 and solution.
© Department of Mathematics, The Hong Kong University
of Science and Technology s+t = p. Eliminating q, we have
(continued on page 2)
4p2 = 5s(5t−s-1).
Mathematical Excalibur, Vol. 21, No. 4, Feb. 18 – Mar. 18 Page 2
Example 5 (2008 German Math Solution. Since m2+n2+m is divisible by for some positive integer u. Then
Olympiad). Determine all real numbers mn, so for some positive integer k,
x such that 4x5-7 and 4x13-7 are m2+n2+m=kmn. Then n2-kmn+(m2+m) = ps=u2-1=(u+1)(u-1).
perfect squares. 0, which can be viewed as a quadratic Since gcd(u+1,u-1)=1 or 2, so if it is 2,
equation in n. Then the discriminant then u is odd and p is even. Hence, p=2
Solution. Suppose there are positive
∆=k2m2-4m2-4m is a perfect square. and both u+1 and u-1 are powers of 2.
integers a and b such that
Suppose d is gcd(m, k2m-4m-4)=1. If d=1, Then u can only be 3 and 1+ ps=32 so
4x5-7=a2 and 4x13-7=b2. then m (and k2m-4m-4) are both perfect that p=2, s=3, r=q+s=2+3=5. These
squares. If d > 1, then lead to the solutions (p,q,r)=(2,2,5) or
Then x5 = (a2+7)/4 > 1 is rational and
d = gcd(m, k2m-4m-4) = gcd(m,4). (2,5,2).
x13 = (b2+7)/4 > 1 is rational. So x =
(x5)8/(x13)3 is rational. Suppose x = p/q Since d >1 divides 4, so d is even. Then m If gcd(u+1,u-1)=1, then u is even and
with p and q positive relatively prime is even. Also, n2 ≡ m2+n2+m (mod 2). So n u-1 must be 1 (otherwise u+1 and u-1
integers. Then from (p/q)5 = (a2+7)/4 , is even. Then mn, m2+n2 are divisible by 4. have different odd prime factors and
it follows q5 divides 4p5 and so q=1. So
cannot be powers of the same prime).
x must be a positive integer and x≥2. As m2+n2+m is given to be divisible by mn, Then u=2, ps=(u-1)(u+1)=3, p=3, s=1,
so m2+n2+m is divisible by 4. Then m = r=q+s=3. The only such prime triples
In the case x is an odd integer, we have m2+n2+m-(m2+n2) is divisible by 4. So we are (p,q,r) = (3,2,3) or (3,3,2).
a2≡ 0, 1, 4 (mod 8), but a2 = 4x5-7 ≡ 5 get d = 4. Then
(mod 8), contradiction. So x is even. In
Then all the solutions are (p,q,r) =
the case x=2, we have 4x5-7=112 and 1 = gcd(m/4, k2(m/4)-m-1).
(2,2,5), (2,5,2), (3,2,3), (3,3,2) and
4x13-7=1812. For an even x≥4, (ab)2 =
Now ∆/16 = (m/4)(k2(m/4)-m-1) is a (2,q,q) with q being a prime at least 3.
(4x5-7)(4x13−7)=16x18-28x13-28x7+49.
perfect square. So m/4 and k2(m/4)-m-1
However, expanding (4x9-7x4/2-1)2
are perfect squares. Therefore, m is a Example 10 (2008 USA Team Selection
and (4x9-7x4/2)2 and using x9 ≥ 4x8 ≥
perfect square. Test). Let n be a positive integer. Prove
42x7 ≥ 45x4, we see (ab)2 is strictly
that n7+7 is not a perfect square.
between them. Then x=2 is the only
Example 8 (2006 British Math Olympiad).
solution.
Let n be an integer If 2 2 1 12 n 2 is an Solution. Assume n7+7=x2 for some
integer, then it is a perfect square. positive integer x. Then
Example 6 (2011 Iranian Math
Olympiad). Integers a, b satisfy a>b. (1) n is odd (for otherwise x2≡ 3 (mod
Solution. If 2 2 1 12 n 2 is an integer,
Also ab-1, a+b are relatively prime 4), which is false).
then 1+12n2 is a perfect square. Suppose
and ab+1, a-b are relatively prime. (2) n≡ 1 (mod 4) (due to n odd and x2≢
1+12n2=m2 for some odd positive integer
Prove that (a+b)2+(ab-1)2 is not a 2 (mod 4)).
m. Then 12n2 = (m+1)(m-1). Let t be the
perfect square.
integer (m+1)/2 and we have (*) (3) x2+112 = n7+128 =(n+2)N, where N
t(t−1)=3n2. is n6-2n5+4n4-8n3+16n2-32n+64.
Solution. Assume (a+b)2+(ab-1)2=c2
for some integer c. Then
Now we claim 2 2 1 12 n 2 = 2 + 2m (4) If 11 ∤ x, then every prime factor p
2 2 2 2 2 2
c =a +b +a b +1=(a +1)(b +1). 2
= 4t is a perfect square. By (*), we see t-1 of x2+112 must be odd and p≡1 (mod 4)
or t is divisible by 3. Now gcd(t-1, t)= 1. (for if p = 4k+3, then x2 ≡ -112 (mod p)
Assume (*) there is a prime p such that
Assume t is divisible by 3, then (t and by Fermat’s little theorem, xp−1 ≡
p | a2+1 and p | b2+1, then p | a2+1–b2+1 -11p−1 ≡ -1 (mod p), contradiction).
/3)(t-1)= n2 and both t/3 and t-1 are
= a2-b2. So (**) p | a-b or p | a+b.
perfect squares. Let t/3=k2 for some
integer k, Then t-1=3k2-1≡ 2 ≢ 02, 12 or From (3), we get n+2 | x2+112, n+2≡3
Assume p | a-b. Then p | ab–b . Since
2
(mod 4) implies x2+112 has a prime
22 (mod 3), contradiction. So t -1 is
p | b2+1, so p | ab–b2+b2+1 = ab+1, factor congruent 3 (mod 4), which
divisible by 3. Then we have gcd(t,
which contradicts ab+1, a-b are contradicts (4).
(t-1)/3)=1. From t×(t-1)/3=n2, we see t is
relatively prime. Similarly, assume p |
a perfect squares. So the claim is true.
a+b. Then p | ab+b2. Since p | a2+1, so If x=11y for some integer y, then (3)
p | ab+b2+b2-1 = ab-1, which becomes 121(y2 +1) = (n + 2)N, but
Example 9 (2002 Australian Math
contradicts ab-1, a+b are relatively
Olympiad). Find all prime numbers p, q, r checking n ≡ -5 to 5 (mod 11), we see
prime. So (**) as well as (*) are wrong. N is not a multiple of 11. So n+2 is a
such that pq+pr is a perfect square.
multiple of 121, say M = (n+2)/121.
Then a2+1, b2+1 are relatively prime. Solution. If q=r, then pq+pr=2pq. So p=2 Then y2+1 =MN. Similarly, it can be
Since a>b, not both of them are 0. So and q is an odd prime at least 3. All prime checked that every prime factor of y2+1
(a+b)2+(ab-1)2 equals a2+1 (if b=0) triples (p,q,r)=(2,q,q) are solutions. is congruent to 1 (mod 4). Hence, every
or b2+1 (if a=0) or (a2+1)(b2+1). Then odd factor of y2+1 is congruent to 1
(a+b)2+(ab-1)2 is not a perfect square. If q≠r, then without loss of generality, let (mod 4). However, M ≡ 3 (mod 4), so
q<r and so pq+pr = pq(1+ps), where s=r-q y2+1 =MN cannot be true. Therefore,
Example 7 (2000 Polish Math is at least 1. Since pq and 1+ps are n7+7 is not a perfect square.
Olympiad). Let m, n be positive relatively prime, so they are both perfect
integers such that m2+n2+m is divisible squares. Then, the prime q is 2. Also,
by mn. Prove that m is a perfect square. since 1+ ps is a perfect square, 1+ ps=u2 (continued on page 4)
Mathematical Excalibur, Vol. 21, No. 4, Feb. 18 – Mar. 18 Page 3
Problem Corner different from B. Prove that D is the a =3/(1-f(3))+2f(3). Setting y=a in (*),
midpoint of BF if and only if BE is tangent we get f(a+2f(x))=f(x+af(x)) for all
We welcome readers to submit their to Γ1. x∈ℝ. Since f is injective, we get
solutions to the problems posed below a+2f(x) = x+af(x). Now a≠2. So f(x) =
for publication consideration. The Solution. FONG Tsz Lo (SKH Lam Woo (x-a)/(2-a). Putting this in (*), we get
solutions should be preceded by the
Memorial Secondary School) and George a=1. Then the function can only be (1)
solver’s name, home (or email) address
and school affiliation. Please send SHEN. f(x)=0 for all x∈ℝ or (2) f(x)=x-1 for
all x∈ℝ. Putting these in (*) show they
submissions to Dr. Kin Y. Li, 1 B
Department of Mathematics, The Hong are in fact solutions of (*).
Kong University of Science & 2 Other commended solvers: Yagub N.
Technology, Clear Water Bay, Kowloon,
A ALIYEV (Problem Solving Group of
Hong Kong. The deadline for sending O
solutions is April 21, 2018. D ADA University, Baku, Azerbaijan)
K E and Akash Singha ROY (West Bengal,
Problem 511. Let x1,x2,…,x40 be F India).
positive integers with sum equal to 58.
Find the maximum and minimum Let point K be the intersection of Γ1 with Problem 508. Determine the largest
possible value of x12+x22+⋯+x402. line DE. Then ∆KFD ~ ∆ABD. Since integer k such that for all integers x,y, if
∠ABD = ∠AEB, so ∆ABD ~ ∆AEB. xy+1 is divisible by k, then x+y is also
Problem 512. Let AD, BE, CF be the Then ∆KFD ~ ∆AEB. Hence, FD/DK = divisibly by k.
altitudes of acute ∆ABC. Points P and AB/BE.
Q are on segments DF and EF Solution. George SHEN.
respectively. If ∠PAQ=∠DAC, then Let O be the center of Γ2. Since OB⊥AB, Let k be such an integer. Let S be the
prove that AP bisects ∠FPQ. AO is a diameter of Γ1. So AK⊥OK. Then set of all integers x such that gcd(x,k)=1.
∠DKO =∠AKO = 90°. So DK=EK. Now For x in S, choose integer m in [1,k−1]
Problem 513. Let a0,a1,a2,… be a BE is tangent to Γ1 ⇔ ∠EBK = ∠BAD ⇔ such that mx2 ≡-1 (mod k). Let y=mx,
sequence of nonnegative integers ∆EBK ~ ∆BAD ⇔ AB/BE=DB/KE ⇔ then k | xy+1. So k | x+y and k | (x+y)x −
satisfying the conditions: FD/DK=DB/KE ⇔FD=DB (i.e. D is the (xy+1) = x2−1. Then for every x in S,
every prime factor p of k satisfies x2≣1
(1) an+1=3an-3an−1+an−2 for n>1, midpoint of BF).
(mod p). If all prime factors p of k are
(2) 2a1=a0+a2-2, Other commended solvers: DBS Maths at least 5, then x=2, 3 are in S, but x2≣1
(3) for every positive integer m, in the Solving Team (Diocesan Boys’ School), (mod p) fails due to p∤ 22−1, 32−1. So
sequence a0,a1,a2,…, there exist m Jae Woo LEE (Hamyang High School,
the prime factors of k can only be 2 or 3.
terms ak,ak+1,…,ak+m−1, which are South Korea), LIN Meng Fei, Akash
Singha ROY (West Bengal, India) and So k is of the form 2r3s and S={x:
perfect squares.
Toshihiro SHIMIZU (Kawasaki, Japan). gcd(x,2)=1=gcd(x,3)} Then for x=5 in
Prove that every term in a0,a1,a2,… is a S, x2≣1 (mod 2r) implies 2r | 24 and so
perfect square. Problem 507. Determine all functions r≤3. Also, for x=5 in S, x2≣1 (mod 3s)
f:ℝ→ℝ such that for all x, y ∈ℝ, implies 3s | 24 and so s≤1. Then k ≤
Problem 514. Let n be a positive 233=24.
integer and let p(x) be a polynomial (x-2)f(y) + f(y+2f(x)) = f(x+yf(x)). (*)
with real coefficients on the interval Finally, for k=24, xy≣−1 (mod 24)
[0,n] such that p(0)=p(n). Prove that Solution. DBS Maths Solving Team implies gcd(x,24) = 1 = gcd(y,24).
(Diocesan Boys’ School), FONG Tsz Lo
there are n distinct ordered pairs (ai, bi) Then x,y ≣ 1, 5, 7, 11, 13, 17, 19 or 23
(SKH Lam Woo Memorial Secondary
with i=1,2,…,n such that 0≤ai<bi≤n, School), Jae Woo LEE (Hamyang High (mod 24). The only possible cases for
bi-ai is an integer and p(ai)=p(bi). School, South Korea) and Toshihiro xy≣−1 (mod 24) are {x,y} = {1,23},
SHIMIZU (Kawasaki, Japan). {5,19}, {7,17}, {11,23}. Then 24 | x+y.
Problem 515. There are ten distinct So k=24 is the required largest integer.
nonzero real numbers. It is known that If f(0)=0, then setting x=0 in (*) yields Other commended solvers: CHUI Tsz
for every two of the numbers, either the f(y)=0 for all y ∈ℝ, i.e. f is the zero Fung (Ma Tau Chung Government
sum or the product of them is rational. function, which is a solution of (*). Primary School, P4) and DBS Maths
Prove that the square of each of the ten
Solving Team (Diocesan Boys’
numbers is rational. If f(0)≠0, then setting y=0 in (*) yields
School), Jae Woo LEE (Hamyang
(x-2)f(0) + f(2f(x)) = f(x) for all x ∈ℝ.
***************** High School, South Korea), Akash
Now f(x) = f(y) implies (x-2)f(0) + f(2f(x))
Solutions Singha ROY (West Bengal, India) and
= f(x) = f(y) = (y-2)f(0) + f(2f(y)) =
Toshihiro SHIMIZU (Kawasaki,
**************** (y-2)f(0) + f(2f(x)) yielding x=y. So f is
Japan).
injective.
Problem 506. Points A and B are on a
Setting x=2 in (*) yields f(y+2f(2)) = Problem 509. In ΔABC, the angle
circle Γ1. Line AB is tangent to another
f(2+yf(2)) for all y∈ℝ. Since f is injective, bisector of ∠CAB intersects BC at a
circle Γ2 at B and the center O of Γ2 is
y+2f(2)=2+yf(2) for all y∈ℝ. Setting y=0, point L. On sides AC, AB, there are
on Γ1. A line through A intersects Γ2 at
we get f(2)=1. Since f is injective, f(3)≠1. points M, N respectively such that lines
points D and E (with D between A and
Setting x=3, y=3/(1-f(3)) in (*), we get AL, BM, CN are concurrent and ∠AMN
E). Line BD intersects Γ1 at a point F,
f(3/(1-f(3))+2f(3))=0. Thus, f has a root at =∠ALB. Prove that ∠NML= 90°.
Mathematical Excalibur, Vol. 21, No. 4, Feb. 18 – Mar. 18 Page 4
Note after each operation, the sum of the chessboard so that each queen attacks
A
numbers is always 210. Suppose the at most one of the others.
M person chooses m,n with m-n≥2, then
N (m-1)2 + (n+1)2 = n2 + m2 + 2 - 2(m-n) ≤ Problem 6. (Dušan Djukić) Let k be
n2+m2-2 with equality only for m-n=2. If the circumcircle of triangle ABC, and
the absolute value of the difference of the let ka be its excircle opposite to A. The
C L B T two numbers is 1, then the operation does two common tangents of k and ka meet
not change anything. At the end, the board the line BC at points P and Q. Prove
Solution 1. Apostolis MANOLOUDIS
has ten 10’s and ten 11’s. that ∠PAB=∠QAC.
and George SHEN.
Let T=MN∩BC. From ∠AMT=∠AMN In the beginning, the sum of the squares is
=∠ALB =∠ALT, we get A, M, L, T are 12+22+⋯+202=2870 and at the end, it is Perfect Squares
concyclic. So ∠NML=∠TML=∠TAL. 10×(102+112)=2210. After each operation,
To get ∠TAL=90°, it suffices to show the sum of squares reduces by at least 2, so (Continued from page 2)
AT is the exterior bisector of ∠CAB. the number of operation that can be done
is at most (2870-2210)/2=330. Below we Example 11 (2006 Thai Math
By Menelaos’ theorem, as M,N,T are will show the person can do 330 Olympiad). Determine all prime
collinear, (AM/MC)(CT/TB)(BN/NA) = operations with the absolute values of the numbers p such that (2p−1-1)/p are
1. By Ceva’s theorem, as AL, BM, CN difference of the two numbers is 2. perfect squares.
concur, (AM/MC)(CL/LB)(BN/NA) =1. Solution. For every prime number p, let
The plan is to eliminate the minimum and
Then CL/LB=CT/TB. By the angle f(p)= (2p−1-1)/p. We will show for p>7,
bisector theorem, CA/AB=CL/LB= the maximum of the remaining numbers
f(p) is not a perfect square.
CT/TB. So AT is the external bisector until we get only 10’s and 11’s. In round 1,
of ∠CAB. we eliminate 1’s and 20’s by operating on Assume there is a prime p>7 such that
pairs (1,3), (2,4), …, (18,20) one time for 2p−1-1=pm2 for some positive integer
Solution 2. FONG Tsz Lo (SKH Lam every pair. In round 2, we eliminate 2’s m. Then m must be odd. Now there are
Woo Memorial Secondary School), and 19’s by operating on pairs (2,4), two cases, (1) p is of the form 4k+1
Akash Singha ROY (West Bengal, (3,5), …, (17,19) two times for every pair. with k>1 or (2) p is of the form 4k+3
India) and Toshihiro SHIMIZU Keep on eliminating in this way until we with k>1.
(Kawasaki, Japan). have only 9’s, 10’s, 11’s and 12’s. In round
9, we eliminate 9’s and 12’s by operating In case (1), we have 2p−1 -1 = pm2 =
on pairs (9,11) and (10,12) nine times. The (4k+1)m2 ≡ 1 (mod 4), but also 2p−1 -1
AL, BM, CN concurrent implies T, B, L, = 24k -1 ≡ 3 (mod 4), which is a
C is a harmonic range of points. Then total number of operations is 18×1+16×2+
⋯ +2×9=330. contradiction.
∠AMT =∠AMN =∠ALB =∠ALT led
to T, A, M, L concyclic. By Apollonius’ In case (2), we have 2p−1-1= 24k+2-1 =
Theorem, 90° =∠TAL =∠NML. (22k+1-1)(22k+1+1) = pm2.
Other commended solvers: Jae Woo Olympiad Corner Since gcd(22k+1-1,22k+1+1)=1, again
LEE (Hamyang High School, South we have two subcases:
Korea), LEUNG Hei Chun (SKH Tang (Continued from page 2)
Shiu Kin Secondary School), Titu (a) 22k+1-1=u2, 22k+1+1=pv2 for some
Problem 3. (Dušan Djukić) There are
ZVONARU (Comăneşti, Romania) and positive integers u, v;
Neculai STANCIU (“George Emil 2n-1 bulbs in a line. Initially, the central
Palade” School, Buzău, Romania). (n-th) bulb is on, whereas all others are off. (b) 22k+1-1=pu2, 22k+1+1=v2 for some
A step consists of choosing a string of at positive integers u, v.
Problem 510. Numbers 1 to 20 are least three (consecutive) bulbs, the
leftmost and rightmost ones being off and In subcase (a), since k > 1, 22k+1+1≡1
written on a board. A person randomly
all between them being on, and changing (mod 4), but pv2≡3×1=4 (mod 4),
chooses two of these numbers with a
the states of all bulbs in the string (for which is a contradiction.
difference of at least 2. He adds 1 to the
instance, the configuration ●○○○● will
smaller one and subtracts 1 from the In subcase (b), we have 22k+1 = v2-1 =
larger one. Then he performs an turn into ○●●●○). At most how many
(v-1)(v+1). Then v-1=2s, v+1=2t for
operation by replacing the original two steps can be performed?
some positive integers s<t. Observe
chosen numbers on the board with the that 2t−s =(v+1)/(v-1)=2/(v-1)+1. Then
two new numbers. Determine the Second Day
v=2 or 3. If v=2, then 22k+1+1=v2=4,
maximum number of times he can do which is a contradiction. If v=3, then
Problem 4. (Dušan Djukić) Suppose that
this operation. 22k+1=v2-1=8 leads to k=1, which is a
a positive integer a is such that, for any
Solution. CHUI Tsz Fung (Ma Tau contradiction as k>1.
positive integer n, the number n2a-1 has a
Chung Government Primary School, divisor greater than 1 and congruent to 1 Finally, checking the cases p=2,3,5,7,
P4), FONG Tsz Lo (SKH Lam Woo modulo n. Prove that a is a perfect square. we see only cases p=3 and 7 have
Memorial Secondary School), Akash solutions (23−1-1)/3=12 and (27−1-1)/7
Singha ROY (West Bengal, India) and Problem 5. (Bojan Bašić and PSC) = 32.
Toshihiro SHIMIZU (Kawasaki, Determine the maximum number of
Japan). queens that can be placed on a 2017×2017