crux mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 if the number of 3s used is exactly three,...

43
Crux Mathematicorum VOLUME 43, NO. 9 November/Novembre 2017 Editorial Board Editor-in-Chief Kseniya Garaschuk University of the Fraser Valley Contest Corner Editor John McLoughlin University of New Brunswick Olympiad Corner Editor Carmen Bruni University of Waterloo Book Reviews Editor Robert Bilinski Coll` ege Montmorency Articles Editor Robert Dawson Saint Mary’s University Problems Editors Edward Barbeau University of Toronto Chris Fisher University of Regina Edward Wang Wilfrid Laurier University Dennis D. A. Epple Berlin, Germany Magdalena Georgescu BGU, Be’er Sheva, Israel Shaun Fallat University of Regina Assistant Editors Chip Curtis Missouri Southern State University Allen O’Hara University of Western Ontario Guest Editors Kelly Paton University of British Columbia Alessandro Ventullo University of Milan Editor-at-Large Bill Sands University of Calgary Managing Editor Denise Charron Canadian Mathematical Society Copyright c Canadian Mathematical Society, 2017

Upload: others

Post on 15-Jul-2020

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

Crux MathematicorumVOLUME 43, NO. 9 November/Novembre 2017

Editorial Board

Editor-in-Chief Kseniya Garaschuk University of the Fraser Valley

Contest Corner Editor John McLoughlin University of New Brunswick

Olympiad Corner Editor Carmen Bruni University of Waterloo

Book Reviews Editor Robert Bilinski College Montmorency

Articles Editor Robert Dawson Saint Mary’s University

Problems Editors Edward Barbeau University of Toronto

Chris Fisher University of Regina

Edward Wang Wilfrid Laurier University

Dennis D. A. Epple Berlin, Germany

Magdalena Georgescu BGU, Be’er Sheva, Israel

Shaun Fallat University of Regina

Assistant Editors Chip Curtis Missouri Southern State University

Allen O’Hara University of Western Ontario

Guest Editors Kelly Paton University of British Columbia

Alessandro Ventullo University of Milan

Editor-at-Large Bill Sands University of Calgary

Managing Editor Denise Charron Canadian Mathematical Society

Copyright c© Canadian Mathematical Society, 2017

Page 2: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

374

IN THIS ISSUE / DANS CE NUMERO

375 The Contest Corner: No. 59 John McLoughlin

375 Problems: CC291–CC295

377 Solutions: CC241–CC245

382 The Olympiad Corner: No. 357 Carmen Bruni

382 Problems: OC351–OC355

384 Solutions: OC291–OC295

389 Focus On . . . : No. 28 Michel Bataille

394 Quadratic Allemands Ted Barbeau

398 Problems: 4281–4290

403 Solutions: 4181–4190

414 Solvers and proposers index

Crux MathematicorumFounding Editors / Redacteurs-fondateurs: Leopold Sauve & Frederick G.B. Maskell

Former Editors / Anciens Redacteurs: G.W. Sands, R.E. Woodrow, Bruce L.R. Shawyer,

Shawn Godin

Crux Mathematicorum

with Mathematical MayhemFormer Editors / Anciens Redacteurs: Bruce L.R. Shawyer, James E. Totten, Vaclav Linek,

Shawn Godin

Crux Mathematicorum, Vol. 43(9), November 2017

Page 3: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE CONTEST CORNER /375

THE CONTEST CORNERNo. 59

John McLoughlin

The problems featured in this section have appeared in, or have been inspired by, a math-ematics contest question at either the high school or the undergraduate level. Readersare invited to submit solutions, comments and generalizations to any problem. Please seesubmission guidelines inside the back cover or online.

To facilitate their consideration, solutions should be received by May 1, 2018.

The editor thanks Andre Ladouceur, Ottawa, ON, for translations of the problems.

CC291. The point P is on the parabola x2 = 4y. The tangent at P meetsthe line y = −1 at the point A. For the point F (0, 1), prove that ∠AFP = 90◦

for all positions of P , except (0, 0).

CC292. Let a be the length of a side and b be the length of a diagonal in theregular pentagon PQRST as shown.

Prove thatb

a− a

b= 1.

CC293. The transformation T : (x, y) 7→(− 1

2 (3x− y),− 12 (x+ y)

)is applied

repeatedly to the point P0(3, 1), which produces a sequence of points P1, P2, . . ..Show that the area of the convex quadrilateral defined by any four consecutivepoints is constant.

CC294.

a) Prove that sin 2A =2 tanA

1 + tan 2A, where 0 < A < π/2.

b) If sin 2A = 4/5, find tanA.

Copyright c© Canadian Mathematical Society, 2017

Page 4: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

376/ THE CONTEST CORNER

CC295. In how many ways is it possible to choose four distinct integers from1, 2, 3, 4, 5, 6 and 7, so that their sum is even?

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

CC291. On considere un point P sur la parabole d’equation x2 = 4y.La tangente au point P coupe la droite d’equation y = −1 au point A. Soit lepoint F (0, 1). Demontrer que ∠AFP = 90◦ pour toutes les positions de P , al’exception de (0, 0).

CC292. Dans la figure suivante, PQRST est un pentagone regulier, a est lalongueur de ses cotes et b est la longueur de ses diagonales.

Demontrer queb

a− a

b= 1.

CC293. On fait subir la transformation T : (x, y) 7→(− 1

2 (3x− y),− 12 (x+ y)

)de facon repetee au point P0(3, 1) et aux images successives, ce qui produit unesuite de points P1, P2, . . . Demontrer que l’aire du quadrilatere convexe defini parn’importe quels quatre points consecutifs est constante.

CC294.

a) Demontrer que sin 2A =2 tanA

1 + tan 2A, ou 0 < A < π/2.

b) Sachant que sin 2A =4

5, determiner tanA.

CC295. De combien de facons est-il possible de choisir quatre entiers dis-tincts, parmi les entiers 1, 2, 3, 4, 5, 6 et 7, de maniere que leur somme soit paire?

Crux Mathematicorum, Vol. 43(9), November 2017

Page 5: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE CONTEST CORNER /377

CONTEST CORNERSOLUTIONS

Statements of the problems in this section originally appear in 2016: 42(9), p. 373–375.

CC241. Over many centuries, tilings have fascinated mathematicians and thesociety in general. Particularly interesting are tilings of the plane that use a singletype of tile. You can tile the plane with some regular polygons (such as equilateraltriangles, squares, regular hexagons). On the other hand, you cannot tile the planeusing regular pentagons. Now, we know that some non-regular pentagons can beused to tile the plane, although not all of them are yet known. It was thereforewith great enthusiasm that in August 2015, the world welcomed the discovery ofa new pentagonal tiling, illustrated below.

Use the lengths given and angle sizes to calculate the exact area of this pentagon.

Originally Problem 4 from the Scottish Mathematical Council Mathematical Chal-lenge 2016–2017.

We received nine correct solutions and one incorrect submission. We present thesolution by Kathleen E. Lewis, slightly expanded by the editor.

We inscribe the pentagon in a rectangle APQR as shown in the diagram, with Aset at the origin. Then the area of the pentagon is the area of the rectangle minusthe area of the three corner triangles.

Copyright c© Canadian Mathematical Society, 2017

Page 6: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

378/ THE CONTEST CORNER

By definition of the pentagon, ∠CBP = 30◦. Since BC = 2, we get CP = 1,BP =

√3, and thus AP = 1 +

√3. Furthermore

∠DCQ = 180◦ − ∠BCD − ∠PCB = 60◦,

implying CQ = 12 (thus PQ = 3

2 ) and DQ =√32 . Since APQR is a rectangle we

obtain

DR = 1 +

√3

2and ER =

1

2.

The area of the pentagon is therefore

[ABCDE] = AP · PQ− 1

2(BP · CP + CQ ·DQ+DR · ER)

=3(1 +

√3)

2− 1

2

Ç√

3 +

√3

4+

2 +√

3

4

å=

5 + 3√

3

4.

CC242. The diagram below shows square PQRS with sides of length 1 unit.Triangle PQT is equilateral. Show that the area of triangle UQR is (

√3 − 1)/4

square units.

P Q

RST

U

Originally Problem 5 from the Scottish Mathematical Council Mathematical Chal-lenge 2016–2017.

We received twelve correct solutions. We present the solution of John Heuver.

Note that ∠RQT = 30◦ and ∠PUQ = 75◦ where sin 75◦ =√6+√2

4 . Using the

Law of Sines in 4PUQ we find that UQ =√

3 − 1. Letingt [UQR] denote area4UQR, we get

[UQR] =1

2· UQ ·QR · sin 30◦ =

1

2(√

3− 1) · 1 · 1

2=

1

4(√

3− 1).

Crux Mathematicorum, Vol. 43(9), November 2017

Page 7: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE CONTEST CORNER /379

CC243. Eight islands each have one or more air services. An air serviceconsists of flights to and from another island, and no two services link the samepair of islands. There are 17 air services in all between the islands. Show that itmust be possible to use these air services to fly between any pair of islands.

Originally Problem 2 from the Scottish Mathematical Council Mathematical Chal-lenge 2016–2017.

We received six correct solutions. We present the solution of Joel Schlosberg.

Select an arbitrary island I. Let A be the set of a islands it is possible to reachfrom I via the network of air services (including both those that require multipleflights and I itself). Since there is at least one air service from I to another island,a ≥ 2.

Suppose that a < 8. Then there is at least one island J /∈ A. At least one airservice connects J with another island K. If K ∈ A, there is a way to fly from I toK and then to J , contradicting the assumption that J /∈ A. Therefore J,K /∈ A,so a ≤ 6. Since 2 ≤ a ≤ 6, |a− 4| ≤ 2.

If J ∈ A, K /∈ A, then any air service connecting J and K would make it possibleto fly from I to J to K, contradicting K /∈ A. Therefore, no air service can connectan island in A to an island not in A. Since each pair of islands has at most one airservice between them, at most

(a2

)air services connect the a islands in A, and at

most(8−a2

)air services connect the 8− a islands not in A. Then the total number

of air services is at mostÇa

2

å+

Ç8− a

2

å= a2 − 8a+ 28 = 12 + (a− 4)2 ≤ 12 + 22 = 16,

contradicting the assumption that there are 17 air services. Therefore, a = 8.That is, all 8 islands are connected to I by some sequence of flights. Then for anypair of islands J,K, it is possible to fly from J to I to K.

CC244. How many distinct solutions consisting of positive integers does thissystem of equations have?

x1 + x2 + x3 = 5,

y1 + y2 + y3 = 5,

z1 + z2 + z3 = 5,

x1 + y1 + z1 = 5,

x2 + y2 + z2 = 5,

x3 + y3 + z3 = 5.

Originally Problem 3 from the Scottish Mathematical Council Mathematical Chal-lenge 2016–2017.

We received 7 submissions of which 3 were correct and complete. We present thesolution by Ivko Dimitric.

Copyright c© Canadian Mathematical Society, 2017

Page 8: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

380/ THE CONTEST CORNER

We think of a solution of this system as a set of nine numbers (assigned to thevariables) placed in nine cells of a 3 × 3 grid (a table, or a matrix) so that eachrow sum and each column sum equals 5. Clearly, since all integers are positive, nonumber greater than or equal to 4 can be considered since the other two numbersin the same row are at least one, producing a row sum of at least 6. Therefore,the numbers that can be used are 1, 2, and 3. There are only two ways (up topermutation) to represent 5 as the sum of three positive integers and they are5 = 3 + 1 + 1 = 2 + 2 + 1. The number of 3s that can be placed in the grid can beonly 0, 1, or 3. Indeed, the number of 3s used cannot be exactly two, for otherwisethe row without 3 is filled with two 2s and one 1, whereas one of the 2s would bein the same column with one of the 3s, making that column sum at least 6.

z1 z2 z3

y1 y2 y3

x1 x2 x3

If the number of 3s used is exactly three, the other six cells must be filled with1s, and, as long as 3s are placed so that no two are in the same row or the samecolumn, the other cells are filled with 1s to produce a solution to the system. Thus,in this case the number of solutions equals the number of different ways to arrangethree 3s in a 3 × 3 grid so that in any given row or column there is only one 3.That can be done in 3! = 6 ways since we can place the first 3 in the first row inany of the three cells of the first row, and when that has been done there are twochoices to place the next number 3 in the second row and after that the cell forthe last 3 in the third row is uniquely determined by the previous choices, whichis the cell not in the columns containing the first two 3s chosen.

If the number of 3s is zero (no 3 used in the grid) then the grid is filled with 2sand 1s so that of the three 1s used no two are in the same row or column. Thenumber of ways to arrange three 1s that way is the same as the number of waysto arrange three 3s previously discussed, so it equals 3! = 6 ways.

There remains the case of having exactly one 3 in the grid. In the column andthe row containing that 3 the other four entries are 1s, the remaining four cells inthe grid to be filled with 2s. That sole number 3 can be placed in any of the ninecells and when that has been done, use four 1s for the four cells in the same rowand the same column where the 3 is and four 2s for the remaining four cells of thegrid. So, the cells where 1s and 2s go are completely determined by the choice ofthe cell for the only 3. Thus there are nine ways in this case.

Altogether, the number of different ways to fill the grid with a combination of 1s,2s, and 3s so that each row and column sum is 5 equals 6 + 6 + 9 = 21, so thenumber of solutions to the system is also 21.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 9: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE CONTEST CORNER /381

CC245. A pyramid stands on horizontal ground. Its base is an equilateraltriangle with sides of length a, the other three edges of the pyramid are of lengthb and its volume is V . Show that

V =1

12a2√

3b2 − a2.

The pyramid is then placed so that a non-equilateral face lies on the ground. Findthe height of the pyramid in this position.

Originally Problem 1 from the Scottish Mathematical Council Mathematical Chal-lenge 2016–2017.

We received seven submissions, out of which six were correct and complete. Wepresent the solution by Joel Schlosberg.

The volume of a pyramid with base B is

V =1

3ABhB , (1)

where AB is the area of the base and hB the height with respect to B. First weuse (1) with the base B1 that is an equilateral triangle. Then AB1

=√

3a2/4.The apex point of the pyramid, the center of the equilateral triangle (which bysymmetry is also the foot of the altitude through the apex point), and an arbitraryvertex of the equilateral triangle form a right triangle with hypotenuse length band legs of lengths hB1 and a/

√3 (the distance between the center and any vertex

of an equilateral triangle of length a). By the Pythagorean theorem,

hB1=

…b2 − a2

3.

By (1) we obtain

V =1

3AB1

hB1=

1

3·√

3a2

4·…b2 − a2

3=

1

12a2√

3b2 − a2. (2)

Now let B2 be one of the bases with sidelengths a, b, and b. The height of thistriangle over the side with sidelength a is

√b2 − (a/2)2 and its area thus

AB2=a

2·…b2 − a2

4=

1

4a√

4b2 − a2. (3)

Using (1), (2), and (3), we obtain

1

12a2√

3b2 − a2 = V =1

3AB2

hB2=

1

12a√

4b2 − a2 · hB2,

so the height of the pyramid from a non-equilateral face is

a

 3b2 − a24b2 − a2

.

Copyright c© Canadian Mathematical Society, 2017

Page 10: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

382/ THE OLYMPIAD CORNER

THE OLYMPIAD CORNERNo. 357

Carmen Bruni

The problems featured in this section have appeared in a regional or national mathematicalOlympiad. Readers are invited to submit solutions, comments and generalizations to anyproblem. Please see submission guidelines inside the back cover or online.

To facilitate their consideration, solutions should be received by May 1, 2018.

The editor thanks Andre Ladouceur, Ottawa, ON, for translations of the problems.

OC351. Solve the system of equations

6x− y + z2 = 3,

x2 − y2 − 2z = −1,

6x2 − 3y2 − y − 2z2 = 0.

where x, y, z ∈ R.

OC352. Let O1 and O2 intersect at P and Q. Their common external tangenttouches O1 and O2 at A and B respectively. A circle Γ passing through A and B

intersects O1, O2 at D, C. Prove thatCP

CQ=DP

DQ.

OC353. Prove that for any positive integer k,

(k2)! ·k−1∏j=0

j!

(j + k)!

is an integer.

OC354. Solve the equation 1 + xz + yz = LCM(xz, yz) in the set of naturalnumbers.

OC355. LetN denote the set of natural numbers. Define a function T : N→ N

by T (2k) = k and T (2k + 1) = 2k + 2. We write T 2(n) = T (T (n)) and in generalT k(n) = T k−1(T (n)) for any k > 1.

a) Show that for each n ∈ N, there exists k such that T k(n) = 1.

b) For k ∈ N, let ck denote the number of elements in the set {n : T k(n) = 1}.Prove that ck+2 = ck+1 + ck, for k ≥ 1.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 11: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE OLYMPIAD CORNER /383

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

OC351. Resoudre le systeme d’equations

6x− y + z2 = 3

x2 − y2 − 2z = −1

6x2 − 3y2 − y − 2z2 = 0,

x, y et z etant des reels.

OC352. Soit O1 et O2 deux cercles qui se coupent en P et Q. Leur tangentecommune exterieure touche O1 et O2 aux points respectifs A et B. Un cercle Γpasse aux points A et B et coupe O1 et O2 aux points respectifs D et C. Demontrer

queCP

CQ=DP

DQ.

OC353. Demontrer que pour tout entier strictement positif k,

(k2)! ·k−1∏j=0

j!

(j + k)!

est un entier.

OC354. Resoudre l’equation 1+xz+yz = PPCM(xz, yz) dans l’ensemble desentiers strictement positifs.

OC355. On definit une fonction T : N→ N par T (2k) = k et T (2k+1) = 2k+2.On definit aussi T 2(n) = T (T (n)) et T k(n) = T k−1(T (n)) lorsque k > 1.

a) Demontrer que pour tout n (n ∈ N), il existe une valeur de k pour laquelleT k(n) = 1.

b) Pour tout k (k ∈ N), soit ck le nombre d’elements de l’ensemble{n : T k(n) = 1}. Demontrer que ck+2 = ck+1 + ck, pour tout k (k ≥ 1).

Copyright c© Canadian Mathematical Society, 2017

Page 12: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

384/ THE OLYMPIAD CORNER

OLYMPIAD SOLUTIONSStatements of the problems in this section originally appear in 2016 : 42(7), p. 297–298.

OC291. Let the integer n ≥ 2 , and x1, x2, · · · , xn be positive real numberssuch that

∑ni=1 xi = 1. Prove that(

n∑i=1

1

1− xi

)Ñ ∑1≤i<j≤n

xixj

é≤ n

2.

Originally problem 3 from day 1 of the 2015 China Western National Olympiad.

We received 9 correct submissions. We present the solution by Michel Bataille.

LetX =

∑1≤i<j≤n

xixj .

From

X = x1(x2 + · · ·+ xn) +∑

2≤i<j≤nxixj

= x1(1− x1) +∑

2≤i<j≤nxixj

we deduce

X

1− x1= x1 +

∑2≤i<j≤n xixj

x2 + · · ·+ xn= x1 +

∑2≤i<j≤n xixj

1− x1. (1)

But we have∑2≤i<j≤n

xixj =1

2

((x2 + · · ·+ xn)2 − (x22 + · · ·+ x2n)

)≤ 1

2

Å(x2 + · · ·+ xn)2 − 1

n− 1(x2 + · · ·+ xn)2

ã,

where the inequality follows from

(n− 1)(x22 + · · ·+ x2n) ≥ (x2 + · · ·+ xn)2

(by the Cauchy-Schwarz inequality).

Thus we obtain∑2≤i<j≤n

xixj ≤n− 2

2(n− 1)· (x2 + · · ·+ xn)2 =

(n− 2)(1− x1)2

2(n− 1)

Crux Mathematicorum, Vol. 43(9), November 2017

Page 13: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE OLYMPIAD CORNER /385

and from (1)X

1− x1≤ x1 +

(n− 2)(1− x1)

2(n− 1).

In the same way, with obvious changes, we get

X

1− x2≤ x2 +

(n− 2)(1− x2)

2(n− 1),

X

1− x3≤ x3 +

(n− 2)(1− x3)

2(n− 1), . . .

X

1− xn≤ xn +

(n− 2)(1− xn)

2(n− 1)

and so(n∑i=1

1

1− xi

)Ñ ∑1≤i<j≤n

xixj

é=

n∑i=1

X

1− xi

≤ (x1 + x2 + · · ·+ xn) +n− 2

2(n− 1)·n∑i=1

(1− xi)

= 1 +n− 2

2(n− 1)(n− 1) =

n

2

as required.

OC292. On the graph of a polynomial with integer coefficients, two points arechosen with integer coordinates. Prove that if the distance between them is aninteger, then the segment that connects them is parallel to the horizontal axis.

Originally problem 1 from day 1 of the 2015 Spain Mathematical Olympiad.

We received 5 correct submissions. We present the solution by Steven Chow.

Let the x-axis be the horizontal axis. Let f(x) be the polynomial function. Let aand b be the x-coordinates of the 2 points.

Since a, b, and the coefficients of f(x) are integers, a− b | f(a)− f(b).

Since the distance between the 2 points is an integer, from the Pythagorean Theo-rem, the following is a square number :

(a− b)2 + (f(a)− f(b))2 = (a− b)2Ç

1 +

Åf(a)− f(b)

a− b

ã2å.

Therefore 1 +Äf(a)−f(b)

a−b

ä2is a square number and f(a)−f(b)

a−b = 0 implies that

f(a) = f(b).

Thus, the segment that connects the 2 points is parallel to the horizontal axis.

Copyright c© Canadian Mathematical Society, 2017

Page 14: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

386/ THE OLYMPIAD CORNER

OC293. You are given N such that N ≥ 3. We call a set of N points on aplane acceptable if their abscissae are unique, and each of the points is colouredeither red or blue. Let’s say that a polynomial P (x) divides a set of acceptablepoints either if there are no red dots above the graph of P (x), and below, thereare no blue dots, or if there are no blue dots above the graph of P (x) and thereare no red dots below. Keep in mind, dots of both colors can be present on thegraph of P (x) itself. For what least value of k is an arbitrary acceptable set of Npoints divisible by a polynomial of degree k ?

Originally problem 4 of the 2015 All Russian Olympiad Grade 11.

We present the solution by Oliver Geupel. There were no other submissions.

The answer is k = N − 2.

Given any acceptable N -set, the interpolation polynomial of N − 1 out of the Npoints is a polynomial of degree not greater than N − 2 which divides that set.Hence k ≤ N − 2.

It is now sufficient to specify an acceptable N -set SN such that every polynomialthat divides SN is of degree at least N − 2. The blue points in our set SN areA−1(−1, 1), A0(0,−1), and A2k(2k, 0) where k = 1, 2, . . . , bN/2c − 1. The redpoints in SN are A2k−1(2k−1, 0) where k = 1, 2, . . . , dN/2e−1. Those are in totalbN/2c + dN/2e = N points as required. Let P (x) be a polynomial that dividesSN . If N = 3, then P (x) cannot be a constant, which shows that k ≥ 1 = N − 2.It remains to consider N ≥ 4.

We show that degP (x) > 1. Assume degP (x) ≤ 1. Since the vertices of triangleA−1A0A2 are of the same colour (blue), the graph of P (x) cannot contain anyinterior point of the triangle. Thus, P (x) cannot separate the interior red pointA1 from the blue vertices, which is a contradiction. Consequently, degP (x) ≥ 2.

We have two cases : Either there are no red dots above the graph of P (x) and noblue dots below, or there are no blue dots above the graph of P (x) and no reddots below.

Let us first suppose that there are no red dots above the graph of P (x) andno blue dots below. We then have P (0) ≤ P (1), P (1) ≥ P (2), P (2) ≤ P (3),continued with alternating order relations until either P (N − 3) ≤ P (N − 2) orP (N − 3) ≥ P (N − 2). By the Mean Value Theorem, there are real numbersx1 ∈ (0, 1), x2 ∈ (1, 2), . . ., xN−2 ∈ (N − 3, N − 2) such that P ′(x1), P ′(x2), . . . ,P ′(xN−2) have alternating signs. Hence, degP (x) ≥ N − 2.

It remains to consider the case where there are no blue dots above the graph ofP (x) and no red dots below that graph. We then readily see that P (−1) ≥ P (1),P (1) ≤ P (2), P (2) ≥ P (3), continued with alternating order relations until eitherP (N−3) ≤ P (N−2) or P (N−3) ≥ P (N−2). By the Mean Value Theorem, thereare real numbers x1 ∈ (−1, 1), x2 ∈ (1, 2), . . ., xN−2 ∈ (N − 3, N − 2) such thatP ′(x1), P (x2), . . . , P ′(xN−2) have alternating signs. Hence, degP (x) ≥ N − 2.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 15: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

THE OLYMPIAD CORNER /387

OC294. In given triangle 4ABC, difference between sizes of each pair of sidesis at least d > 0. Let G and I be the centroid and incenter of 4ABC and r be itsinradius. Show that

|AIG|+ |BIG|+ |CIG| ≥ 2

3dr,

where |XY Z| is the area of triangle 4XY Z.

Originally problem 5 from Round 3 Category A of the 2015 Czech and SlovakNational Olympiad.

We received 2 correct submissions. We present the solution by Mohammed Aassila.

We use barycentric coordinates in triangle ABC. We know that G = (1 : 1 : 1)and I = (a : b : c) where a = BC, b = CA and c = AB. We have :

[AIG] =[ABC]

3(a+ b+ c)·

∣∣∣∣∣∣1 0 0a b c1 1 1

∣∣∣∣∣∣ =[ABC] · |b− c|

3(a+ b+ c).

Similar equations for [BIG] and [CIG] can be obtained in the same manner.Hence :

[AIG] + [BIG] + [CIG] =[ABC] · (|b− c|+ |c− a|+ |a− b|)

3(a+ b+ c)

=r · (|b− c|+ |c− a|+ |a− b|)

6.

Assume without loss of generality that a ≤ b ≤ c. Since b − a ≥ d and c − b ≥ dwe have that c− a ≥ 2d. Thus

r · (|b− c|+ |c− a|+ |a− b|)6

≥ 2

3· dr.

OC295. Let N = {1, 2, 3, ...} be the set of positive integers. Let f : N→ N bea function that gives a positive integer value, to every positive integer. Supposethat f satisfies the following conditions :

f(1) = 1, f(a+ b+ ab) = a+ b+ f(ab).

Find the value of f(2015).

Originally problem 3 from day 1 of the 2015 Mexico National Olympiad.

We received 9 correct submissions. We present the solution by Missouri State Uni-versity Problem Solving Group.

We will show that f(n) = n for every n ∈ N. Let S = {n ∈ N : f(n) = n}. Firstwe note that for any a, b ∈ N, we have that

ab ∈ S ⇐⇒ a+ b+ ab ∈ S

Copyright c© Canadian Mathematical Society, 2017

Page 16: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

388/ THE OLYMPIAD CORNER

Since 2n+ 1 = 1 + n+ 1 · n, then for any n ∈ N, we have

n ∈ S ⇐⇒ 2n+ 1 ∈ S

By repeating this argument, we can then extend this to

n ∈ S ⇐⇒ 2n+ 1 ∈ S ⇐⇒ 4n+ 3 ∈ S ⇐⇒ 8n+ 7 ∈ S

and so on. In particular, 1 ∈ S if and only if 8(1) + 7 = 15 ∈ S and 2 ∈ S if andonly if 8(2) + 7 = 23 ∈ S. But, by the first displayed equation above, 15 ∈ S if andonly if 5 + 3 + 5(3) = 23 ∈ S and so combining gives 1 ∈ S if and only if 2 ∈ S.In a similar manner, combining the third displayed equation above with the factthat 4n+ 3 = 3 + n+ 3n gives that

n ∈ S ⇐⇒ 3n ∈ S.

So when n = 1, we see that 1 ∈ S ⇐⇒ 3 ∈ S. In particular, since f(1) = 1, we seethat 1 ∈ S and hence so are both 2 and 3. Now, we prove that n ∈ S for all n ∈ Nby strong induction. The base cases have already been proven so we suppose thatn ∈ S for all 1 ≤ n ≤ k for some k ∈ N with k ≥ 3. We will show that k + 1 ∈ S.

If k + 1 ≡ 0 mod 3, then k + 1 = 3n for some n ≤ k and by assumption, n ∈ Sand thus, from above, we have that 3n ∈ S.

If k+ 1 ≡ 1 mod 3, then 2k+ 3 = 2(k+ 1) + 1 ≡ 0 mod 3. Then 2k+ 3 = 3n forsome integer n. Since k ≥ 3, we see that n ≤ k and so as before, 2k+3 ∈ S. Finally,since 2(k + 1) + 1 ∈ S, the second displayed equation gives us that k + 1 ∈ S.

If k + 1 ≡ 2 mod 3, then k + 2 = 2n for some n ∈ N with n ≥ 2 since k ≥ 3.Now, since 2(n − 1) ≤ 3(n − 1) = k − 1 ≤ k, we know that 2(n − 1) ∈ S and so2 + (n− 1) + 2(n− 1) = 3n− 1 = k + 1 ∈ S.

Thus, by strong induction, we see that S = N. In particular, f(2015) = 2015.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 17: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

MICHEL BATAILLE /389

FOCUS ON...No. 28

Michel BatailleSome relations in the triangle (II)

Introduction

In this number, we continue our selection of relations in the triangle, focusingon formulas involving lengths related to the classical cevians. As in part I, thenotations are standard and borrowed from [2].

About the altitudes ha, hb, hc

Besides the easy1

ha+

1

hb+

1

hc=

1

r

(which readily follows from 1ha

= a2F = a

2rs and similar relations), we consider aless known, easy-to-remember formula :

(ha + hb + hc)

Å1

ha+

1

hb+

1

hc

ã= (a+ b+ c)

Å1

a+

1

b+

1

c

ã(1)

(again an obvious consequence of 2F = aha = bhb = chc).

With the help of the identities

(x+y+z)(xy+yz+zx)−3xyz =∑cyclic

x2(y+z) = (x+y)(y+z)(z+x)−2xyz, (2)

we may equivalently write (1) as

(ha + hb)(hb + hc)(hc + ha)

hahbhc=

(a+ b)(b+ c)(c+ a)

abc(3)

and give a solution to problem 3453 [2009 : 325,328 ; 2010 : 342] that asked forthe inequality

8

(∑cyclic

h2a(hb + hc)

)+ 16hahbhc ≤ 3

√3

(∑cyclic

a2(b+ c)

)+ 6√

3abc.

Indeed, a consequence of (2) is that this inequality is equivalent to Q ≤ 3√3

8 where

Q =(ha + hb)(hb + hc)(hc + ha)

(a+ b)(b+ c)(c+ a).

But from (3) we have

Q =hahbhcabc

=8F 3

(abc)2=

abc

8R3= sinA sinB sinC,

Copyright c© Canadian Mathematical Society, 2017

Page 18: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

390/ FOCUS ON... SOME RELATIONS IN THE TRIANGLE (II)

hence, using AM-GM and the concavity of the Sine function on (0, π),

Q ≤Å

sinA+ sinB + sinC

3

ã3≤Å

sin

ÅA+B + C

3

ãã3=

3√

3

8.

About the distances IA, IB, IC

Prompted by the intervention of IA in part I, we now present a couple of interestingrelations connecting the distances IA, IB, IC to other elements of the triangle.

First we consider the product IA · IB · IC and show that

sIA · IB · IC = r · abc. (4)

The proof is easy :

IA · IB · IC =r

sin A2

· r

sin B2

· r

sin C2

=r3

r4R

= 4Rr2 =r

s· abc.

At this point, it is worth mentioning a beautiful formula that also involves theexcenters Ia, Ib, Ic :

IA · IB · IC · IaA · IbB · IcC = (abc)2. (5)

To see this, we first remark that

bc cos2A

2=bc(1 + cosA)

2=bc

2

Å1 +

b2 + c2 − a2

2bc

ã= s(s− a), (6)

from which we deduce that

IA · IaA =s− acos A2

· s

cos A2= bc.

Similarly, IB · IbB = ca, IC · IcC = ab and (5) follows.

Relation (5) reminds us of the known relation wawbwcWaWbWc = (abc)2 whereWa,Wb,Wc denote the lengths of the angle bisectors extended until they are chordsof the circumcircle (see problem 168 [1976 : 136 ; 1977 : 233]). It is interesting tonotice that we even have waWa = bc = IA · IaA and similar relations.

We conclude this paragraph with the formula

aIA2 + bIB2 + cIC2 = abc, (7)

from which we will derive a general inequality.

Using (6), we obtain

aIA2 + bIB2 + cIC2 = a

Çs− acos A2

å2

+ b

Çs− bcos B2

å2

+ c

Çs− ccos C2

å2

= a(s− a)2bc

s(s− a)+ b(s− b)2 ca

s(s− b)+ c(s− c)2 ab

s(s− c)

=abc

s(s− a+ s− b+ s− c)

Crux Mathematicorum, Vol. 43(9), November 2017

Page 19: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

MICHEL BATAILLE /391

and (7) follows.

A nice application is the inequality

aIA · PA+ bIB · PB + cIC · PC ≥ abc

that holds for any point P in the plane of the triangle ABC. To prove it, we usethe dot product and the Cauchy-Schwarz inequality as follows :

aPA · IA+ bPB · IB + cPC · IC

= ‖a−→IA‖‖

−→IA−

−→IP‖+ ‖b

−→IB‖‖

−→IB −

−→IP‖+ ‖c

−→IC‖‖

−→IC −

−→IP‖

≥ a−→IA · (

−→IA−

−→IP ) + b

−→IB · (

−→IB −

−→IP ) + c

−→IC · (

−→IC −

−→IP )

= aIA2 + bIB2 + cIC2 −−→IP · (a

−→IA+ b

−→IB + c

−→IC)

= abc

(since a−→IA+ b

−→IB + c

−→IC =

−→0 ).

About the exradii ra, rb, rc

Faced with the proof of a relation between the exradii ra, rb, rc, the first move isoften to use the equalities

F = ra(s− a) = rb(s− b) = rc(s− c). (8)

For examples, the striking formulas

1

r=

1

ra+

1

rb+

1

rc, rarb + rbrc + rcra = s2 =

rarbrcr

and …rrbrcra

+

…rrcrarb

+

…rrarbrc

= s

are straightforwardly deduced from (8) and F = rs =√s(s− a)(s− b)(s− c).

With the additional known formulas

ab+ bc+ ca = s2 + r2 + 4rR and a2 + b2 + c2 = 2s2 − 2r2 − 8rR,

we easily obtain

ra + rb + rc = r + 4R and r2 + r2a + r2b + r2c + a2 + b2 + c2 = 16R2

that were at work in problem 3570 [2010 : 397,399 ; 2011 : 402].

Since 2F = aha = bhb = chc, one can expect some connections with ha, hb, hc. Agood example is

hb + hcra

+hb + hcra

+hb + hcra

= 6 (9)

Copyright c© Canadian Mathematical Society, 2017

Page 20: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

392/ FOCUS ON... SOME RELATIONS IN THE TRIANGLE (II)

which is mentioned but not proved in [1]. Here is a quick proof. Since

hb + hc = 2F

Å1

b+

1

c

ã=

2F (ab+ ac)

abc,

the left-hand side of (9) rewrites as

2

abc((ab+ ac)(s− a) + (bc+ ba)(s− b) + (ca+ cb)(s− c)) =

2

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

and (9) follows.

The reader will find other formulas of the same kind in exercise 1.

A mixed formula

A long time ago, I came across the following impressive formula in an old copy ofthe 1886 Journal of mathematiques elementaires Vuibert,

w2a

ha· m2a − h2a

w2a − h2a

= 2R. (10)

(Of course, a similar result holds if the subscript a is replaced by b or c.). Thisformula was given with a typo (r instead of R) and without proof !

A possible proof is as follows. With the help of the known formulas

w2a =

bc(a+ b+ c)(b+ c− a)

(b+ c)2, ha =

2F

a=

bc

2R, 4m2

a = 2b2 + 2c2 − a2

and

16F 2 = 2(a2b2+b2c2+c2a2)−(a4+b4+c4) = (a+b+c)(b+c−a)(c+a−b)(a+b−c),

we first obtain

w4a(4m2

a − 4h2a) =b2c2

(b+ c)4(a+ b+ c)2(b+ c− a)2

Å2b2 + 2c2 − a2 − 16F 2

a2

ã=

b2c2(b− c)2(a+ b+ c)2(b+ c− a)2

a2(b+ c)2

and, second,

16R2h2a(w2a − h2a)

= 4b2c2Åbc(a+ b+ c)(b+ c− a)

(b+ c)2− 16F 2

4a2

ã=b2c2(a+ b+ c)(b+ c− a)

a2(b+ c)2(4a2bc− (b+ c)2(c+ a− b)(a+ b− c)).

Then (10) follows from 4a2bc−(b+c)2(c+a−b)(a+b−c) = (b−c)2(a+b+c)(b+c−a)(as it is readily checked). (Variants of proofs can be found in [3].)

Crux Mathematicorum, Vol. 43(9), November 2017

Page 21: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

MICHEL BATAILLE /393

A new youth was recently granted to this relation through several problems com-posed by Panagiote Ligouras. A typical example is problem 1847 posed in Mathe-matics Magazine in June 2010. Here is the slightly arranged statement :

Prove that in a scalene triangle the following inequality holds

w4a(m2

a − h2a)

h3ara(w2a − h2a)

+w4b (m

2b − h2b)

h3brb(w2b − h2b)

+w4c (m

2c − h2c)

h3crc(w2c − h2c)

>16

3.

Formula (10) allows a quick proof by immediately transforming the required in-equality into

a

ra+

b

rb+

c

rc>

4r(a+ b+ c)

3R2. (11)

From exercise 1 below, we deduce

a

ra+

b

rb+

c

rc=

4(4R+ r)

a+ b+ c

so that (11) is equivalent to 3R2(4R + r) > r(a + b + c)2. The proof is easilycompleted by recalling that R > 2r and a+ b+ c < 3

√3R.

Exercises

1. Prove the formulas Åa

ra+

b

rb+

c

rc

ãÅa+ b+ c

ra + rb + rc

ã= 4

and1

rrbrc+

1

rrcra+

1

rrarb=

8

hahbhc+

1

rarbrc.

2. (from College Math. Journal Problem 937) Prove that in a scalene triangle, thefollowing inequality holds

w4a(m2

a − h2a)

h2a(wa − ha)√wa · ha

+w4b (m

2b − h2b)

h2b(wb − hb)√wb · hb

+w4c (m

2c − h2c)

h2c(wc − hc)√wc · hc

≥ 24R2.

References

[1] T. Lalesco, La geometrie du triangle, J. Gabay, 2003, p. 101-120

[2] O. Bottema et al., Geometric Inequalities, Wolters-Noordhoff, 1968, p. 9-10

[3] Solution to J136, Mathematical Reflections, 5, (2009), p. 10

Copyright c© Canadian Mathematical Society, 2017

Page 22: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

394/ QUADRATIC ALLEMANDS

Quadratic AllemandsTed Barbeau

1 Sequences with complimentary properties

The sequence of natural numbers, xn = n, has two complementary familiar pro-perties :

xn+1 + xn−1 = 2xn, and xn−1xn+1 = x2n − 1.

These two facts can be wrapped up in the fact that, for each n, xn−1 and xn+1

are the solutions of the quadratic equation

h(x, xn) = 0,

whereh(x, y) = x2 − 2xy + (y2 − 1).

In particular, note that this bivariate polynomial is quadratic and symmetric. Oneconsequence of this is that, for each n, h(xn−1, xn) = h(xn, xn+1) so that all thepoints (xn, xn+1) lie on the curve h(x, y) = 0 in the plane.

The sequence of natural numbers is not the only sequence that exhibits thesecomplementary properties involving the sum and product of the terms adjacent toa given term. As an exercise, discover analogous equations for each of the sequences

{0, 1, 3, 8, 21, 55, 144, . . .}

and{1, 2, 5, 13, 34, 89, 233, . . .}

formed by taking alternate terms of the Fibonacci sequence. For each of them,determine a symmetric quadratic polynomial h(x, y) such that xn−1 and xn+1 arethe solutions of the polynomial equation h(x, xn) = 0. Identify the curves thatcontain the two sets of points

(0, 1), (1, 3), (3, 8), (8, 21), (21, 55), (55, 144), . . .

and(1, 2), (2, 5), (5, 13), (13, 34), (34, 89), (89, 233), . . . .

2 Quadratic allemands

We are led to generalize the situation as follows. Start with the general symmetricquadratic polynomial

h(x, y) = α(x2 + y2) + βxy + γ(x+ y) + δ.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 23: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

TED BARBEAU /395

Since our interest will be in the solutions of the equation h(x, y) = 0, we willassume that α = 1. We define a quadratic allemand as a bilateral sequence

{xn : n = 0,±1,±2,±3, . . .}

for which a seed x0 is given. x−1 and x1 are defined to be the two solutions of thequadratic equation h(x, x0) = 0.

We can define the remaining terms recursively going in both directions from x0.Suppose that we have determined x0, x1, . . . , xm for m > 0, so that

0 = h(xm, xm−1) = h(xm−1, xm).

Then xm−1 is one solution of h(x, xm) = 0 and we define xm+1 to be the secondsolution of this equation. A similar definition can be used for negative indices.

Write

h(x, y) = x2 + y2 + βxy + γ(x+ y) + δ = x2 + (βy + γ)x+ (y2 + γy + δ).

Any allemand corresponding to this function must satisfy both of the recursions

xn+1 + xn−1 = −(βxn + γ) (1)

xn+1xn−1 = x2n + γxn + δ (2)

However, it turns out that any sequence that satisfies either of the recursions (1)and (2) are allemands. If (1) is satisfied, then it is straightforward to show, foreach n, that

xn+1xn−1 − x2n − γxn = xnxn−2 − x2n−1 − γxn−1so that xn+1xn−1 − x2n − γxn−1 is an invariant for any recursion satisfying (1)alone. If we let δ be the value of this invariant, then we have (2) holding as well,so that any sequence (1) turns out to be an allemand.

With a little more trouble, it can be shown that, if (2) holds, then

xn+1 + xn−1 + γ =xnxn−1

(xn + xn−2 + γ)

so that x−1n (xn+1 + xn−1 + γ) is an invariant −β and

xn+1 + βxn + xn−1 + γ = 0.

Thus, any sequence defined by (2) alone is in fact an allemand.

We note the relations :

h(y,−(βy + x+ γ)) = h(x, y)

and

h

Åy,y2 + γy + δ

x

ã=y2 + γy + δ

x2h(x, y)

with the result that h(x, y) is an invariant for two consecutive terms of sequence(1) and h(x, y)/xy is an invariant for two consecutive terms of (2).

Copyright c© Canadian Mathematical Society, 2017

Page 24: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

396/ QUADRATIC ALLEMANDS

3 Special cases

There are a number of special cases worth investigating. In each case, determinethe recursions (1) and (2), when there is an allemand consisting completely ofreal terms, when the sequence is periodic, and the curve that contains all points(xn, xn+1).

(1) β = −2.

(2) β = 0.

(3) β = 2. Consider the cases that γ2 − δ is positive, negative and zero.

(4) (β, γ, δ) = (2,−3, 2).

(5) γ = δ = 0.

(6) γ = 0, δ = −1.

4 Application

One application of this theory is determining when a sequence that satisfies arecursion relation (2) has all integer entries. Consider for example the sequencedefined by

x0 = 1, x1 = −1, and xn+1 = (x2n − xn + 1)/xn−1

for n ≥ 1. The first few terms of this sequence are

1,−1, 3,−7, 19,−49, 129,−337, 883,−2311.

Show that this is the positive part of a quadratic allemand with seed 1 and thusprove that each of its entries is an integer.

5 Cubic and quartic allemands

We can also talk about cubic and quartic allemands, where the function h(x, y) issymmetric and respectively cubic and quartic while being quadratic in each of itsvariables. In the cubic case, we have

h(x, y) = x2y + xy2 + α(x2 + y2) + βxy + γ(x+ y) + δ

= (y + α)x2 + (y2 + βy + γ)x+ (αy2 + γy + δ).

and, in the quartic case,

h(x, y) = x2y2 + αxy(x+ y) + β(x2 + y2) + γxy + δ(x+ y) + ε

= (y2 + αy + β)x2 + (αy2 + γy + δ)x+ (βy2 + δy + ε).

Crux Mathematicorum, Vol. 43(9), November 2017

Page 25: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

TED BARBEAU /397

As for quadratic allemands, the allemands produced by these functions have arelated pair of recursion relations corresponding to (1) and (2). But this is a storyfor another day.

6 Appendix

We provide some brief notes on the questions of the foregoing sections. The se-quence {0, 1, 3, 8, 21, . . .} corresponds to the quadratic h(x, y) = x2− 3xy+ y2− 1and the sequence {1, 2, 5, 13, 34, . . .} corresponds to h(x, y) = x2 − 3xy + y2 + 1.

Here are the computations in full relating (1) and (2) in Section 2.

xn+1xn−1 − x2n − γxn = −xn−1(βxn + γ + xn−1)− x2n − γxn= −xn(βxn−1 + xn + γ)− γxn−1 − x2n−1= xnxn−2 − x2n−1 − γxn−1;

xn+1 + xn−1 + γ =x2n + γxn + δ

xn−1+ xn−1 + γ

=1

xn−1(x2n + γxn + δ + x2n−1 + γxn−1)

=xnxn−1

Çxn + γ +

x2n−1 + γxn−1 + δ

xn

å=

xnxn−1

(xn + xn−2 + γ).

For some special cases in Section 3, we have the following :

(1) The allemand is an arithmetic progression with common difference d given byd2 = −δ.

(2) The allemand has period 4 and the points (xn, xn+1) lie on a circle with centre

(− 12 ,−

12 ) and radius

»12γ

2 − δ.

(5) This is a geometric progression with common ratio r satisfying r2 + βr + 1.

In Section 4, the sequence satisfies the recursion

xn+1 + xn−1 = −3xn + 1

and the allemand is produced by

h(x, y) = x2 + y2 + 3xy − (x+ y) + 1.

Copyright c© Canadian Mathematical Society, 2017

Page 26: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

398/ PROBLEMS

PROBLEMSReaders are invited to submit solutions, comments and generalizations to any problem inthis section. Moreover, readers are encouraged to submit problem proposals. Please seesubmission guidelines inside the back cover or online.

To facilitate their consideration, solutions should be received by May 1, 2018.

The editor thanks Andre Ladouceur, Ottawa, ON, for translations of the problems.

An asterisk (?) after a number indicates that a problem was proposed without a solution.

4281?. Proposed by Sefket Arslanagic.

Prove or disprove the following inequalities :

a2

b+b2

c+c2

a≥»

3(a2 + b2 + c2), (a, b, c > 0), (1)

a21a2

+a22a3

+ · · ·+ a2na1≥»n(a21 + a22 + · · ·+ a2n), (ai > 0, n ≥ 3). (2)

4282. Proposed by Michel Bataille.

Find limn→∞

un where the sequence (un)n≥0 is defined by u0 = 1 and the recursion

un+1 =1

2

Åun +

…u2n +

un4n

ãfor every nonnegative integer n.

4283. Proposed by Margarita Maksakova.

We are given a convex polygon, whose vertices are coloured with three coloursso that adjacent vertices get different colours. If all three colours are used inthe colouring, prove that you can divide this polygon into triangles using non-intersecting diagonals in such a way that all the resulting triangles have verticesof all three different colours.

4284. Proposed by Daniel Sitaru.

Prove that if a, b and c are real numbers greater than 3 and

loga 2 + logb 2 + logc 2 = loga1

b+ logb

1

c+ logc

1

a,

then

loga−1(a2 + b2) + logb−1(b2 + c2) + logc−1(c2 + a2) > 3.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 27: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

PROBLEMS /399

4285. Proposed by Shafiqur Rahman and Leonard Giugiuc.

Find the following limit :

limn→∞

Ån√n!− n

e− lnn

2e

ã.

4286. Proposed by Marian Cucoanes and Marius Dragan.

Let x, y and z be positive real numbers such that xyz = 1. Prove that

(x7 + y7 + z7)2 ≥ 3(x9 + y9 + z9).

4287. Proposed by Van Khea and Leonard Giugiuc.

Let ABC be a triangle inscribed in a circle O and let K be a point inside ABC.Suppose that AK,BK and CK cut the circle O in points D,E and F , respectively.

Prove thatBD · CEBC ·DE

+CE ·AFCA · EF

+AF ·BDAB · FD

= 1.

4288. Proposed by Hung Nguyen Viet.

A sequence {an} is defined as follows :

a1 = 1, a2 = 2, an+2 =a2n+1 + 1

an

for every n ≥ 1. Let bn = anan+1, n = 1, 2, . . . Prove that for every positive integern, the number 5b2n − 6bn + 1 is a perfect square.

Copyright c© Canadian Mathematical Society, 2017

Page 28: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

400/ PROBLEMS

4289. Proposed by George Apostolopoulos.

Prove that in any triangle ABC, we have

3

…raha

+ 3

…rbhb

+ 3

…rchc≤ 3R

2r,

where ra, rb, rc are lengths of the exradii, ha, hb, hc are the lengths of the altitudesand R and r are circumradius and inradius, respectively, of the triangle ABC.

4290. Proposed by Dao Thanh Oai and Leonard Giugiuc.

Let A1A2A3A4A5 be a cyclic convex pentagon and let B1B2B3B4B5 be a regularpentagon, both inscribed in the same circle. Prove that∑

1≤i<j≤5AiAj ≤

∑1≤i<j≤5

BiBj .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

4281?. Propose par Sefket Arslanagic.

Demontrer ou infirmer les inegalites suivantes :

a2

b+b2

c+c2

a≥»

3(a2 + b2 + c2), (a, b, c > 0), (1)

a21a2

+a22a3

+ · · ·+ a2na1≥»n(a21 + a22 + · · ·+ a2n), (ai > 0, n ≥ 3). (2)

4282. Propose par Michel Bataille.

Determiner limn→∞

un, la suite (un)n≥0 etant definie par u0 = 1 et

un+1 =1

2

Åun +

…u2n +

un4n

ã,

pour tous entiers non negatifs n.

4283. Propose par Margarita Maksakova.

On considere un polygone dont chaque sommet est colorie d’une de trois couleurs,de maniere que les sommets adjacents soient de couleurs differentes. Si les troiscouleurs ont ete utilisees, demontrer qu’il est possible de diviser le polygone entriangles a l’aide de diagonales qui ne se coupent pas, de maniere que chaquetriangle ait des sommets de trois couleurs differentes.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 29: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

PROBLEMS /401

4284. Propose par Daniel Sitaru.

Soit a, b et c des reels superieurs a 3 tels que

loga 2 + logb 2 + logc 2 = loga1

b+ logb

1

c+ logc

1

a.

Demontrer que

loga−1(a2 + b2) + logb−1(b2 + c2) + logc−1(c2 + a2) > 3.

4285. Propose par Shafiqur Rahman et Leonard Giugiuc.

Determiner la limite suivante :

limn→∞

Ån√n!− n

e− lnn

2e

ã.

4286. Propose par Marian Cucoanes et Marius Dragan.

Soit x, y et z des reels positifs tels que xyz = 1. Demontrer que

(x7 + y7 + z7)2 ≥ 3(x9 + y9 + z9).

4287. Propose par Van Khea et Leonard Giugiuc.

Soit ABC un triangle inscrit dans un cercle et K un point a l’interieur de ABC.Les demi-droites AK,BK,CK coupent le cercle aux points respectifs D,E et F .

Demontrer queBD · CEBC ·DE

+CE ·AFCA · EF

+AF ·BDAB · FD

= 1.

Copyright c© Canadian Mathematical Society, 2017

Page 30: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

402/ PROBLEMS

4288. Propose par Hung Nguyen Viet.

Une suite {an} est definie comme suit :

a1 = 1, a2 = 2, an+2 =a2n+1 + 1

an

pour tous n (n ≥ 1). Soit bn = anan+1, pour n = 1, 2, . . . Demontrer que pourtout entier strictement positif n, le nombre 5b2n − 6bn + 1 est un carre parfait.

4289. Propose par George Apostolopoulos.

Demontrer que pour tout triangle ABC, on a

3

…raha

+ 3

…rbhb

+ 3

…rchc≤ 3R

2r,

ha, hb et hc etant les hauteurs du triangle, R etant le rayon du cercle circonscritau triangle, r etant le rayon du cercle inscrit dans le triangle et ra, rb et rc etantles rayons des cercles exinscrits.

4290. Propose par Dao Thanh Oai et Leonard Giugiuc.

Soit A1A2A3A4A5 un pentagone convexe inscriptible et B1B2B3B4B5 un penta-gone regulier, tous deux inscrits dans un meme cercle. Demontrer que∑

1≤i<j≤5AiAj ≤

∑1≤i<j≤5

BiBj .

Crux Mathematicorum, Vol. 43(9), November 2017

Page 31: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

SOLUTIONS /403

SOLUTIONSNo problem is ever permanently closed. The editor is always pleased to consider forpublication new solutions or new insights on past problems.

Statements of the problems in this section originally appear in 2016: 42(9), p. 400–404.

4181. Proposed by Marius Stanean.

Let D ∈ BC be the foot of the A-symmedian of triangle ABC with centroid G(where the A-symmedian is the reflection of the median at A in the bisector ofangle A). The circle passing through A, D and tangent to the line parallel toBC passing through A intersects sides AB and AC at F and E, respectively. If3AD2 = AB2 +AC2, prove that G lies on EF .

We received 6 solutions, all of which were correct; we feature the similar solutionsby Peter Woo and the proposer, combined and expanded upon by the editor.

It turns out that properties of the symmedian are irrelevant to the problem — weshall prove a stronger result, namely:

Given a triangle ABC with centroid G, let D be a point of the line BC, and defineE and F to be the points where the circle through A and D that is tangent to theline parallel to BC passing through A intersects sides AC and AB. Then G lieson EF if and only if the length of AD satisfies 3AD2 = AB2 +AC2.

Denote by J inversion in the circle with center A and radius AD. Because thegiven circle AEF is defined to be symmetric about the line through A that is

Copyright c© Canadian Mathematical Society, 2017

Page 32: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

404/ SOLUTIONS

perpendicular to BC, while D ∈ BC is fixed by the inversion, J must interchangethe line BC with the circle AEF . Specifically, C and E are interchanged bythe inversion as are B and F . Consequently, J interchanges the line EF with thecircumcircle of ∆ABC, call it γ. Denoting by M the midpoint of BC and by N thepoint where the extension AM of the median intersects γ, we have, in particular,the image N ′ of N under J always lies on EF . Consequently, we are required toprove that N ′ coincides with the centroid G if and only if 3AD2 = AB2 + AC2.To that end we introduce the standard notation a, b, c for the lengths of sidesBC,AC,AB, and m = AM for the length of the median. As a consequence ofStewart’s theorem we have

4m2 = 2b2 + 2c2 − a2.

Moreover, the chords of γ that intersect at M yield AM ·MN = BM ·MC = a2

4 ,or

MN =a2

4m.

Thus,

AN = m+MN =4m2 + a2

4m=b2 + c2

2m.

Because the circle of inversion has radius AD, the inverse N ′ of N satisfies AN ′ =AD2

AN = 2mAD2

b2+c2 . But the centroid of the given triangle is the point between A and

N that satisfies AG = 23m. Thus N ′ = G if and only if 2

3m = 2mAD2

b2+c2 , whichimmediately reduces to the required equation.

Editor’s comments. The other four solvers began with coordinates for the footof the symmedian, and thereby failed to discover the more general result. Theircomputations suggest that there might exist a one-parameter family of trianglesABC with a given side BC for which D is the foot of the symmedian and G ∈ EF ;this conjecture is supported (but, of course, not proved) by computer graphics. Byanalyzing isosceles triangles it is easily seen that there exist triangles for whichG ∈ EF even though AD is not the symmedian (which for isosceles trianglescoincides with the perpendicular bisector of BC). Indeed, we have seen that so

long as»

b2+c2

3 exceeds the altitude, there will be two positions of D on BC forwhich G ∈ EF .

4182. Proposed by Michel Bataille.

Let Fm be the mth Fibonacci number (defined by F0 = 0, F1 = 1, Fm+2 = Fm+1 +Fm for all integers m ≥ 0) and let n be a positive integer. For k = 1, 2, . . . , n, let

Uk =k

Fn+1−kFn+3−k+ (−1)k+1 2Fk

Fk+2.

Prove that |U1 + U2 + · · ·+ Un − n| is the quotient of two Fibonacci numbers.

We received 6 solutions, all of which were correct. We present the solution by theproposer.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 33: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

SOLUTIONS /405

For positive integer n, let Sn = U1 + U2 + · · · + Un. Since we will use inductionon n and Uk is dependent on n as well as k, we express Sn in a form that makesits dependence on n more amenable to managing the induction step. Note that

S1 = 1/F1F3 + 2F1/F3 = 3/2 = 1 + F1/F3,

and, for n ≥ 2,

Sn =n∑k=1

k

Fn+1−kFn+3−k+

n∑k=1

(−1)k+1 2FkFk+2

=n∑k=1

n+ 1− kFkFk+2

+n∑k=1

(−1)k+1 2FkFk+2

=n∑k=1

1

FkFk+2+n−1∑k=1

n− kFkFk+2

+n∑k=1

(−1)k+1 2FkFk+2

= Sn−1 +n∑k=1

1

FkFk+2+ (−1)n+1 2Fn

Fn+2.

Since

n∑k=1

1

FkFk+2=

n∑k=1

Fk+2 − FkFkFk+1Fk+2

=n∑k=1

Å1

FkFk+1− 1

Fk+1Fk+2

ã= 1− 1

Fn+1Fn+2,

Sn = Sn−1 + 1− 1

Fn+1Fn+2+ (−1)n+1 2Fn

Fn+2.

We prove that

Sn − n = (−1)n+1 FnFn+2

for n ≥ 1. This holds for n = 1. Suppose it holds for n = m− 1. Then

Sm −m = Sm−1 − (m− 1)− 1

Fm+1Fm+2+ (−1)m+1 2Fm

Fm+2

= (−1)mFm−1Fm+1

− 1

Fm+1Fm+2+ (−1)m+1 2Fm

Fm+2

=(−1)m+1[FmFm+1 + (FmFm+1 − Fm−1Fm+2)]− 1

Fm+1Fm+2

=(−1)m+1[FmFm+1 + (−1)m+1]− 1

Fm+1Fm+2= (−1)m+1 Fm

Fm+2,

as desired.

Therefore, |Sn − n| is equal to Fn/Fn+2, the quotient of two Fibonacci numbers.

Copyright c© Canadian Mathematical Society, 2017

Page 34: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

406/ SOLUTIONS

Editor’s comments. Joel Schlosberg gave a direct argument, by obtaining a doublesum:

n∑j=1

n+ 1− jFjFj+2

=n∑k=1

k∑j=1

1

FjFj+2=

n∑k=1

Å1

F1F2− 1

Fk+1Fk+2

ã= n−

n∑k=1

1

Fk+1Fk+2.

Then U1 + · · ·+ Un − n can be evaluated similarly to the foregoing solution.

4183. Proposed by Lorian Saceanu and Leonard Giugiuc.

Let ABC be a non obtuse triangle with orthocenter H and circumradius R. Provethat

(3√

3− 4) ·AH ·BH · CH ≥ abc− 4R3

and determine when the equality holds.

We received 3 correct solutions and one incorrect solution. We present the solutionby Leonard Giugiuc, submitted independently.

This proof is based on Blundon’s theorem, which states that in any triangle,

s ≤ 2R+ (3√

3− 4)r,

where the notations are as customary. Equality holds if and only if the triangle isequilateral. For a reference, seehttps://www.emis.de/journals/JIPAM/images/220_08_JIPAM/220_08.pdf.

Since triangle ABC is non obtuse, we have

AH = 2R cosA, BH = 2R cosB, CH = 2R cosC.

Also, by the law of sines,

a = 2R sinA, b = 2R sinB, c = 2R sinC.

The required inequality is thus equivalent to

2(√

3− 4 cosA cosB cosC ≥ 2 sinA sinB sinC − 1.

Case 1. Triangle ABC is right-angled. Without loss of generality, A = π2 . The

required inequality is equivalent to

1 ≥ 2 sinA sinB sinC,

implying that 1 ≥ sin 2B, which is true.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 35: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

SOLUTIONS /407

Case 2. Triangle ABC is acute-angled. Let DEF be the orthic triangle of ABC;that is, D, E, and F are the endpoints of the altitudes of ABC. Standard factsfor orthic triangles give

RDEF =R

2, sDEF = 2R sinA sinB sinC, and rDEF = 2R cosA cosB cosC.

By Blundon’s Theorem,

sDEF ≤ 2RDEF + (3√

3− 4)rDEF ,

or equivalently

2(3√

3− 4) cosA cosB cosC ≥ 2 sinA sinB sinC − 1.

Equality holds if and only if DEF is equilateral, i.e., if and only if ABC is equi-lateral.

4184. Proposed by Mihaela Berindeanu.

Evaluate the following integral ∫ 63

32

ln 2016x

x2 + 2016dx.

We received 12 submissions of which 8 were correct and complete. We present 2solutions.

Solution 1, by Michel Bataille.

Let I be the given integral. We show that

I =3 ln(2016)

2√

2016

Ç2 arctan

Ç…63

32

å− π

2

å.

We shall use the following lemma: if α > 0, then∫ 1/α

α

lnx

x2 + 1dx = 0.

Proof. The change of variables x = 1u , dx = −du

u2 gives∫ 1/α

α

lnx

x2 + 1dx =

∫ α

1/α

− lnu

1 + 1u2

· −duu2

= −∫ 1/α

α

lnu

u2 + 1du

and the result follows. 2

Now, I = I1 + I2 with

I1 = ln(2016)

∫ 63

32

dx

x2 + 2016=

ln(2016)√2016

Çarctan

Ç…63

32

å− arctan

Ç…32

63

ååCopyright c© Canadian Mathematical Society, 2017

Page 36: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

408/ SOLUTIONS

and

I2 =

∫ 63

32

lnx

x2 + 2016dx =

ln(2016)

2√

2016

∫ √ 6332

√3263

dy

1 + y2+

1√2016

∫ √ 6332

√3263

ln y

1 + y2dy

with the change of variables x = y√

2016.

Using the lemma, ∫ √ 6332

√3263

ln y

1 + y2dy = 0,

hence we have

I2 =ln(2016)

2√

2016

Çarctan

Ç…63

32

å− arctan

Ç…32

63

åå.

In conclusion,

I =3 ln(2016)

2√

2016

Çarctan

Ç…63

32

å− arctan

Ç…32

63

åå=

3 ln(2016)

2√

2016

Ç2 arctan

Ç…63

32

å− π

2

å,

where the latter is true because arctan a+ arctan(1/a) = π2 when a > 0.

Solution 2, by Leonard Giugiuc.

Let a and b be real numbers with b > a > 0. We will evaluate

I =

∫ b

a

ln abx

x2 + abdx.

Making the substitutionab

x→ x, we get

I =

∫ b

a

abx2 ln (ab)2

xabx2 (x2 + ab)

dx =

∫ b

a

ln (ab)2

x

x2 + abdx.

So,

2I =

∫ b

a

ln abx

x2 + abdx+

∫ b

a

ln (ab)2

x

x2 + abdx

= 3 ln ab

∫ b

a

1

x2 + abdx

=3 ln ab√ab

Çarctan

…b

a− arctan

…a

b

å=

3 ln ab√ab

arctanb− a2√ab.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 37: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

SOLUTIONS /409

Setting = 32 and b = 63, we obtain∫ 63

32

ln 2016x

x2 + 2016dx =

3 ln 2016

2√

2016arctan

31

2√

2016.

4185. Proposed by Leonard Giugiuc and Daniel Sitaru.

Prove that for any positive real numbers a, b, c and k, we haveñak−1(a2 + bc)

(b+ c)k+1

ô 1k

+

ñbk−1(b2 + ca)

(c+ a)k+1

ô 1k

+

ñck−1(c2 + ab)

(a+ b)k+1

ô 1k

≥ a

b+ c+

b

c+ a+

c

a+ b.

We received 3 correct solutions. We present the solution by Sefket Arslanagic.

Without loss of generality we will take a ≥ b ≥ c; it follows then that

a

b+ c≥ b

c+ a≥ c

a+ b

anda2 + bc

a(b+ c)≥ b2 + ca

b(c+ a)≥ c2 + ab

c(a+ b),

and we have by Chebyshev’s inequality,

∑cyc

a

b+ c

Åa2 + bc

a(b+ c)

ã1/k≥ 1

3

(∑cyc

a

b+ c

)(∑cyc

Åa2 + bc

a(b+ c)

ã1/k). (1)

We now make use of the inequality

(a2 + bc)(b2 + ca)(c2 + ab) ≥ abc(a+ b)(b+ c)(c+ a),

which holds since, upon expansion, it becomes the sum of the Muirhead inequalities(3, 3, 0) < (3, 2, 1) and (4, 1, 1) < (3, 2, 1). Thus, by the AM-GM inequality,

∑cyc

Åa2 + bc

a(b+ c)

ã1/k≥ 3 · 3

Õ(a2 + bc)(b2 + ca)(c2 + ab)

a(b+ c)(b(c+ a)(c(a+ b)

ò1/k≥ 3. (2)

The claimed inequality now follows from (1) and (2). Equality holds if and onlyif a = b = c.

4186. Proposed by Florin Stanescu.

Let f, g : [0, 1]→ [0,∞), f(0) = g(0) = 0 be two continuous functions such that fis convex and g is concave. If h : [0, 1]→ R is an increasing function, show that∫ 1

0

g(x)h(x)dx ·∫ 1

0

f(x)dx ≤∫ 1

0

g(x)dx ·∫ 1

0

h(x)f(x)dx.

Copyright c© Canadian Mathematical Society, 2017

Page 38: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

410/ SOLUTIONS

We received 2 correct solutions and feature the one by Leonard Giugiuc.

If∫ 1

0f(x)dx = 0, then, since f is continuous and f(x) ≥ 0,∀x ∈ [0, 1], f ≡ 0, and

hence the inequality is proved. The same conclusion holds if∫ 1

0g(x)dx = 0. So

we assume that

I =

∫ 1

0

f(x)dx > 0 and J =

∫ 1

0

g(x)dx > 0.

The required inequality is equivalent to∫ 1

0

h(x)

Åf(x)

I− g(x)

J

ãdx ≥ 0.

Define the function φ : [0, 1] → R as φ(x) = f(x)I −

g(x)J , ∀x ∈ [0, 1]. Clearly, φ is

continuous and convex. Moreover,∫ 1

0

φ(x) =1

I

∫ 1

0

f(x)− 1

J

∫ 1

0

g(x) = 1− 1 = 0,

and φ(0) = 0. Now, the required inequality is equivalent to∫ 1

0h(x)φ(x)dx ≥ 0.

If φ is increasing on [0, 1], then since φ(0) = 0 and∫ 1

0φ(x) = 0, we deduce φ ≡ 0

and we are done. A similar conclusion holds if φ is decreasing. Otherwise, since φis convex, we know ∃ t ∈ (0, 1) such that φ is decreasing on [0, t] and φ is increasingon [t, 1]. Thus it follows that φ(1) ≥ 0 and that ∃ c ∈ (0, 1) such that φ(x) ≤ 0∀x ∈ [0, c] and φ(x) ≥ 0 ∀x ∈ [c, 1]. Then ∀x ∈ [0, c], we have h(x) − h(c) ≤ 0and φ(x) ≤ 0, so that h(x)φ(x) ≥ h(c)φ(x). Similarly, ∀x ∈ [c, 1], we haveh(x)− h(c) ≥ 0 and φ(x) ≥ 0, so that h(x)φ(x) ≥ h(c)φ(x).

In conclusion, h(x)φ(x) ≥ h(c)φ(x), ∀x ∈ [0, 1], and hence∫ 1

0

h(x)φ(x) ≥∫ 1

0

h(c)φ(x) = 0.

The proof is complete.

4187. Proposed by Avi Sigler and Moshe Stupel.

A point P inside triangle ABC divides the three cevians AD,BE,CF through Pinto segments whose harmonic means are

KA =2AP · PDAP + PD

, KB =2BP · PEBP + PE

, KC =2CP · PFCP + PF

.

Prove that these three harmonic means, each associated with a cevian, are propor-tional to the sines of the angles ∠CPE,∠APF,∠EPA formed between the othertwo cevians.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 39: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

SOLUTIONS /411

We received nine solutions, all of which were correct, and feature the solutionwhose similar versions came independently from Steven Chow and Oliver Geupel.

Let square brackets represent areas. From the relation

PD

AD=

[PBC]

[ABC]=BP · CP sin∠CPE

2[ABC],

we obtain

sin∠CPE =2[ABC] · PDAD ·BP · CP

.

Hence,KA

sin∠CPE=AP ·BP · CP

[ABC].

Similarly,KB

sin∠APF=

KC

sin∠EPA=AP ·BP · CP

[ABC].

As a consequence, the three harmonic means of the segments on one cevian areproportional to the sines of the angles formed between the other two cevians.

4188. Proposed by Daniel Sitaru.

Let 0 < x < y < z < π2 . Prove that

(x+ y) sin z + (x− z) sin y < (y + z) sinx.

There were eight correct solutions. Four of them gave essentially the solutionbelow.

Because sin tt is a decreasing function on (0, π/2), we find that

x sin y < y sinx, y sin z < z sin y, and x sin z < z sinx.

Therefore

(y + z) sinx− (x− z) sin y − (x+ y) sin z

= (y sinx− x sin y) + (z sin y − y sin z) + (z sinx− x sin z) > 0.

Copyright c© Canadian Mathematical Society, 2017

Page 40: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

412/ SOLUTIONS

4189. Proposed by Mihaela Berindeanu.

Prove that the equation

3y2 = −2x2 − 2z2 + 5xy + 5yz − 4xz + 1

has infinitely many solutions in integers.

We received 15 solutions, most of which solved the given equation. We present thesolution by Arkady Alt.

Rearrange and factor the given equation:

2x2 + 4xz + 2z2 + 3y2 − 5xy − 5yz = 1⇔2(x+ z)2 − 5y(x+ z) + 3y2 = 1⇔(2(x+ z)− 3y)(x+ z − y) = 1.

Let w = x+ z; if x, z are integers then so is w. To find the integer solutions to theequation (2w − 3y)(w − y) = 1 we consider two cases:

2w − 3y = w − y = 1 OR

2w − 3y = w − y = −1.

The first system of equations yields w = 2 and y = 1, and the second w = −2 andy = −1. From x + y = w, we get that the solutions to the original equation are{(t, 1, 2 − t) : t ∈ Z} ∪ {(t,−1,−2 − t) : t ∈ Z}, showing that there are infinitelymany solutions.

4190. Proposed by Leonard Giugiuc.

Let a, b, c, d and e be real numbers such that a+ b+ c+ d+ e = 20 and a2 + b2 +c2 + d2 + e2 = 100. Prove that

625 ≤ abcd+ abce+ abde+ acde+ bcde ≤ 945.

Only the proposer supplied a solution.

Suppose, wolog, that a ≥ b ≥ c ≥ d ≥ e. We first verify that a, b, c, d, e must beall nonnegative. Since

4(a2 + b2 + c2 + d2)− (a+ b+ c+ d)2

= 3(a2 + b2 + c2 + d2)− 2(ab+ ac+ ad+ bc+ bd+ be)

= (a− b)2 + (a− c)2 + (a− d)2

+ (b− c)2 + (b− d)2 + (c− d)2 ≥ 0,

then

(a+ b+ c+ d)2 ≤ 4(a2 + b2 + c2 + d2) ≤ 400.

Crux Mathematicorum, Vol. 43(9), November 2017

Page 41: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

SOLUTIONS /413

Thus a + b + c + d ≤ 20 and e ≥ 0. Equality occurs if and only if (a, b, c, d, e) =(5, 5, 5, 5, 0).

The foregoing inequality can be rewritten (20−e)2 ≤ 4(100−e2), whence 0 ≤ e ≤ 8.An analogous argument certifies that a, b, c, d also lie in the closed interval [0, 8].

Consider the quintic polynomial

p(x) = x5 − 20x4 + 150x3 − 5qx2 + 5rx− s,

whose roots are a, b, c, d, e, so that 5q =∑abc, 5r =

∑abcd and s = abcde. (We

note that r 6= 0, for otherwise d = e = 0 and 300 = 3(a2 + b2 + c2) ≥ (a+ b+ c)2 =400, a contradiction.)

By Rolle’s theorem,

p′(x) = 5(x4 − 16x3 + 90x2 − 2qx+ r)

has four real roots in the open interval (0, 8), as does the function

f(x) =p′(x)

5x= x3 − 16x2 + 90x− 2q +

r

x.

We have that f ′(x) = x−2g(x), where g(x) = 3x4 − 32x3 + 90x2 − r. By Rolle’stheorem, f ′(x) and so g(x) have three positive roots in (0, 8). Since

g′(x) = 12x(x− 3)(x− 5),

the function g(x) is monotone on and has a root in each of the intervals (0, 3),(3, 5) and (5, 8). We have 0 > g(0) = −r, 0 ≤ g(3) = 189 − r and 0 ≥ 125 − r.Therefore 125 ≤ r ≤ 189 and

625 ≤ 5r = abcd+ abce+ abde+ acde+ bcde ≤ 945.

Editor’s comment. For each quintuple (a, b, c, d, e) satisfying the two conditions,there is an associate (8 − e, 8 − d, 8 − c, 8 − b, 8 − a) that also satisfies them.Two associate quintuples are (5, 5, 5, 5, 0) and (8, 3, 3, 3, 3). In the former case,p(x) = x(x − 5)4, p′(x) = 5(x − 1)(x − 5)3, g(x) = 3x4 − 32x3 + 90x2 − 125 =(x−5)2(x+1)(3x−5) and

∑abcd = 625. In the latter case, p(x) = (x−8)(x−3)4,

p′(x) = 5(x − 7)(x − 3)3, f(x) = x3 − 16x2 + 90x − 216 + (189/x), g(x) = 3x4 −32x3 + 90x2 − 189 = (x− 3)2(3x2 − 14x− 21), and

∑abcd = 945.

There is one other quintuple of integers (7, 5, 4, 3, 1) satisfying the conditions whichis its own associate. In this case

∑abcd = 809.

Copyright c© Canadian Mathematical Society, 2017

Page 42: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

414/ AUTHORS’ INDEX

AUTHORS’ INDEXSolvers and proposers appearing in this issue

(Bold font indicates featured solution.)

Proposers

George Apostolopoulos, Messolonghi, Greece: 4289Sefket Arslanagi c, University of Sarajevo, Sarajevo, Bosnia and Herzegovina: 4281Michel Bataille, Rouen, France: 4282Marian Cucoanes and Marius Dragan, Mircea cel Batran National College, Bucharest,

Romania : 4286Shafiqur Rahman, Bangladesh, and Leonard Giugiuc, Romania : 4285Van Khea, Cambodgia, and Leonard Giugiuc, Romania : 4287Margarita Maksakova, Minsk, Belarus : 4283Hung Nguyen Viet, Hanoi University of Science, Hanoi, Vietnam : 4288Dao Thanh Oai, Vietnam, and Leonard Giugiuc, Romania : 4290Daniel Sitaru, Drobeta Turnu Severin, Romania : 4284

Solvers - individuals

Mohammed Aassila, Strasbourg, France : OC291, OC292, OC294, OC295Adnan Ali, Atomic Energy Central School-4, Mumbai, India : OC291, OC292, OC295,

4182, 4189Arkady Alt, San Jose, CA, USA : OC291, 4183, 4188, 4189Sefket Arslanagic, University of Sarajevo, Sarajevo, Bosnia and Herzegovina : CC241,

CC242, CC245, 4185, 4189Michel Bataille, Rouen, France : OC291, OC295, 3500, 4181, 4182, 4184, 4187, 4188,

4189Mihaela Berindeanu, Colegiul National Tudor Vianu, Bucharest, Romania : 4184, 4189Paul Bracken, University of Texas, Edinburg, TX, USA : 3500, 4184Steven Chow, student, Albert Campbell Collegiate Institute, Scarborough, ON : OC291,

OC 292, OC294, OC 295, 4181, 4182, 4187, 4189Miguel Amengual Covas, Cala Figuera, Mallorca, Spain : CC242Daniel Dan, Drobeta Turnu Severin, Romania : CC241, CC242, CC243, CC245, 4182,

4184, 4188, 4189Prithwijit De, Homi Bhabha Centre for Science Education, Mumbai, India : 4184, 4189Ivko Dimitric, Pennsylvania State University Fayette, Lemont Furnace, PA, USA : CC241,

CC242, CC243, CC244, CC245Andrea Fanchini, Cantu, Italy : CC242, 4181Hannes Geupel, Bruhl, NRW, Germany : CC243Oliver Geupel, Bruhl, NRW, Germany : OC291, OC292, OC293, OC295 4187Leonard Giugiuc, Drobeta Turnu Severin, Romania : 4181, 4183, 4184, 4186, 4187,

4188, 4189, 4190John G. Heuver, Grande Prairie, AB : CC241 , CC242Nevena Koleva, IMI-BAS, Sofia, Bulgaria: 4187Kee-Wai Lau, Hong Kong, China : 4189Kathleen Lewis, University of the Gambia, Brikama, Republic of the Gambia : CC241,

CC242, CC243

Crux Mathematicorum, Vol. 43(9), November 2017

Page 43: Crux Mathematicorum...z 1 z 2 z 3 y 1 y 2 y 3 x 1 x 2 x 3 If the number of 3s used is exactly three, the other six cells must be lled with 1s, and, as long as 3s are placed so that

AUTHORS’ INDEX /415

David E. Manes, SUNY at Oneonta, Oneonta, NY, USA : CC241, CC242, OC295, 4189Soumitra Mandal, Scottish Church College, Kolkata, West Bengal, India : 4188Paolo Perfetti, Dipartimento di Matematica, Universita degli studi di Tor Vergata Roma,

Rome, Italy : OC291, 3500C.R. Pranesachar, Indian Institute of Science, Bangalore, India : OC291, OC295, 4187,

4189Barbara Roy, Lebanese University, Fanar, Lebanon : 4188, 4189Henry Ricardo, Westchester Area Math Circle, Purchase, NY, USA : OC295Joel Schlosberg, Bayside, NY : CC241, CC242, CC243, CC244, CC245, 4182Daniel Sitaru, Drobeta Turnu Severin, Romania : 4188Neculai Stanciu, George Emil Palade Secondary School, Buzau, Romania: OC291Digby Smith, Mount Royal University, Calgary, AB : CC242, 4184, 4185, 4188, 4189Florin Stanescu, Serban Cioculescu school, Gaesti, Romania: 4186Marius Stanean, , Zalau, Romania : 4181Peter Y. Woo, Biola University, La Mirada, CA, USA : 4181, 4187Konstantine Zelator, University of Pittsburgh, Pittsburgh, PA, USA : CC241, CC242,

CC245Titu Zvonaru, Comanesti, Romania : CC241, CC242, CC244, CC245, 4184, 4187

Solvers - collaborationsDionne Bailey, Elsie Campbell, and Charles R. Diminnie, Angelo State University, San

Angelo, USA : 4189Leonard Giugiuc and Daniel Sitaru, Romania: 4185Lorian Saceanu, Norway, and Leonard Giugiuc, Romania : 4183Avi Sigler and Moshe Stupel, Haifa, Israel : 4187Missouri State University Problem Solving Group, Springfield, MO : CC243, OC292,

OC295Skidmore College Problem Solving Group : 4182

Copyright c© Canadian Mathematical Society, 2017