Junior problems

J391. Solve the equation

127
4x3 + = 2016.
x
Proposed by Adrian Andreescu, Dallas, Texas

Solution by Alessandro Ventullo, Milan, Italy

The given equation is equivalent to
4x4 2016x + 127 = 0.
Observe that
4x4 2016x + 127 = 4x4 256x2 + (2x2 + 16x) + 127(2x2 16x) + 127
= (2x2 16x + 1)(2x2 + 16x) + 127(2x2 16x + 1)
= (2x2 16x + 1)(2x2 + 16x + 127)

So, the given equation becomes

(2x2 16x + 1)(2x2 + 16x + 127) = 0.

We obtain
8 62 8 i 190
x= , x= .
2 2

Also solved by Daniel Lasaosa, Pamplona, Spain; Joel Schlosberg, Bayside, NY, USA; Nandansai, Sri-
gayatri College, Hyderabad, India; Albert Stadler, Herrliberg, Switzerland; Alok Kumar, New Delhi, India;
AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia; Andreas Charalampopoulos, 4th Lyceum of Gly-
fada, Greece; Haimoshri Das, South Point High School, Kolkata, India; Joseph Currier, SUNY Brockport,
NY, USA; Moubinool Omarjee, Lyce Henri IV, Paris, France; Paolo Perfetti, Universit degli studi di Tor
Vergata Roma, Roma, Italy; Ricardo Largaespada, Universidad Nacional de Ingeniera, Managua, Nicara-
gua; Polyahedra, Polk State College, FL, USA; Pedro Acosta, West Morris Mendham High School, Mendham,
NJ, USA; Aditya Ghosh, Kolkata,West Bengal, India; Prajnanaswaroopa S, Bangalore, Karnataka, India;
Dimitris Avramidis, Evaggeliki Gymnasium, Athens, Greece; Joehyun Kim, Bergen County Academies, Hac-
kensack, NJ, USA; Vincelot Ravoson, Lyce Henri IV, Paris, France; Simon Pellicer, Paris, France; Kon-
stantinos Metaxas, 1st High School Ag. Dimitrios, Athens, Greece; Sushanth Sathish Kumar, Jeffery Trail
Middle School, CA, USA; Nermin Hodi, Dobonica, Bosnia and Herzegovina.

Mathematical Reflections 6 (2016) 1

J392. Prove that in any triangle
(a + b + c)3 4R
1+ .
3abc r
Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

First solution by Arkady Alt, San Jose, CA, USA

Let s, R, r be semiperimeter,circumradius and inradius of the triangle. Then

(a + b + c)3 4R 8s3 4R
1+ 1+ 2s2 12R2 + 3rR.
3abc r 3 4Rrs r
Since s2 4R2 + 4Rr + 3r2 (Gerretsens Inequality) and R 2r

12R2 + 3rR 2s2 = 12R2 + 3rR 2 4R2 + 4Rr + 3r2 + 2 4R2 + 4Rr + 3r2 s2 =

(R 2r) (4R + 3r) + 2 4R2 + 4Rr + 3r2 s2 0.

Second solution by Arkady Alt, San Jose, CA, USA

Let x := s a, y := s b, z := s c, p := xy + yz + zx, q := xyz.Due to homogeneity of
the original inequality we can assume that s = 1. Then a = 1 x, b = 1 y, c = 1 z,
r
(s a) (s b) (s c)
x, y, z > 0, x + y + z = 1, a + b + c = 2, abc = p q, r = = q,
s
abc pq
R= =
4sr 4 q
and original inequality becomes

p2
 
8 pq
1+ 8 3 p .(1)
3 (p q) q q

(x + y + z)2 1
Note that p = xy + yz + zx = and p2 = (xy + yz + zx)2 3xyz (x + y + z) = 3q. Since
3 3
p2 p2
decreasing in q > 0 suffices to prove inequality (1) for q = and p (0, 1/3]. We have
q 3
 2   2 
p p
83 p 8 3 p 8 3 (3 p) 3p 1.
p2 /3 p2 /3

Also solved by Daniel Lasaosa, Pamplona, Spain; Polyahedra, Polk State College, FL, USA; Pedro Acosta,
West Morris Mendham High School, Mendham, NJ, USA; Aditya Ghosh, Kolkata,West Bengal, India; Jamal
Gadirov, Istanbul University Istanbul, Turkey; Albert Stadler, Herrliberg, Switzerland; Andreas Charalam-
popoulos, 4th Lyceum of Glyfada, Greece; Ioan Viorel Codreanu, Satulung, Maramures, Romania; Nermin
Hodi, Dobonica, Bosnia and Herzegovina; Nicusor Zlota, Traian Vuia Technical College, Focsani, Ro-
mania; Paolo Perfetti, Universit degli studi di Tor Vergata Roma, Roma, Italy; Nikos Kalapodis, Patras,
Greece; Stanescu Florin, Serban Cioculescu School, Gaesti, Romania.

Mathematical Reflections 6 (2016) 2

J393. Find the least multiple of 2016 whose sum of digits is 2016.

Proposed by Adrian Andreescu, Dallas, Texas

Solution by Ricardo Largaespada, Universidad Nacional de Ingeniera, Managua, Nicaragua.

The number is 598 |999 {z 999} 89888.
217 times 9
It is clear that the number has more than 224 digits, because 2016 9 = 224. Now, to minimize the
number we need to find a number with 225 digits multiple of 2016.

N = a224 a225 a4 a3 a2 a1 a0 .

Since 2016 = 25 32 7, it is sufficient and necessary that the number ka4 a3 a2 a1 a0 is multiple of 32, the
224
P
number N is multiple of 7, and clearly s(N ) = ai = 2016 is multiple of 9.
i=0

First, we will analyze s(k) = a4 + a3 + a2 + a1 + a0 . The number a0 is even and is least equal to 8. We
have several cases, but:

If s(k) = 44, then k is 99998 and all its permutations.

If s(k) = 43, then k is 99988 and all its permutations.

If s(k) = 42, then k is 99888, 99978, or 99996 and all its permutations.

If s(k) = 41, then k is 98888, 99878, or 99968 and all its permutations.

We discard most numbers because the numbers finished in 7, 9, 78, 86, 98, 788, 988, 996 or 8888 are
not multiples of 32. The only multiples of 32 in all of these cases are 99968 and 89888 in both cases s(k) = 41.
224
P
If a224 3 then, ai 3+2199+(a4 +a3 +a2 +a1 +a0 ) = 1974+s(k), then s(k) 42. Contradiction,
i=0
because the number s(k) 41.
224
P
If a224 = 4, then, 2016 = ai 4 + 219 9 + s(k) = 1975 + s(k), then s(k) 41, from here that
i=0
s(k) = 41 and the termination of N has two options, but 99968 1 (mod 7) and 89888 1 (mod 7), then
for minimize we choose 89888

999} 89888 = 4 10224 + (10219 1) 105 + 89888 4 2 + (6 1) 5 + 1 = 6 6 0

N = 4 |999 {z (mod 7).
219 times 9

224
P
If a224 = 5, then, 2016 = ai 5 + 219 9 + s(k) = 1976 + s(k), then s(k) 40. For minimize
i=0
s(k) = 41 and in the same way as the previous case the termination is 89888

8 999} 89888 = 5 10224 + (10219 1) 105 10m + 89888 where 5 m 223

| {z
N = 5 999
218 times 9

N 5 2 + (6 1) 5 10m + 1 1 10m 0 (mod 7).

Then 10m 1 (mod 7) m 0 (mod 6). For minimize we choose the highest value for m this is
m = 222.

Mathematical Reflections 6 (2016) 3

J394. Prove that in any triangle
bmc + cmb
ama .
2
Proposed by Dorin Andrica, Babe-Bolyai University, Cluj-Napoca, Romnia

Solution by Polyahedra, Polk State College, FL, USA

A M
C

L P

Let L, M, N be the midpoints of BC, CA, AB, respectively. As in the figure, locate P so that ALP M is
a parallelogram. Then CM LP is a parallelogram (because P L#M A#CM , where # denotes, obviously, k
and =), and so is BP CN (because CP #M L#N B). Applying Ptolemys inequality in BP CM , we have

bmc cmb
ama = BC M P CM BP + CP BM = + .
2 2

Also solved by Daniel Lasaosa, Pamplona, Spain; Sushanth Sathish Kumar, Jeffery Trail Middle School,
CA, USA; Nikos Kalapodis, Patras, Greece; Stanescu Florin, Serban Cioculescu School, Gaesti, Romania;
Sardor Bazarbaev, National University of Uzbekistan, Uzbekistan; AN-anduud Problem Solving Group, Ulaan-
baatar, Mongolia; Nermin Hodi, Dobonica, Bosnia and Herzegovina; Nicusor Zlota Traian Vuia Techni-
cal College, Focsani, Romania; Nikolaos Evgenidis, M.N.Raptou High School, Larissa, Greece; Albert Stadler,
Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 4

J395. Let a and b be real numbers such that 4a2 + 3ab + b2 2016. Find the maximum possible value of
a + b.

Proposed by Titu Andreescu, University of Texas at Dallas, USA

Solution by Daniel Lasaosa, Pamplona, Spain

Note that
8 2016 32a2 + 24ab + 8b2 = (5a + b)2 + 7(a + b)2 7(a + b)2 ,
with equality iff 5a + b = 0 and 4a2 + 3ab + b2 = 2016. Therefore,
r
p
2
8 2016
a + b |a + b| = (a + b) = 48,
7
with equality iff a, b are the solutions of the system formed by a + b = 48 and 5a + b = 0, ie iff a = 12 and
b = 60, which results indeed in a + b = 48 and 4a2 + 3ab + b2 = 576 2160 + 3600 = 2016.

Also solved by Polyahedra, Polk State College, FL, USA; Prajnanaswaroopa S, Bangalore, Karnataka,
India; Sushanth Sathish Kumar, Jeffery Trail Middle School, CA, USA; Dimitris Avramidis, Evaggeliki
Gymnasium, Athens, Greece; Joehyun Kim, Bergen County Academies, Hackensack, NJ, USA; Konstanti-
nos Metaxas, 1st High School Ag. Dimitrios, Athens, Greece; Albert Stadler, Herrliberg, Switzerland; Alok
Kumar, New Delhi, India; AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia; Arkady Alt, San
Jose, CA, USA; Joel Schlosberg, Bayside, NY, USA; Nermin Hodi, Dobonica, Bosnia and Herzegovina;
Nikolaos Evgenidis, M.N.Raptou High School, Larissa, Greece; Paolo Perfetti, Universit degli studi di Tor
Vergata Roma, Roma, Italy.

Mathematical Reflections 6 (2016) 5

J396. Let ABC be a triangle with centroid G. The lines AG, BG, CG meet the circumcircle at A1 , B1 , C1
respectively. Prove that

(a) AB1 AC1 BC1 BA1 CA1 CB1 4R4 r2 ,

(b) BA1 CA1 + CB1 AB1 + AC1 BC1 2R(2R r).

Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

Solution by AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia

Let BAC = , ABC = , BCA = , AB1 = x1 , AC1 = x2 , BA1 = y1 , BC1 = y2 , CA1 = z1 , CB1 = z2 .
By the law of cosine on triangle AB1 C, we have

b2 = x21 + z22 2x1 z2 cos( )

= x21 + z22 + 2x1 z2 cos

Using
x21 + z22 2x1 z2
inequality we get,
b2
2x1 z2 (1 + cos ) b2 x1 z2 .
2(1 + cos )
From the other hand,
c2 + a2 b2
cos = .
2ac
Hence we have
b2 b2 ac b2 ac
x 1 z2  = = .
2 1+ c2 +a2 b2 (c + a)2 b2 4p(p b)
2ac

By the similarly, we get

c2 ab a2 bc
x 2 y2 , y1 z1 .
4p(p c) 4p(p a)
Thus, we have

(a)
(abc)4 (4Rpr)4
x1 x2 y1 y2 z1 z2 = = 4R4 r2 .
64p3 (p a)(p b)(p c) 64p2 (pr)2
(b)

a2 bc b2 ac c2 ab
y1 z1 + z2 x1 + x2 y2 + +
4p(p a) 4p(p b) 4p(p c)
abc(a(p b)(p c) + b(p c)(p a) + c(p a)(p b))
=
4p(p a)(p b)(p c)
R
= (a(p b)(p c) + b(p c)(p a) + c(p a)(p b)).
pr

Also solved by Daniel Lasaosa, Pamplona, Spain; Polyahedra, Polk State College, FL, USA; Nikos Ka-
lapodis, Patras, Greece; Ioan Viorel Codreanu, Satulung, Maramures, Romania; Albert Stadler, Herrliberg,
Switzerland.

Mathematical Reflections 6 (2016) 6

 Senior problems

S391. Prove that in any triangle ABC

min(a, b, c) + 2 max(ma , mb , mc ) max(a, b, c) + 2 min(ma , mb , mc ).

Proposed by Titu Andreescu, University of Texas at Dallas, USA

Solution by Li Zhou, Polk State College, Winter Haven, FL, USA

We may assume that a b c. Then

2b2 + 2c2 a2 2c2 + 2a2 b2 2a2 + 2b2 c2

m2a = m2b = m2c = .
4 4 4
So

min(a, b, c) + 2 max(ma , mb , mc ) max(a, b, c) 2 min(ma , mb , mc )

2(m2c m2a )
 
3(a + c)
= c + 2mc a 2ma = c a + = (a c) 1 .
mc + ma 2(mc + ma )

Now by the triangle inequality, 2mc < a + b 2a and 2ma < b + c a + c. Hence, 2(ma + mc ) < 3(a + c),
completing the proof.

Also solved by Daniel Lasaosa, Pamplona, Spain; Pedro Acosta, West Morris Mendham High School,
Mendham, NJ, USA; Joehyun Kim, Bergen County Academies, Hackensack, NJ, USA; Konstantinos Meta-
xas, 1st High School Ag. Dimitrios, Athens, Greece; Arkady Alt, San Jose, CA, USA; Ioan Viorel Codreanu,
Satulung, Maramures, Romania; Nermin Hodi, Dobonica, Bosnia and Herzegovina; Nicusor Zlota Tra-
ian Vuia Technical College, Focsani, Romania; Nikos Kalapodis, Patras, Greece; Paolo Perfetti, Universit
degli studi di Tor Vergata Roma, Roma, Italy; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 7

S392. Let a, b, c be positive real numbers. Prove that
1 1 1 a+b+c
p +p +p .
2 2 2 2
(a + b ) (a + c ) 2 2 2 2
(a + b ) (a + c ) 2 2 2 2
(a + b ) (a + c ) 2abc

Proposed by Mircea Becheanu, University of Bucharest, Romnia

Solution by Arkady Alt, San Jose, CA, USA

Applying Cauchy-Schwarz Inequality to pairs (a, b) and (c, a)we obtain
p p p
(a2 + b2 )(a2 + c2 ) = a2 + b2 c2 + a2 ac + ba = a (b + c)
and, therefore,

X 1 X 1 1 X
p = bc (a + b) (c + a) =
cyc (a2 + b2 )(a2 + c2 ) cyc
a (b + c) abc (a + b) (b + c) (c + a) cyc

abc (a + b + c) + (ab + bc + ca)2

.
abc (a + b) (b + c) (c + a)
abc (a + b + c) + (ab + bc + ca)2 a+b+c
Thus, suffices to prove inequality
abc (a + b) (b + c) (c + a) 2abc
2abc (a + b + c) + 2 (ab + bc + ca)2 (a + b + c) (a + b) (b + c) (c + a)

2abc (a + b + c) + 2 (ab + bc + ca)2 (a + b + c) ((a + b + c) (ab + bc + ca) abc)

3abc (a + b + c) + 2 (ab + bc + ca)2 (a + b + c)2 (ab + bc + ca) .
Since by AM-GM Inequality

3
3
(a + b + c) (ab + bc + ca) 3 abc 3 a2 b2 c2 = 9abc
and
(a + b + c)2 3 (ab + bc + ca) a2 + b2 + c2 ab + bc + ca
then
(a + b + c)2 (ab + bc + ca)
(a + b + c)2 (ab + bc + ca) = +
3
2 (a + b + c)2 (ab + bc + ca)
3abc (a + b + c) + 2 (ab + bc + ca)2 .
3

Also solved by Daniel Lasaosa, Pamplona, Spain; Pedro Acosta, West Morris Mendham High School,
Mendham, NJ, USA; Aditya Ghosh, Kolkata,West Bengal, India; Prajnanaswaroopa S, Bangalore, Karnata-
ka, India; Sushanth Sathish Kumar, Jeffery Trail Middle School, CA, USA; Vincelot Ravoson, Lyce Henri
IV, Paris, France; Konstantinos Metaxas, 1st High School Ag. Dimitrios, Athens, Greece; Nikos Kalapodis,
Patras, Greece; Stanescu Florin, Serban Cioculescu School, Gaesti, Romania; Li Zhou, Polk State College,
Winter Haven, FL, USA; Sardor Bazarbaev, National University of Uzbekistan, Uzbekistan; Albert Stadler,
Herrliberg, Switzerland; Alok Kumar, New Delhi, India; AN-anduud Problem Solving Group, Ulaanbaatar,
Mongolia; Andreas Charalampopoulos, 4th Lyceum of Glyfada, Greece; Jamal Gadirov, Istanbul Universi-
ty Istanbul, Turkey; Ioan Viorel Codreanu, Satulung, Maramures, Romania; Devesh Rajpal, Raipur, India;
Duy Quan Tran, University of Medicine and Pharmacy, Ho Chi Minh, Vietnam; Haimoshri Das, South
Point High School, Kolkata, India; Henry Ricardo, New York Math Circle; Nermin Hodi, Dobonica, Bo-
snia and Herzegovina; Nicusor Zlota, Traian Vuia Technical College, Focsani, Romania; Nikolaos Evgenidis,
M.N.Raptou High School, Larissa, Greece; Vasile Giurgi, Ovidiu Pop, Colegiul National Dragos-Voda, Sighe-
tu Marmatiei, Romania; Paolo Perfetti, Universit degli studi di Tor Vergata Roma, Roma, Italy; Pitchayut
Saengrungkongka, Bangkok, Thailand; Zafar Ahmed, BARC, Mumbai, India.

Mathematical Reflections 6 (2016) 8

S393. If n is an integer such that n2 + 11 is a prime, prove that n + 4 is not a perfect cube.

Proposed by Titu Andreescu, University of Texas at Dallas, USA

Solution by Daniel Lasaosa, Pamplona, Spain

Assume that n + 4 = m3 is a perfect cube for some integer m. Then,

n2 + 11 = m6 8m3 + 27 = m4 m3 2m2 3m + 9 m2 + m + 3 .

Note now that

(2m + 1)2 + 11 11
m2 + m + 3 = > 2,
4 4
and that
2
4 3 2 2m2 m 3 + 3 (m 3)2
m m 2m 3m + 9 = ,
4
where if m 5 or m 1, we clearly have m4 m3 2m2 3m + 9 > 9, whereas for m = 2, 3, 4 we have
2m3 m 3 = 11, 48, 121 for m4 m3 2m2 3m + 9 11 2
4 > 2. Therefore, n + 11 is the product of two
integers, each one of them larger than 1, and it cannot be a prime. Reciprocally, it follows that if n2 + 11 is
prime, n + 4 cannot be a perfect cube.

Also solved by Pedro Acosta, West Morris Mendham High School, Mendham, NJ, USA; Aditya Ghosh,
Kolkata,West Bengal, India; Sushanth Sathish Kumar, Jeffery Trail Middle School, CA, USA; Joehyun Kim,
Bergen County Academies, Hackensack, NJ, USA; Vincelot Ravoson, Lyce Henri IV, Paris, France; Li Zhou,
Polk State College, Winter Haven, FL, USA; Albert Stadler, Herrliberg, Switzerland; Alessandro Ventullo,
Milan, Italy; AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia; Haimoshri Das, South Point High
School, Kolkata, India; Joel Schlosberg, Bayside, NY, USA; Jos Hernndez Santiago, Morelia, Michoacn,
Mexico; Kousik Sett, India, West Bengal, Hooghly; Nikolaos Evgenidis, M.N.Raptou High School, Larissa,
Greece.

Mathematical Reflections 6 (2016) 9

S394. Prove that in any triangle, inscribed in a circle of radius R, the following inequality holds:
2
a2 b2 c2

R R R
+ + + + .
bc ca ab a b c

Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

Solution by Daniel Lasaosa, Pamplona, Spain

abc
Multiplying both sides by 2a2 b2 c2 and remembering that the area of ABC is S = 4S , the inequality is
equivalent to
2R2 (ab + bc + ca)2 2abc a3 + b3 + c3 = 6a2 b2 c2 +

+abc(a + b + c) (a b)2 + (b c)2 + (c a)2 ,

r(a+b+c)
or using also that S = 2 , to

R a2 b2 + b2 c2 + c2 a2


2 2 2
(a b) + (b c) + (c a) + 4R2 12Rr.
r(a + b + c)2

Now, using the Sine Law and after some algebra, we find that

(a b)2 + (b c)2 + (c a)2 = 2R2 6Rr 2r2 +

+2R2 (cos A cos B + cos B cos C + cos C cos A) ,

and using Herons formula, that

a2 b2 + b2 c2 + c2 a2 2a2 b2 + 2b2 c2 + 2c2 a2 a4 b4 c4 = 16S 2 ,

or it suffices to show that

R2 (cos A cos B + cos B cos C + cos C cos A) R2 Rr + r2 .

Now,
(cos A + cos B + cos C)2 (R + r)2
cos A cos B + cos B cos C + cos C cos A = ,
3 3R2
or again it suffices to show that

(R + r)2 3R2 3Rr + 3r2 , 0 2R2 5Rr + 2r2 = (R 2r)(2R r),

clearly true because R 2r. The conclusion follows, equality holds iff ABC is equilateral.

Also solved by Nikos Kalapodis, Patras, Greece; Arkady Alt, San Jose, CA, USA; Nermin Hodi, Do-
bonica, Bosnia and Herzegovina; Nicusor Zlota, Traian Vuia Technical College, Focsani, Romania; Paolo
Perfetti, Universit degli studi di Tor Vergata Roma, Roma, Italy; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 10

S395. Let a, b, c be positive integers such that

a2 b2 + b2 c2 + c2 a2 69abc = 2016.

Find the least possible value of min(a, b, c).

Proposed by Titu Andreescu, University of Texas at Dallas, USA

Solution by Li Zhou, Polk State College, USA

We show that the answer is 2. First, it is easy to check that (a, b, c) = (12, 12, 2) is a solution. Next, suppose
that a b c = 1. Then the equation can be written as (ab 90)(ab + 23) + (a b)2 + 54 = 0. Hence
b 9. Viewing the equation as quadratic in a: (b2 + 1)a2 69ba + b2 2016 = 0, we then check that
the discriminant (69b)2 4(b2 + 1)(b2 2016) is not a perfect square for b = 1, 2, . . . , 9. Hence, there is no
solution if a b c = 1.

Also solved by Daniel Lasaosa, Pamplona, Spain; Albert Stadler, Herrliberg, Switzerland; Alessandro
Ventullo, Milan, Italy; Nermin Hodi, Dobonica, Bosnia and Herzegovina.

Mathematical Reflections 6 (2016) 11

S396. Let P (X) = an X n + + a1 X + a0 be a polynomial with complex coefficients. Prove that if all roots
of P (X) have modulus 1, then
2
|a0 + a1 + + an | |a1 + 2a2 + + nan | .
n
When does the equality hold?

Proposed by Florin Stnescu, Geti, Romnia

Solution by Li Zhou, Polk State College, USA

Note that a0 + a1 + + an = P (1) and a1 + 2a2 + + nan = P 0 (1). If P (1) = 0 then the inequality is
trivially true, with equality if and only if P 0 (1) = 0, that is, if and only if 1 is a zero of P (X) with multiplicity
2.
Now consider that P (1) 6= 0. Let zk = eitk , with 0 < tk < 2 for 1 k n, be the zeros of P (X). Then
P 0 (X)/P (X) = 1/(X z1 ) + + 1/(X zn ). Since
1 1 (1 cos tk ) + i sin tk 1 i tk
= = = + cot ,
1 zk (1 cos tk ) i sin tk 2(1 cos tk ) 2 2 2
 0      
 P (1)   1 1   n i t1 tn  n
 P (1)  =  1 z1 + + 1 zn  =  2 + 2 cot 2 + + 2  2 ,
  

with equality if and only if cot(t1 /2) + + cot(tn /2) = 0.

Alternative solution by Joel Schlosberg, Bayside, NY, USA

By the fundamental theorem of algebra,
n
Y
P (X) = an (X rk )
k=1

for roots r1 , . . . , rn C. For any X C that is not a root of P (X),

n
X
ln(P (X)) = ln an + ln(X rk )
k=1

n
P 0 (X) X 1
= .
P (X) X rk
k=1

If P (1) = a0 + a1 + + an = 0, the inequality is trivially true. If P (1) = a0 + a1 + + an 6= 0, 1 is not a

root of P (X), so
n
a1 + 2a2 + + nan P 0 (1) X 1
= = .
a0 + a1 + + an P (1) 1 rk
k=1

If |z| = |x + yi| = 1 for z 6= 1 C, x, y R, then

1 1 1 x + yi 1 y
= = 2 2
= + i,
1z 1 x yi (1 x) + y 2 2 2x

((1 x)2 + y 2 = 2 2x 6= 0 since otherwise z = 1). Thus

n n
!  

a1 +2a2 ++nan
 X 1 X 1 n
< a0 +a1 ++an =< = < =
1 rk 1 rk 2
k=1 k=1
  r 
 a1 + 2a2 + + nan  n 2 h  a1 +2a2 ++nan i2 n

 a0 + a1 + + an 
= + = a0 +a1 ++an ,
2 2

Mathematical Reflections 6 (2016) 12

which is equivalent to the inequality.
Equality holds iff a1a+2a 2 ++nan
0 +a1 ++an
R.

Also solved by Daniel Lasaosa, Pamplona, Spain; Sardor Bazarbaev, National University of Uzbeki-
stan, Uzbekistan; Albert Stadler, Herrliberg, Switzerland; AN-anduud Problem Solving Group, Ulaanbaatar,
Mongolia; Paolo Perfetti, Universit degli studi di Tor Vergata Roma, Roma, Italy.

Mathematical Reflections 6 (2016) 13

 Undergraduate problems

U391. Find all positive integers n such that

(n)3 n2 .

Proposed by Alessandro Ventulo, Milan, Italy

Solution by Li Zhou, Polk State College, Winter Haven, FL, USA

It is easy to check that n = 1, 2, 3, 4, 6, 8, 10, 12, 18, 24, 30, 42 are solutions. We show that they are the only
solutions.
Suppose that n 5. Let f (n) = (n)3 /n2 . Note that f is multiplicative and f (pe ) = pe3 (p 1)3 for
all prime p and integer e 1. In particular, f (2e ) = 2e3 , f (3e ) = 8(3e3 ), f (5e ) = 64(5e3 ), and for p 7
e1 ek
and e 1, f (pe ) 63 (72 ) = 216 49 . Now let p1 pk be the prime factorization of n, with p1 < . . . < pk .
If k = 1, then (p1 , e1 ) = (2, 3), so n = 8.
Now consider k = 2. If p1 3, then f (n) 89 25 64
> 1. So p1 = 2. If e1 4, then f (n) 2 89 > 1. If
e1 {2, 3}, then (p2 , e2 ) can only be (3, 1), that is n {12, 24}. If e1 = 1, then (p2 , e2 ) {(3, 1), (3, 2), (5, 1)},
that is, n {6, 18, 10}.
Next consider k = 3. Again we must have p1 = 2. If e1 2, then f (n) 12 89 64 25 > 1. So e1 = 1. If
p2 5, then f (n) 41 64 25 216
49 > 1. So p 2 = 3. If e 2 2, then f (n) 1 8 64

4 3 25 > 1. So e2 = 1. Then
we must have (p3 , e3 ) = (5, 1) or (p3 , e3 ) = (7, 1), that is, n = 30, 42. The reason is because if p3 11 then
f (n) 2000 e3 1 > 1.
9 11
Finally, if k 4, then
1 8 64 216
f (n) > 1.
4 9 25 49

Also solved by Daniel Lasaosa, Pamplona, Spain; Simon Pellicer, Paris, France; Sardor Bazarbaev, Na-
tional University of Uzbekistan, Uzbekistan; Albert Stadler, Herrliberg, Switzerland; Joel Schlosberg, Bayside,
NY, USA; Jos Hernndez Santiago, Morelia, Michoacn, Mexico.

Mathematical Reflections 6 (2016) 14

U392. Let f (x) = x4 + 3x3 + ax2 + bx + c be a polynomial with real coefficients which has four real roots in
the interval (1, 1). Prove that
 8
2 5 2
(1 a + c) + (3 b) .
4

Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

Solution by Mircea Becheanu, University of Bucharest, Romania

Let x1 , x2 , x3 , x4 be the roots of f (x). Then we have

f (i) = 1 3i a + bi + c = (i x1 )(i x2 )(i x3 )(i x4 )

and
|f (i)|2 = (1 a + c)2 + (3 b)2 = (1 + x21 )(1 + x22 )(1 + x23 )(1 + x24 ).
Now, we have to show that
 8
5
(1 + x21 )(1 + x22 )(1 + x23 )(1 + x24 ) .
4
This is equivalent to
5
ln(1 + x21 ) + ln(1 + x22 ) + ln(1 + x23 ) + ln(1 + x24 ) 8 ln .
4
Now, using the fact that the function g(x) = ln(1 + x2 ) is convex on the interval (1, 1) and the sum
x1 + x2 + x3 + x4 = 3, the result comes from Jensen inequality.

Also solved by Daniel Lasaosa, Pamplona, Spain, Li Zhou, Polk State College, Winter Haven, FL, USA;
Sardor Bazarbaev, National University of Uzbekistan, Uzbekistan; Nicusor Zlota, Traian Vuia Technical
College, Focsani, Romania; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 15

U393. Evaluate
cos x cos 2x n cos nx 1
lim
x0 cos x cos 2x cos nx 1
Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

Solution by AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia

First of all,
1 cos x cos 2x . . . cos nx = n1
P Qm
m=0 ( k=0 cos kx) (1 cos(m + 1)x) .
Then,

n
1 cos x cos 2x . . .
cos nx
n1 m
!
X Y  p 
k
= cos kx 1 m+1 cos(m + 1)x
m=0 k=0
n1 m
!
X Y
k (1 cos(m + 1)x)
= cos kx Pm m+1 p .
m=0 k=0 j=0 (cos(m + 1)x)j

!2
1 cos(m + 1)x sin m+1
2 x (m + 1)2 (m + 1)2
lim = lim m+1 = .
x0 x2 x0
2 x
2 2

and

Pn1 (m+1)2 1
cos x cos 2x . . . n cos nx 1 m=0 2 m+1
lim = Pn1 (m+1)2
x0 cos x cos 2x . . . cos nx 1
m=0 2
n(n+1)
2 3
= n(n+1)(2n+1)
= .
2n + 1
6

Also solved by Daniel Lasaosa, Pamplona, Spain; Pedro Acosta, West Morris Mendham High School,
Mendham, NJ, USA; Li Zhou, Polk State College, Winter Haven, FL, USA; Sardor Bazarbaev, National
University of Uzbekistan, Uzbekistan; Adam Krause, student, SUNY Brockport, NY, USA; Albert Stadler,
Herrliberg, Switzerland; Arkady Alt, San Jose, CA, USA; Joel Schlosberg, Bayside, NY, USA; Moubinool
Omarjee, Lyce Henri IV, Paris, France; Nicusor Zlota, Traian Vuia Technical College, Focsani, Romania;
Vasile Giurgi, Ovidiu Pop, Colegiul National Dragos-Voda, Sighetu Marmatiei, Romania; Paolo Perfetti,
Universit degli studi di Tor Vergata Roma, Roma, Italy; Zafar Ahmed, BARC, Mumbai, India.

Mathematical Reflections 6 (2016) 16

U394. Let x0 > 1 be an integer and define xn+1 = d2 (xn ), where d(k) denotes the number of positive divisors
of k. Prove that
lim xn = 9.
n

Proposed by Albert Stadler, Herrliberg, Switzerland

Solution by Li Zhou, Polk State College, Winter Haven, FL, USA

Since x0 > 1, x1 = y 2 for some integer y 2. Let pe11 pemm be the prime factorization of y. Then
x2 = d2 (y 2 ) = (2e1 + 1)2 (2em + 1)2 . Now we claim that for any odd prime p and e 1, p2e (2e + 1)2 ,
with equality if and only if p = 3 and e = 1. Clearly, p2 32 , with equality if only if p = 3. As an induction
hypothesis, assume that the claim is true for some e 1. Then

p2(e+1) = p2 (p2e ) p2 (2e + 1)2 = (2pe + p)2 > (2e + 3)2 ,

completing the induction and establishing the claim. Therefore, xn xn+1 for all n 2, with equality if
and only if xn = 32 . Since the sequence hxn in2 cannot strictly decreases forever, there exists N 2 such
that x2 > x3 > > xN and xN = 32 . Finally, d2 (32 ) = 9, completing the proof.

Also solved by Daniel Lasaosa, Pamplona, Spain; Joel Schlosberg, Bayside, NY, USA.

Mathematical Reflections 6 (2016) 17

U395. Evaluate
x2 + 6
Z
dx.
(x cos x 3 sin x)2

Proposed by Abdelouahed Hamdi, Doha, Qatar

Solution by Li Zhou, Polk State College, USA

Noticing  
2 2 3
2
(x cos x 3 sin x) = x + 9 cos x + arctan ,
x
we let u = x + arctan x3 . Then
x2 + 6
 
3
du = 1 + 2
dx = dx,
x +9 x2 + 9
and

x2 + 6 tan x + x3
Z Z
1
dx = du = tan u + C = +C
(x cos x 3 sin x)2 cos2 u 1 x3 tan x
x sin x + 3 cos x
= + C.
x cos x 3 sin x

Alternative solution by Daniel Lasaosa, Pamplona, Spain;

Denote f (x) = 3 cos x + x sin x and g(x) = x cos x 3 sin x. Note that f 0 (x) = 2 sin x + x cos x and
g 0 (x) = x sin x 2 cos x, or
f 0 (x)g(x) f (x)g 0 (x) =
= x2 cos2 x + 6 sin2 x 5x sin x cos x + 6 cos2 x + x2 sin2 x + 5x sin x cos x =

= x2 + 6 cos2 x + sin2 x = x2 + 6,

or
f 0 (x)g(x) f (x)g 0 (x) x2 + 6
 
d f (x)
= = ,
dx g(x) g 2 (x) (x cos x 3 sin x)2
for
x2 + 6
Z
f (x) 3 cos x + x sin x
2
dx = +C = + C,
(x cos x 3 sin x) g(x) x cos x 3 sin x
where C is an integration constant, and we are done.

Also solved by Albert Stadler, Herrliberg, Switzerland; Pedro Acosta, West Morris Mendham High School,
Mendham, NJ, USA; Aditya Ghosh, Kolkata,West Bengal, India; Alessandro Ventullo, Milan, Italy; Alok
Kumar, New Delhi, India; AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia; Joel Schlosberg,
Bayside, NY, USA; Moubinool Omarjee, Lyce Henri IV, Paris, France; Ovidiu Pop, Colegiul National
Dragos-Voda, Sighetu Marmatiei, Romania; Paolo Perfetti, Universit degli studi di Tor Vergata Roma,
Roma, Italy; Zafar Ahmed, BARC, Mumbai, India.

Mathematical Reflections 6 (2016) 18

U396. Let S8 be the symmetric group of permutations of an 8-element set and let k be the number of its
abelian subgroups of order 16. Prove that k 1050.

Proposed by Mircea Becheanu, University of Bucharest, Romnia

Solution by Li Zhou, Polk State College, Winter Haven, FL, USA

Let a1 , a2 , . . . , a8 be a permutation of 1, 2, . . . , 8. We count three types of abelian subgroups of S8 .

Type I: Let a = (a1 a2 ), b = (a3 a4 ), c = (a5 a6 ), and d = (a7 a8 ). Then a2 = b2 = c2 = d2 = e and a, b, c, d

pairwise commute. Let G = {ai bj cm dn : 0 i, j, m, n 1}. Then G is an abelian subgroup of order 16. The
number of such subgroups (all isomorphic to Z2 Z2 Z2 Z2 ) is the number of ways to partition 1, 2, . . . , 8
into four 2-cycles: 28!
4 4! = 105.

Type II: Let a = (a1 a2 a3 a4 ), b = (a5 a6 ), and c = (a7 a8 ). Then a4 = b2 = c2 = e and a, b, c pairwise
commute. Let G = {ai bm cn : 0 i 3, 0 m, n 1}. Then G is an abelian subgroup of order 16. Note
that a1 = (a1 a4 a3 a2 ) 6= a and {a1 , b, c} generates the same group G. So the number of such subgroups
(all isomorphic to Z4 Z2 Z2 ) is 21 of the number of ways to partition 1, 2, . . . , 8 into one 4-cycle and two
2-cycles: 21 428!2 2! = 630.

Type III: Let a = (a1 a2 a3 a4 ) and b = (a5 a6 a7 a8 ). Then a4 = b4 = e and ab = ba. Let G = {ai bj : 0
i, j 3}. Then G is an abelian subgroup of order 16. Note again that G can also be generated by {a1 , b},
{a, b1 }, or {a1 , b1 }. So the number of such subgroups (all isomorphic to Z4 Z4 ) is 41 of the number of
ways to partition 1, 2, . . . , 8 into two 4-cycles: 41 48!


2 2! = 315.
Therefore, k 105 + 630 + 315 = 1050.

Also solved by Daniel Lasaosa, Pamplona, Spain; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 19

 Olympiad problems

O391. Find all 4-tuples (x, y, z, w) of positive integers such that

(xy)3 + (yz)3 + (zw)3 252yz = 2016.

Proposed by Titu Andreescu, University of Texas at Dallas, USA

Solution by Alessandro Ventullo, Milan, Italy

The given equation can be written as

(xy)3 + (zw)3 + yz(y 2 z 2 252) = 2016.

Observe that it must be yz(y 2 z 2 252) 2016, so yz 18. It follows that

(xy)3 + (zw)3 {2267, 2512, 2745, 2960, 3151, 3312, 3437, 3520, 3555,
3536, 3457, 3312, 3095, 2800, 2421, 1952, 1387, 720}.

A case by case analysis gives (xy)3 + (zw)3 {2745, 2960}. If (xy)3 + (zw)3 = 2745, we get xy = 1, zw =
14, yz = 3 or xy = 14, zw = 1, yz = 3, which gives no solutions. If (xy)3 + (zw)3 = 2960, then xy = 6, zw =
14, yz = 4 or xy = 14, zw = 6, yz = 4. We get (x, y, z, w) {(3, 2, 2, 7), (7, 2, 2, 3)}.

Also solved by Daniel Lasaosa, Pamplona, Spain; Albert Stadler, Herrliberg, Switzerland; Li Zhou, Polk
State College, Winter Haven, FL, USA.

Mathematical Reflections 6 (2016) 20

O392. Let ABC be a triangle with area . Prove that

1 1 1 1 3
2
+ + .
3r ra ha rb hb rc hc

Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

Solution by Paolo Perfetti, Universit degli studi di Tor Vergata Roma, Roma, Italy
First of all,
2s(s b)(s c)
ra ha = , 2 = s(s a)(s b)(s c)
a
r
(s a)(s b)(s c)
r= s = (a + b + c)/2
s
Lets change variables a = y + z, b = x + z, c = x + y, x, y, z 0. The inequality becomes

x+y+z xy + yz + zx 3
p
3xyz (x + y + z)xyz (x + y + z)xyz
At left we have (x+y+z)2 3(xy+yz+zx) which is a direct consequence of (xy)2 +(yz)2 +(zx)2 0.

At right we get squaring

(xy + yz + zx)2 3(x + y + z)xyz (xy)2 + (yz)2 + (zx)2 xyz(x + y + z)

and this follows by

((xy)2 + (yz)2 )/2 x2 yz

and cyclic. This concludes the proof.

Also solved by Daniel Lasaosa, Pamplona, Spain; Pedro Acosta, West Morris Mendham High School,
Mendham, NJ, USA; Aditya Ghosh, Kolkata,West Bengal, India; Sushanth Sathish Kumar, Jeffery Trail
Middle School, CA, USA; Sardor Bazarbaev, National University of Uzbekistan, Uzbekistan; AN-anduud
Problem Solving Group, Ulaanbaatar, Mongolia; Arkady Alt, San Jose, CA, USA; Arpon Basu, AECS-4,
Mumbai, India; Ioan Viorel Codreanu, Satulung, Maramures, Romania; Nermin Hodi, Dobonica, Bosnia
and Herzegovina; Nicusor Zlota Traian Vuia Technical College, Focsani, Romania; Nikolaos Evgenidis,
M.N.Raptou High School, Larissa, Greece; Albert Stadler, Herrliberg, Switzerland; Telemachus Baltsavias,
Keramies Junior High School, Kefalonia, Greece; Li Zhou, Polk State College, Winter Haven, FL, USA.

Mathematical Reflections 6 (2016) 21

O393. Let a, b, c, d be nonnegative real numbers such that a2 + b2 + c2 + d2 = 4. Prove that
1 1 1 1
+ + + 1.
5 ab 5 bc 5 cd 5 da

Proposed by Titu Andreescu, University of Texas at Dallas, USA

Solution by AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia

Using AM-GM inequality we get,

4 = a2 + b2 + c2 + d2 6 = (1 + 1 + a2 + b2 ) + (c2 + d2 )

4
4 1 1 a2 b2 + (c2 + d2 )

= 4 ab + (c2 + d2 ) 4 ab.

Hence we have,
3
ab (1)
2
Using (1) we get

1 1 1 ( ab 1)2
= + ( ab 1) +
5 ab 4 16 16(5 ab)

1 1 ( ab 1)2
+ ( ab 1) +
16 5 32


4 16
1
= (2 ab + 3 ab + 23).
112
Similarly,
1 1
(2 bc + 3 bc + 23) (2)
5 bc 112
1 1
(2 cd + 3 cd + 23) (3)
5 cd 112
1 1
(2 da + 3 da + 23) (4)
5 da 112
Adding (1), (2), (3), (4) and using AM-GM inequality we get,
1 1 1 1
+ + +
5 ab 5 bc 5 cd 5 da
1  
2(ab + bc + cd + da) + 3( ab + bc + cd + da) + 92
112
1  2 X  
4
(a + b2 ) + (b2 + c2 ) + (c2 + d2 ) + (d2 + a2 ) + 3 a2 b2 1 1 + 92
112  
1 3 2 2 2 2


8+ 2a + 2b + 2c + 2d + 8 + 92 = 1.
112 4

Equality holds only if a = b = c = d = 1.

Alternative solution by Daniel Lasaosa, Pamplona, Spain

By symmetry in the problem, it suffices to show that

1 1 1
+ .
5 ab 5 cd 2

Mathematical Reflections 6 (2016) 22

 a2 +b2 +c2 +d2
After multiplying by the product of denominators (clearly positive since ab, cd 2 = 2) and
rearranging terms, this inequality is equivalent to

5 3 ab 3 cd + abcd 0.

Now, using the AM-GM and the AM-QM inequalities, we have

r
a+b+c+d a2 + b2 + c2 + d2
ab + cd 2 = 2,
2 4

or we can define = 2 ab cd, and
2 ab cd
abcd = 2 2 + ,
2
or it suffices to show that
2 + 2 + 2 ab cd 0,
clearly true since, by the AM-GM inequality, we have

a2 + b2 + c2 + d2
ab + cd = 2,
2
and 2 + 2 0. Note that equality requires = 0, and simultaneously a = b and c = d, which results in
a = b = c = d.
The conclusion follows, equality holds iff a = b = c = d = 1, in which case all terms in the LHS are 14 .

Also solved by Joehyun Kim, Bergen County Academies, Hackensack, NJ, USA; Sardor Bazarbaev, Na-
tional University of Uzbekistan, Uzbekistan; Nermin Hodi, Dobonica, Bosnia and Herzegovina; Nicusor
Zlota, Traian Vuia Technical College, Focsani, Romania; Paolo Perfetti, Universit degli studi di Tor Vergata
Roma, Roma, Italy; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 23

O394. Let a, b, c be positive real numbers with a + b + c = 3. Prove that
1 1 1
a
+ b
+ 1.
(b + 2c) (c + 2a) (a + 2b)c

Proposed by Nguyen Viet Hung, Hanoi University of Science, Vietnam

Solution by Daniel Lasaosa, Pamplona, Spain

Note first that we may write
1
= exp (a ln(b + 2c)) ,
(b + 2c)a
or since exp(x) is a strictly convex function, we have
 
1 1 1 a ln(b + 2c) + b ln(c + 2a) + c ln(a + 2b)
+ + 3 exp ,
(b + 2c)a (c + 2a)b (a + 2b)c 3

with equality iff a ln(b + 2c) = b ln(c + 2a) = c ln(a + 2b), or since exp(x) is a strictly increasing function, it
suffices to show that
a ln(b + 2c) + b ln(c + 2a) + c ln(a + 2b) 3 ln(3).
Now, since ln(x) is a concave function, we have
 
a(b + 2c) + b(c + 2a) + c(a + 2b)
a ln(b + 2c) + b ln(c + 2a) + c ln(a + 2b) (a + b + c) ln =
a+b+c

= 3 ln(ab + bc + ca),
and since ln(x) is a strictly increasing function, it finally suffices to show that ab+bc+ca 3, or equivalently,
that 3(ab + bc + ca) 9 = a2 + b2 + c2 + 2(ab + bc + ca), ie that a2 + b2 + c2 ab + bc + ca, clearly true by the
scalar product inequality, and where equality holds iff a = b = c = 1. The conclusion follows, substitution
shows that the necessary condition a = b = c = 1 is also sufficient.

Also solved by AN-anduud Problem Solving Group, Ulaanbaatar, Mongolia; Ioan Viorel Codreanu, Sa-
tulung, Maramures, Romania; Nermin Hodi, Dobonica, Bosnia and Herzegovina; Nicusor Zlota, Traian
Vuia Technical College, Focsani, Romania; Paolo Perfetti, Universit degli studi di Tor Vergata Roma, Ro-
ma, Italy; Albert Stadler, Herrliberg, Switzerland; Li Zhou, Polk State College, Winter Haven, FL, USA;
Zafar Ahmed, BARC, Mumbai, India.

Mathematical Reflections 6 (2016) 24

O395. Let a, b, c, d be nonnegative real numbers such that ab + bc + cd + da + ac + bd = 6. Prove that

a4 + b4 + c4 + d4 + 8abcd 12.

Proposed by Marius Stnean, Zalu, Romnia

Solution by Daniel Lasaosa, Pamplona, Spain

Note that it suffices to show that

(ab + bc + cd + da + ac + bd)2 = 36 3 a4 + b4 + c4 + d4 + 24abcd.

Define
f (a, b, c, d) = 3 a4 + b4 + c4 + d4 + 24abcd (ab + bc + cd + da + ac + bd)2 ,

and since we may assume wlog by symmetry in the problem that a b c d, it suffices to show that
f (a, b, c, d) 0 when a b c d 0. Note that we may define x = a c and y = b c, such that
x y 0, and with this notation,

f (a, b, c, d) f (c, c, c, d) = 6cd(c d)(x + y) + 5c(c d) x2 + y 2 + 9c2 (x y)2 +

+8cdxy + d(c d)(x + y)2 + 6c x3 + y 3 + 6c(x + y)(x y)2 + 2(c d)xy(x + y)+

2
+3 x2 y 2 + 5x2 y 2 .
Since c d 0, all terms in the RHS are non-negative. The last term being zero requires x2 y 2 = 0, whereas
the previous one requires x2 = y 2 . Since setting x = y = 0 makes the RHS zero regardless of the values of c
and d, we conclude that f (a, b, c, d) f (c, c, c, d), with equality iff a = b = c. Note finally that

f (c, c, c, d) = 6c3 d 9c2 d2 + 3d4 = 3d(2c + d)(c d)2 ,

clearly non-negative, being zero iff either c = d, or d = 0, or c = d = 0. This last option results in
ab+bc+cd+da+ac+bd
= 0, absurd. On the other hand, d = 0 results in ab+bc+cd+da+ac+bd = 3c2 = 6 for
a = b = c = 2 and d = 0, whereas c = d results in ab+bc+cd+da+ac+bd = 6c2 = 6 for a = b = c = d = 1.
Substitution of these two sets of values results indeed in equality in the proposed inequality.
The conclusion


follows, equality holds iff either a = b = c = d = 1 or (a, b, c, d) is a permutation of 2, 2, 2, 0 .

Also solved by Arkady Alt, San Jose, CA, USA; Sardor Bazarbaev, National University of Uzbekistan,
Uzbekistan; Nicusor Zlota, Traian Vuia Technical College, Focsani, Romania; Paolo Perfetti, Universit degli
studi di Tor Vergata Roma, Roma, Italy; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 25

O396. Find all polynomials P (X) with positive integer coefficients having the following property: for any
positive integer n and every prime p such that n is a quadratic residue modulo p, P (n) is also a
quadratic residue modulo p.

Proposed by Vlad Matei, University of Wisconsin, Madison, USA

Solution by Li Zhou, Polk State College, Winter Haven, FL, USA

We show that the solutions are P (X) = Q(X)2 or XQ(X)2 , where Q(X) Z[X] and Q(X)2 has positive
integer coefficients.
First, if n is a quadratic residue modulo p, then n m2 (mod p), so both Q(n)2 and nQ(n)2 m2 Q(n)2
are quadratic residues modulo p.
To show that these polynomials are the only solutions, we use two known theorems.

Theorem 1. If a is a nonsquare integer, then there are infinitely many primes p for which a is a quadratic
nonresidue. (See K. Ireland & M. Rosen, A Classical Intro. to Modern Number Theory, 2nd ed., Springer,
1990, p.57.)
p
Theorem 2. If f (X) Z[X] such that f (n) Z for all positive integers n, then there exists a polynomial
g(X) Z[X] such that f = g 2 . (See T. Andreescu & G. Dospinescu, Problems from the Book, 2nd ed., XYZ
Press, 2010, p.224.)

Now suppose that P (X) = ad X d + +a1 X +a0 has the property. Since any n = m2 is a quadratic residue
modulo all primes p, Theorem 1 implies that f (m) = P (m2 ) must be perfect squares for all positive integers
m. Then Theorem 2 implies that P (X 2 ) = f (X) = g(X)2 for some g(X) Z[X]. Write g(X) = bd X d + +
b1 X + b0 . Comparing coefficients in P (X 2 ) = g(X)2 , we see that if d = 2k, then bd1 = bd3 = = b1 = 0
and  2  2
P (X) = g X = b2k X k + b2k2 X k1 + + b2 X + b0 .

Similarly, if d = 2k + 1, then bd1 = bd3 = = b0 = 0 and

 2
k k1
P (X) = X b2k+1 X + b2k1 X + + b3 X + b1 .

The proof is now complete.

Also solved by Navid Safaei, Sharif University of Technlogy, Tehran, Iran; Daniel Lasaosa, Pamplona,
Spain; Albert Stadler, Herrliberg, Switzerland.

Mathematical Reflections 6 (2016) 26