CRUXv 46 N 1
CRUXv 46 N 1
published online by the Canadian Mathematical Society. Its aim is primarily educational; it is not a research
journal. Online submission:
https://publications.cms.math.ca/cruxbox/
Crux Mathematicorum est une publication de résolution de problèmes de niveau secondaire et de premier
cycle universitaire publiée par la Société mathématique du Canada. Principalement de nature éducative,
le Crux n’est pas une revue scientifique. Soumission en ligne:
https://publications.cms.math.ca/cruxbox/
The Canadian Mathematical Society grants permission to individual readers of this publication to copy articles for
their own personal use.
c CANADIAN MATHEMATICAL SOCIETY 2020. ALL RIGHTS RESERVED.
ISSN 1496-4309 (Online)
La Société mathématique du Canada permet aux lecteurs de reproduire des articles de la présente publication à des
fins personnelles uniquement.
Editorial Board
Crux Mathematicorum
Founding Editors / Rédacteurs-fondateurs: Léopold Sauvé & Frederick G.B. Maskell
Former Editors / Anciens Rédacteurs: G.W. Sands, R.E. Woodrow, Bruce L.R. Shawyer,
Shawn Godin
Crux Mathematicorum
with Mathematical Mayhem
Former Editors / Anciens Rédacteurs: Bruce L.R. Shawyer, James E. Totten, Václav Linek,
Shawn Godin
Editorial /3
EDITORIAL
New Year, New Volume! As my palindromic-loving friends would like to say,
Happy 2 × 505 × 2 !
My New Year’s resolution is to read more. I tend to flip through many books
(mostly math or math education related), but I find that I don’t fully read many.
This year, I’m hoping to change that and, in the absence of Book Reviews, I will
update you in my readings.
I am starting with something old: “On Being the Right Size And Other Essays”
by J. B. S. Haldane (1892–1964). An evolutionary biologist, Haldane was a pas-
sionate science popularizer and he writes with ease and charisma. The collection
was recommended to me by a colleague specifically for the first (and title) essay
after I lamented that my biology students use the surface area/volume “law” as
if it is something that holds independent of the shape you’re considering or pro-
portionality constants involved. “On Being the Right Size” addresses exactly that
question of proportion through a variety of examples: scaling of bones, danger of
falling or getting wet, how limits to gas diffusion limit insect size, why big animals
don’t have giant eyes and so on. “Comparative anatomy is largely the story of the
struggle to increase surface in proportion to volume”, hence large animals’ fractal
lungs and twisted guts. It is an interesting read, persuasive in its arguments (al-
beit not always infallible) and sprinkled with quantitative reasoning. I’m looking
forward to reading the rest of the book.
Kseniya Garaschuk
MATHEMATTIC
No. 11
The problems featured in this section are intended for students at the secondary school
level.
MA53.
Find all positive integers m and n which satisfy the equation
23 − 1 33 − 1 m3 − 1 n3 − 1
3
· 3 ··· 3 = 3 .
2 +1 3 +1 m +1 n +2
MA54. How many six-digit numbers are there, with leading 0s allowed, such
that the sum of the first three digits is equal to the sum of the last three digits,
and the sum of the digits in even positions is equal to the sum of the digits in odd
positions?
MA55. The diagram shows three touching semicircles with radius 1 inside
an equilateral triangle, which each semicircle also touches. The diameter of each
semicircle lies along a side of the triangle. What is the length of each side of the
equilateral triangle?
.................................................................
Les problémes proposés dans cette section sont appropriés aux étudiants de l’école sec-
ondaire.
Pour faciliter l’examen des solutions, nous demandons aux lecteurs de les faire parvenir
au plus tard le 15 mars 2020.
La rédaction souhaite remercier Rolland Gaudet, professeur titulaire à la retraite à
l’Université de Saint-Boniface, d’avoir traduit les problèmes.
2x + 3y = 4z .
MA52. Le diagramme montre une partie d’un pavage du plan par un quadri-
latère. Katherine désire en effectuer un colorage.
MA53.
Déterminer tous les entiers positifs m et n satisfaisant à l’équation
23 − 1 33 − 1 m3 − 1 n3 − 1
· · · · = .
23 + 1 33 + 1 m3 + 1 n3 + 2
MA54. Combien de nombres à six chiffres y a-t-il, tels que la somme des
trois premiers chiffres est égale à la somme des trois derniers chiffres et puis que
la somme des chiffres en positions paires égale la somme des chiffres en positions
impaires? La présence de 0s en première(s) position(s) est permise.
MATHEMATTIC
SOLUTIONS
Statements of the problems in this section originally appear in 2019: 45(6), p. 303–305.
MA26. Nine (not necessarily distinct) 9-digit numbers are formed using each
digit 1 through 9 exactly once. What is the maximum possible number of zeros
that the sum of these nine numbers can end with?
Originally Problem M2430 of Kvant.
We received 3 submissions, all of which were correct and complete. We present
the solution by the Missouri State University Problem Solving Group.
The answer is eight. Since
the answer is at least 8. But the maximum value the sum can be is
9 × 987654321 = 8888888889,
so the only other possibility is to have nine zeros. Now each number whose digits
are a permutation of 1, . . . , 9 is a multiple of 9, since the sum of their digits is.
Therefore any sum of these numbers must also be a multiple of 9. But the only
10-digit number ending in nine zeros that is a multiple of 9 is 9000000000 and this
is larger than our upper bound.
We note that analogous methods extend this result to base b: if b − 1 numbers
consisting of permutations of 1, . . . , b−1 are added, the maximum possible number
of zeros that their sum can end in is b − 2.
There is no way to place a submarine on the grid without its touching one of the
nine marked grid points. No two submarines can touch the same marked grid point
so nine submarines is the most that can be placed on the grid without touching.
It is possible to place nine submarines on the grid. There are many ways to do
this; here is one:
and
44n+1 + 44n+3 + 1 ≥ 4 + 43 + 1 = 69 > 7,
and
44n+1 + 44n+3 + 1 ≥ 69 > 9,
MA29. Find all positive integers n satisfying the following condition: numbers
1, 2, 3, . . . , 2n can be split into pairs so that if numbers in each pair are added and
all the sums are multiplied together, the result is a perfect square.
Originally Problem 2 of Fall Junior A-level of XL Tournament of Towns 2017.
We received 3 submissions, all of which were correct and complete. We present
the solution by the Missouri State University Problem Solving Group, modified by
the editor.
We claim that n satisfies the condition if n > 1.
We first observe that n = 1 fails the condition. For n = 1 the only pairing is
{1, 2}, the sum of which is the non-perfect square 3.
There are two cases:
1. n = 2k where k ≥ 1. By pairing i with 2n + 1 − i for i = 1, 2, . . . , n gives a
2
product of (2n + 1)k .
2. n = 2k + 1 where k ≥ 1. When k ≥ 1, we pair 1 and 5, 2 and 4, 3 and 6, and
6 + i with 2n + 1 − i for i = 1, 2, . . . , n − 3 = 2k − 2. The product is then
2
(1 + 5)(2 + 4)(3 + 6)(2n + 7)2k−2 = 18(2n + 7)k−1 .
√
Similarly, DE = 3 and applying the Law of Cosines to 4AF E we have
p √
AE = 12 + 32 + 1 · 3 = 13.
Triangle ABD in this figure is congruent to triangle DAE in the figure in Method I.
Thus, we wish to show that ∠ACB ∼ = ∠ADB. The point marked O is equidistant
from each of A, B, C, D (it lies on the intersection of the perpendicular bisectors
of AD, AB, and BC). Therefore, these points lie on a circle centered at O. Since
∠ACB and ∠ADB are subtended by the same arc, they must be congruent.
TEACHING PROBLEMS
No. 8
Richard Hoshino
The Calendar Problem
In the Calendar Problem, your goal is to figure out the day of the week on which
you were born.
There are various YouTube videos of mathematicians (or “mathemagicians”) per-
forming this trick in their heads. For example, an audience member will call out
her birthday (e.g. May 25, 2004), and the mathematician will instantly reply,
“Tuesday”.
In this article, we will unpack this problem and determine an algorithm to solve
this problem.
First, let’s investigate the day of the week that our birthday falls on in the year
2020. To do this, all we need is the knowledge that January 1, 2020 is Wednesday.
Whenever I have presented this problem in a class, either with high school students
or undergraduates, one student always knows the number of days in each month:
January 31
February 29 (since 2020 is a leap year)
March 31
April 30
May 31
June 30
July 31
August 31
September 30
October 31
November 30
December 31
Notice that January 1 must be the same day of the week as January 8, January
15, January 22, and January 29. This is because each of these numbers in {1, 8,
15, 22, 29} gives the same remainder when divided by 7.
Thus, for some birthdays, the Calendar Problem can be easily solved. Let’s con-
sider someone born on January 17. For the year 2020, since January 1 is a Wednes-
day we know that January 15 is a Wednesday, which implies that January 16 is a
Thursday, from which it follows that January 17 is a Friday.
For birthdays in the month of January, notice that the answer can be found by
simply taking the date, dividing by 7, and calculating the remainder. Then we
can use this table to read off the answer:
0 Tuesday
1 Wednesday
2 Thursday
3 Friday
4 Saturday
5 Sunday
6 Monday
Here are two common approaches for solving the Calendar Problem.
Approach One: Count the number of days that have elapsed from the start of
the year (January 0) until the target date. For example, March 23 consists of
31 + 29 + 23 days, since we need to add up all the days in January and February
and then the twenty-three days in March. This adds up to 83. We divide by 7.
Since 83 = 7 × 11 + 6, the remainder is 6. From the above table, we see that a
remainder of 6 corresponds to Monday.
Approach Two: Determine the day of the week for the first date of each month,
showing that if January 1 falls on Wednesday, then February 1 must be a Saturday,
March 1 must be a Sunday, and so on. From this, students can solve their problem
for any given date by adding or subtracting increments of seven. For example,
March 23 has to be the same date as March 16, March 9, and March 2. Thus,
March 23 has to be a Monday, since March 1 is a Sunday.
A clever approach combines these two paradigms, using the first date of each
month to determine the appropriate “shift”. For example, March 1 is 31 + 29 =
60 = 8×7+4 days after January 1, and so March 1 is “shifted” by 4 days compared
to January 1. Thus, if we know that the shift number of March is 4, then we can
determine the day of week of March 23 by adding the date to the shift number
(4 + 23 = 27 = 3 × 7 + 6), dividing the number by 7 and taking the remainder
(which is 6), and then reading the above table to conclude that the answer is
Monday.
For leap years such as the year 2020, the shift dates of each month are as follows:
Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec
0 3 4 0 2 5 0 3 6 1 4 6
Notice this table forms four sets of three digits that can be remembered this way:
For example, the shift number for June is 5, since the number of days until the
start of June is 31 + 29 + 31 + 30 + 31 = 152 = 21 × 7 + 5, which has a remainder
of 5 upon division by 7. In other words, June 1 is exactly 21 weeks and 5 days
after January 1 which implies that the shift for June is 5.
Let D be the date and S be the shift number. For example, June 15 would have
D = 15 and S = 5. To perform this algorithm in our head, we just need to
add D + S, divide by 7, and the remainder gives us our answer to the Calendar
Problem. Since this remainder is 6, we can conclude that June 15, 2020 will be a
Monday.
Now let’s extend this by replacing the year 2020 with our birth year. In solving
this harder problem, we realize that each 365-day year contributes one extra day
(52 weeks plus 1 day) and each 366-day leap year contributes two extra days (52
weeks plus 2 days). Thus, if January 1, 2020 is a Wednesday, then January 1,
2019 was a Tuesday, since we have shifted back one day. And similarly, January
1, 2021 will be a Friday since we will need to shift forward two days.
In one of my school visits (in 2019), one student made the powerful insight that
her birthday in 2002 must be the same day of week as her birthday in 2019, since
there are 17 “extra days” in addition to the four Feb 29 “leap days” that occurred
in 2004, 2008, 2012, and 2016. Since 17 + 4 = 21, the calendar shifted 21 days
between her birthday in 2002 and her birthday in 2019. And since 21 is a multiple
of 7, if her birthday fell on a Tuesday in 2019, then it must have fallen on a
Tuesday in 2002. This student provided a clear method for how to handle the
tricky concept of leap years.
A different student from the same class observed that the calendar repeats itself
every 28 years, since each year contributes one extra day (52 weeks plus 1 day),
and there are 7 occurrences of February 29 during any 28-year period. Thus, the
calendar shifts by 28 + 7 = 35 days, which is a multiple of 7. This observation
enabled the student to determine the day of the week on which her parents were
born.
Through this process of solving the Calendar Problem and determining an algo-
rithm that works for any birthday, students demonstrate the four principles of the
Computational Thinking process.
(i) Decomposition: break down the problem into smaller tasks
(ii) Pattern recognition: identify similarities, differences, and patterns within
the problem
(iii) Abstraction: identify general principles and filter out unnecessary informa-
tion
(iv) Algorithmic design: identify and organize the steps needed to solve the prob-
lem
As mathematicians we use these four principles in our research endeavours, and
the Calendar Problem offers a challenge for enabling our students to have similar
experiences.
During the 2018-2019 sabbatical year, I worked with the Callysto Project, a
federally-funded initiative to bring computational thinking and mathematical prob-
lem solving into Grade 5-12 Canadian classrooms (www.callysto.ca). Through
my work with Callysto, I visited over a dozen schools and worked with 700+ stu-
dents, sharing rich math problems that incorporated the Callysto technology (a
Question #1
Here is an algorithm that determines the correct day of week for any date in the
20th century (Jan 1, 1901 to Dec 31, 2000).
Let Y be the last two digits of the year, D be the day, and S be the “shift” value
according to the following table that is correct for non-leap years:
Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec
0 3 3 6 1 4 6 2 5 0 3 5
For example, the author’s birthday (June 15, 1978) has Y = 78, D = 15, and
S = 4.
If the year corresponds to a leap year (i.e., Y is a multiple of 4) and the month is
January or February, subtract 1 from T . (Why do we need to do this?)
Divide T by 7 and determine its remainder. The remainder tells us our answer:
0 Sunday
1 Monday
2 Tuesday
3 Wednesday
4 Thursday
5 Friday
6 Saturday
Question #2
Question #3
Create your own algorithm for other famous dates before the 20th century, and
apply it to the famous dates such as the following:
(i) July 1, 1867 (Confederation Day in Canada)
(ii) July 4, 1776 (Independence Day in the USA)
(iii) April 23, 1616 (Death of William Shakespeare)
(iv) September 30, 1207 (Birthday of Rumi)
Note that you will need to be careful about ensuring the correct calculation of leap
years, due to the quirky rules that occur when the year is a multiple of 100 but
not a multiple of 400. Specifically, the years 1600 and 2000 are leap years, while
the years 1700, 1800, 1900 are not leap years.
OLYMPIAD CORNER
No. 379
The problems featured in this section have appeared in a regional or national mathematical
Olympiad.
OC461. Let A and B be two finite sets. Determine the number of functions
f : A → A with the property that there exist two functions g : A → B and
h : B → A such that g(h(x)) = x ∀x ∈ B and h(g(x)) = f (x) ∀x ∈ A.
OC464. Given an acute triangle ABC with orthocenter H. The angle bisector
of ∠BHC intersects side BC at D. Let E and F be the symmetric points of D
with respect to lines AB and AC, respectively. Prove that the circumcircle of
triangle AEF passes through the midpoint G of arc BAC.
Find a2017 .
.................................................................
Les problèmes présentés dans cette section ont déjà été présentés dans le cadre d’une
olympiade mathématique régionale ou nationale.
Pour faciliter l’examen des solutions, nous demandons aux lecteurs de les faire parvenir
au plus tard le 15 mars 2020.
La rédaction souhaite remercier Rolland Gaudet, professeur titulaire à la retraite à
l’Université de Saint-Boniface, d’avoir traduit les problèmes.
OC463. Les cases d’une matrice de taille 6 × 6 sont remplies par les entiers
de 1 à 36.
(a) Déterminer une manière de remplir les cases de la matrice de façon à ce que la
somme de deux quelconques nombres d’une même rangée ou colonne donne
toujours supérieur à 11.
(b) Quelle que soit la façon de remplir les cases de la matrice, démontrer qu’au
moins une somme de deux éléments de même rangée ou colonne sera inférieure
ou égale à 12.
Déterminer a2017 .
OLYMPIAD CORNER
SOLUTIONS
Statements of the problems in this section originally appear in 2019: 45(6), p. 320–321.
Let ω be the circumcircle of 4ABC. Let A0 , B 0 , and C 0 be the points that are
symmetric with respect to line OI to A, B, and C, respectively. Because the
symmetry line, OI, passes through the centre of ω we have that the symmetric
images A0 , B 0 , and C 0 belong to ω, as well.
Let D be the intersection of AC with the tangent at I to the circumcircle of
4BB 0 I. We show that DI = DB 0 .
Let D0 be the point symmetric to D with respect to line OI. The centre of the
circumcircle of triangle BB 0 I lies on OI, given that 4BB 0 I is isosceles. Therefore
the tangent ID is perpendicular to OI, and I, D, and D0 are co-linear with I
being the middle point of DD0 . Moreover, if we extend DD0 to intersect ω at M
and M 0 we find that I is the middle of the new segment, M M 0 .
We are in the setting of the butterfly theorem. Let X be the intersection of A0 I
with ω, and Z be the intersection of C 0 I with ω. D0 is a point on A0 C 0 , D, I, and
D0 are co-linear, and I is the middle point of DD0 . Due to the butterfly theorem
we conclude that D belongs to XZ.
After multiplying out, simplifying, and dividing by II the equation of the bisector,
KD, reduces to Ç å
1
Å ã
B Z B Z
1− + 1− =1− . (4)
I I I I II
Since KB 0 = KI and KD is the angle bisector of ∠B 0 KI, the two tangents to the
circumcircle of BB 0 I at points B 0 and I intersect on the bisector KD. Therefore,
to prove that the two tangents intersect on the line AC it suffices to show that
the lines DK, AC and the perpendicular to IO at I intersect at one point.
Z −I Z −I
=− ⇐⇒ IZ + IZ = 2II. (5)
I I
(Q − P )Z − (Q − P )Z = P Q − P Q, (6)
Z + c2 a2 Z = a2 + c2 . (7)
Using (1) and combining (5) and (7), we find the intersection of the perpendicular
to IO at I and the line AC to be the point Z whose affix satisfies
It can be now shown that this point satisfies the equation (4) so the lines DK, AC
and IZ are concurrent at Z. Namely, using (1) we compute
1 (a + c)(ab + bc + ca + b2 ) a+c I −B
1− = =− · ,
II (a + b + c)(ab + bc + ca) abc I I
so that
Ç å
1 −I 1
Å ã Å ã Å ã
B abc I B
1− =− 1− and 1− = 1− .
I a+c II I b(a + c) II
Z ca − I Z b2 (ca I − 1)
= and = .
I ca − b2 I ca − b2
Clearly, this point lies on the line AC, since its second coordinate is 0.
OC437. The magician and his helper have a deck of cards. The cards all
have the same back, but their faces are coloured in one of 2017 colours (there are
1000000 cards of each colour). The magician and the helper are going to show the
following trick. The magician leaves the room; volunteers from the audience place
n > 1 cards in a row on a table, all face up. The helper looks at these cards, then
he turns all but one card face down (without changing their order). The magician
returns, looks at the cards, points to one of the face-down cards and states its
colour. What is the minimum number n such that the magician and his helper
can have a strategy to do the magic trick successfully?
Originally Russia MO, 4th Problem, Grade 11, Final Round 2017 (Game Theory).
No solutions were received.
OC439. Let (G, ·) be a group and let m and n be two nonzero natural numbers
that are relatively prime. Prove that if the functions f : G → G, f (x) = xm+1
and g : G → G, g(x) = xn+1 are surjective endomorphisms, then the group G is
abelian.
Originally Romania MO, 2nd Problem, Grade 12, District Round 2017 (Abstract
Algebra).
We received 2 correct submissions. We present the solution by Oliver Geupel.
Independently, Corneliu Manescu-Avram submitted a similar solution.
Originally Romania MO, 4th Problem, Grade 11, Final Round 2017.
We received 4 correct submissions. We present the solution by Ivko Dimitrić. Simi-
lar solutions were submitted independently by Brian Bradie and Corneliu Manescu-
Avram.
Since f ([a, b]) ⊂ [a, b] and f is increasing and differentiable, the Mean Value Theo-
rem for f applied to the interval [f (a), f (b)] guarantees the existence of a number
q, a ≤ f (a) < q < f (b) ≤ b, such that
f (f (b)) − f (f (a)) = f 0 (q) (f (b) − f (a)).
Another application of the same theorem on the interval [a, b] tells us that
f (b) − f (a) = f 0 (p) (b − a)
for some number p, a < p < b. Combining the two formulas we get
f (f (b)) − f (f (a)) = f 0 (p)f 0 (q) (b − a), (1)
where p, q ∈ (a, b).
Next, we can assume that f 0 (p) ≤ f 0 (q). Since f 0 is positive we have
»
f 0 (p) ≤ f 0 (p)f 0 (q) ≤ f 0 (q).
Then, the value f 0 (p)f 0 (q) is between f 0 (p) and f 0 (q). Since f 0 is continuous,
p
by the Intermediate Value Theorem for f 0 on the interval [p, q], there exists c ∈
0
p
[p, q] ⊂ (a, b) such that f (c) = f (p)f 0 (q). Combining with (1)
0
FOCUS ON...
No. 39
Michel Bataille
Introducing SA , SB , SC in Barycentric Coordinates
Introduction
The use of barycentric coordinates relative to a triangle ABC is quite appropriate
when solving problems involving affine properties such as collinearity of points,
concurrency of lines or even ratio of areas, but does not seem adapted to euclidean
properties such as lengths or perpendicularity. However, if a = BC, b = CA, c =
AB, a few results linked to the numbers
b2 + c2 − a2 c2 + a2 − b2 a2 + b2 − c2
SA = , SB = , SC =
2 2 2
(Conway’s triangle notation) sometimes lead to a simple coordinate solution to
euclidean problems. Besides, this is less surprising once one has remarked that
−−→ −→ −−→ −−→ −→ −−→
SA , SB , SC are nothing but the dot products AB · AC, BC · BA, CA · CB,
respectively!
After a paragraph offering useful relations concerning SA , SB , SC , we will present
some examples of situations that can prompt a resort to these numbers.
SB + SC = a2 , SB − SC = c2 − b2 ,
SC + SA = b2 , SC − SA = a2 − c2 ,
SA + SB = c2 , SA − SB = b2 − a2
are of constant use and should be kept in mind from now on!
Other interesting, readily checked relations are
c2 SC − b2 SB = (b2 − c2 )SA ,
a2 SA − c2 SC = (c2 − a2 )SB ,
b2 SB − a2 SA = (a2 − b2 )SC
SB SC + a2 SA = SC SA + b2 SB = SA SB + c2 SC = 4F 2
and
2(SB SC + SC SA + SA SB ) = a2 SA + b2 SB + c2 SC = 8F 2 .
These formulas are easily proved with the help of the known
and
H = (a cos B cos C : b cos C cos A : c cos A cos B).
b2 + c2 − a2 SA bSB cSC SB SC
a cos A = a · = a2 and a cos B cos C = a · · =
2bc abc abc abc abc
we obtain that
O = (a2 SA : b2 SB : c2 SC ), H = (SB SC : SC SA : SA SB ).
These coordinates readily yield those of the centre N of the nine-point circle: since
N is the midpoint of OH, we have
hence
a result to be used in our first example, problem OC 311 [2017 : 12 ; 2018 : 102]:
Let ∆ABC be an acute-scalene triangle, and let N be the center of
the circle which passes through the feet of the altitudes. Let D be the
intersection of the tangents to the circumcircle of ∆ABC at B and C.
Prove that A, D and N are collinear if and only if ∠BAC = 45◦ .
Clearly, N is the point above and the point D lies on the symmedian through A
of ∆ABC (a well-known result), hence it is sufficient to prove that N is on this
symmedian if and only if ∠BAC = 45◦ .
With the previous notations, the symmedian point K is (a2 : b2 : c2 ) and so the
equation of the symmedian AK is c2 y − b2 z = 0.
Therefore N is on the symmedian AD if and only if
c2 (SC SA + 4F 2 ) = b2 (SA SB + 4F 2 ),
SA (c2 SC − b2 SB ) = 4F 2 (b2 − c2 )
2
SA = 4F 2 (since ABC is scalene)
(b + c − a ) = 2a2 b2 + 2b2 c2 + 2c2 a2 − a4 − b4 − c4
2 2 2 2
Å 2 ã2
b + c2 − a2 1
=
2bc 2
1
cos2 (∠BAC) =
2
and since ABC is acute-angled, the latter means that ∠BAC = 45◦ .
As a second example, we next present an alternative solution to problem 4258
[2017 : 265 ; 2018 : 270]:
Let ABC be an acute triangle with circumcentre O, orthocentre H,
D ∈ BC, AD ⊥ BC, E ∈ AC, BE ⊥ AC. Define points F and G
to be the fourth vertices of parallelograms CADF and CBEG. If X
is the midpoint of F G, and Y is the point where XC intersects the
circumcircle again, prove that AHBY is a parallelogram.
b2 G = (SC )A − b2 B + (b2 + SA )C
and
a2 F = −a2 A + (SC )B + (a2 + SB )C.
Now, noticing that the equation of the line CO is (b2 SB )x − (a2 SA )y = 0, we see
that X is on CO. It follows that the line CY is a diameter of the circumcircle and
therefore CB ⊥ BY and CA ⊥ AY . Thus, BY k AH and AY k BH and AHBY
is a parallelogram.
About perpendiculars
We shall illustrate the following result: If (f : g : h) is the infinite point of the line
`, then the infinite point (f 0 : g 0 : h0 ) of the perpendiculars to ` is given by
We quickly repeat the known proof for completeness. Expressing that the vectors
−−→ −→ −−→ −→
g AB + hAC and g 0 AB + h0 AC are orthogonal yields
−−→ −→ −−→ −→
0 = (g AB + hAC) · (g 0 AB + h0 AC) = g 0 (gc2 + hSA ) + h0 (gSA + hb2 ).
Since f + g + h = f 0 + g 0 + h0 = 0, we obtain
g0 −h0 f0
= = ,
gSA + hb2 hSA + gc2 −gSA − hb2 + hSA + gc2
that is,
f0 g0 h0
= = .
gSB − hSC hSC − f SA f SA − gSB
To see this at work through a simple example, consider the line BC whose point
at infinity is (0 : 1 : −1). The point at infinity of the perpendiculars to BC then
is (SB + SC : −SC : −SB ) = (−a2 : SC : SB ). It follows that the equation of the
perpendicular bisector δA of BC is
x −a2 0
y SC 1 = 0,
z SB 1
With the help of this result, we can offer a variant of solution to the following
problem extracted from 3910 [2014 : 30 ; 2015 : 42]:
From the above equation of δA , we get cyclically the equations of δB and δC , the
perpendicular bisectors of CA and AB:
and
λ(a2 − b2 ) + (1 − λ)(αc2 − βc2 + γ(a2 − b2 )) = 0 (2).
Our second example gives a solution to problem 4313 [2018 : 71 ; 2019 : 93]:
that is,
(cSC − aSA )x + (ca2 + aSB )y = 0.
a c−b b−c
1
δ= · c−a b a−c
(b + c − a)(c + a − b)(a + b − c)
b−a a−b c
1
= · δ0 .
8(s − a)(s − b)(s − c)
Exercises
1. (Adapted from problem 11958 of The American Mathematical Monthly) Prove
the relations
a4 SA + b4 SB + c4 SC − 3SA SB SC = 2(a2 + b2 + c2 )F 2 = SA SB SC + a2 b2 c2
and deduce a condition on a, b, c for the nine-point centre N to lie on the circum-
circle of ∆ABC.
2. Use SA , SB , SC to show that O, H and the incenter I are collinear if and only
if the triangle ABC is isosceles.
3. Find the point at infinity of the perpendiculars to OI, where O and I are the
circumcentre and the incentre of a scalene triangle ABC.
4. If M1 = (x1 : y1 : z1 ), M2 = (x2 : y2 : z2 ) with x1 + y1 + z1 = x2 + y2 + z2 = 1,
show that
PROBLEMS
Click here to submit problems proposals as well as solutions, comments
and generalizations to any problem in this section.
a + b + c = xy + yz + zx,
x + y + z = abc.
.................................................................
Pour faciliter l’examen des solutions, nous demandons aux lecteurs de les faire parvenir
au plus tard le 15 mars 2019.
La rédaction souhaite remercier Rolland Gaudet, professeur titulaire à la retraite à
l’Université de Saint-Boniface, d’avoir traduit les problèmes.
SOLUTIONS
No problem is ever permanently closed. The editor is always pleased to consider for
publication new solutions or new insights on past problems.
Statements of the problems in this section originally appear in 2019: 45(6), p. 346–349.
Find
1
Å ã
lim+ + lim− I(a, b) .
a→0 a b→1
There were 15 correct solutions. We present the standard approach taken by most
of the solvers.
Note that
and
Now
2n − 3 4n2 − 9n + 4
lim− f (b) = + 4(n − 2) + 1 = .
b→1 n−1 n−1
Therefore
ï 2 ò "Å n−1
#
1 4n − 9n + 4 2n − 3 n−1
ã X
n−1
+ lim I(a, b) = − a +4 a ,
a b→1− n−1 n−1
k=2
whence
1 4n2 − 9n + 4
Å ã
lim+ + lim− I(a, b) = .
a→0 a b→1 n−1
Comment from the editor. This is essentially the solution supplied by all the
solvers. However, there were interesting aspects to the various manipulations.
While most used long division to find the cofactor of (x − 1)2 in the factorization
of
Pn (x) ≡ (2n − 3)xn+1 − (2n − 1)xn + 3x − 1,
and
Pn+1 (x) = xPn (x) + (x − 1)[2x(xn − 1) − (x − 1)]
to find the cofactor by an induction argument. However, Paul Bracken did not
need to bother with this, since, by some alchemy, he produced the antiderivative
1 2n − 3 2n − 1
ïÅ ã Å ã ò
n+1 n
x + x − 3x − 1 .
x(x − 1) n−1 n−1
Assume 4ABC is not a right triangle, as the problem is ill-posed in such a case.
Let O be the circumcenter of 4ABC and R its circumradius (see figure below).
First we show that A0 is the reflection of O over the side BC. Let M be the
midpoint of BC and A00 the reflection of O with respect to M . The relationship
between central and inscribed angles subtending the same arc gives us ∠BOC =
2∠A. Since the diagonals in quadrilateral BOCA00 are perpendicular and bisect
each other, BOCA00 is a rhombus. Thus,
It is easy to see (and well-known) that ∠BHC = 180◦ − ∠A. Extend the segment
AH until it intersects the circumcircle of 4BHC, and denote the intersection by
T . Since the points B, H, C, T are concyclic, we have
∠BT C = 180◦ − ∠BHC = ∠A.
Thus we have shown ∠BA00 C = 2∠BT C, so A00 must be the centre of the circum-
circle of 4BHC; that is, A00 = A0 . In particular, BOCA0 is a rhombus.
We thus have −−→0 −→ −−→0 −→ −−→ −−→
AA = AO + OA = −OA + OB + OC.
Similar arguments show that OAC 0 B and OCBA0 are rhombi, and we calculate
−−→0 −−→0 −−→0 −→ −−→ −−→ −→ −−→0
AA + BB + CC = OA + OB + OC = OA + OA . (1)
Next, we note that OA0 = 2OM = 2R cos(∠A). But from known triangle formulas
we have AH = 2R cos(∠A) as well, so OA0 = AH. Moreover, AH and OA0 are
both perpendicular to BC, so AH k OA0 , which means that the quadrilateral
−−→ −−→
AHA0 O is a parallelogram. This gives us OA0 = AH, which we substitute into
(1) to get
−−→0 −−→0 −−→0 −→ −−→ −−→
AA + BB + CC = OA + AH = OH.
or » » √
2 4 (x2 + xy + y 2 )(z 2 + zx + x2 ) ≥ 2 xy + x yz + xz.
Putting the pieces together, we get
» √
AB + AC ≥ 2 xy + x yz + xz ≥ 4DE,
Editor’s comments. Walther Janous observed that our problem has the following
immediate consequence:
If T is the Fermat-Torricelli point of a triangle with no angle larger
than 2π
3 , while D, E, F are the feet of the cevians through T , then the
perimeter of ∆DEF equals at most the semiperimeter of ∆ABC, with
equality if and only if both triangles are equilateral.
Since for integers j we have i2j = (−1)j and i2j+1 = (−1)j i, the real part of
(1 + i)4n in the binomial expansion is
2n Ç å Ç å n−1 Ç å
X
k 4n n 4n
X
k 4n
R= (−1) = (−1) +2 (−1)) .
2k 2n 2k
k=0 k=0
Solving for the summation in the above gives the required identity.
We received 28 submissions, all correct. Most of these are similar to each other
and we present the solution by Boris C̆olaković.
3
The given inequality is equivalent to ab + bc + ca + a+b+c ≥ 4. By the AM-GM
inequality, we have
Also, »
ab + bc + ca ≥ 3 3 (abc)2 = 3. (3)
Multiplying (2) and (3), inequality (1) follows, completing the proof.
Comment from the editor. For the difference between the two sides, Devis Alvarado
and Walther Janous obtained a fraction with the numerator
hÄ ä2 i hÄ ä2 i
a + b − √23 + (a − √13 )2 + (b − √13 )2 a + b + √23 + (a + √13 )2 + (b + √13 )2 .
Solution 3, built on ideas from Sefkat Arslanagić and Roy Barbara, independently.
If |x| + |y| > π/2, then at least one of |x| and |y| exceeds π/4 and the left side
exceeds 1. Since 0 ≤ |x + y| ≤ |x| + |y|, then
2 tan2 θ + cot2 2θ ≥ 1
Since
4 1 4t2 − 12t + 9 (2t − 3)2
+ −4= = ≥ 0,
t t(2 − t) t(2 − t) t(2 − t)
this, along with the foregoing inequalities, yields the result. Equality occurs if and
only if x = y and cos2 x = cos2 y = 3/4, if and only if x = y = ±π/6.
√ √ √
Finally, observe that F + 8 = ( F − 2)2 + 4 + 4 F ≥ 4 + 4 F to conclude the
proof.
We received 11 submissions, all of which were correct; we will sample two of the
variety of solutions.
Solution 1 is a composite of almost identical solutions submitted (independently)
by Marie-Nicole Gras, C.R. Pranesachar, and Titu Zvonaru.
Define P 0 and Q0 to be the feet of the perpendiculars from P and Q, respectively,
to the line BC. Since P N = N Q, it follows that the right triangles P N P 0 and
QN Q0 are congruent and, hence, P P 0 = QQ0 and P 0 N = Q0 N . The former implies
that the right triangles P P 0 B and QQ0 C are also congruent, because we have, in
addition, ∠P BP 0 = ∠ABC = ∠ACB = ∠QCQ0 . Thus BP 0 = CQ0 ; consequently,
the translation that takes B to P 0 will take C to Q0 , whence P 0 Q0 = BC. It
follows that
P 0N N Q0 P 0 Q0 BC
cos ∠P N M = = = = ,
PN NQ PQ PQ
and, therefore,
P Q cos ∠P N M = BC.
Similarly, we obtain RS cos ∠RM N = BC, and the desired conclusion follows.
~ = (0, t),
A ~ = (−1, 0),
B ~ = (1, 0),
C
where t > 0. We are given a point P on side AB, which means that
~ + (1 − λ)B
P = λA ~ = (λ − 1, tλ) and Q=C ~ + (C~ − A)s
~ = (s + 1, −st),
Ä ä
~ = s+λ , t(λ−s) ,
~ = 1 (P~ +Q)
for 0 < λ < 1 and s to be determined. Specifically, N 2 2 2
so that N is on BC if and only if s = λ. Consequently, we have
N = (λ, 0) and P~ − N
~ = (−1, tλ).
~ = µA
Similarly, when R ~ + (1 − µ)C
~ = (1 − µ, tµ), with 0 < µ < 1, we have
~ = (−µ, 0),
M
so that
~ −M
R ~ = (1, tµ) and ~ −N
M ~ = (−λ − µ, 0).
Finally, we must verify that
(P~ − N~ ) · (M
~ −N
~) ~ ~ ~ ~
~ (R − M ) · (N − M ) ,
|P~ − Q|
~ ~ − S|
= |R
|P~ − N
~ | · |M
~ −N
~| ~ −M
|R ~ | · |N
~ −M~|
which is easy because
|P~ − Q|
~ = 2|P~ − N
~ |, ~ − S|
|R ~ = 2|R
~ −M
~ |, ~ −N
|M ~ | = |N
~ −M
~|=
6 0,
and
(P~ − N
~ ) · (M
~ −N
~ ) = (R
~ −M
~ ) · (N
~ −M
~ ) = λ + µ.
Editor’s comments. Note that the restriction of the points P and R to the sides
AB and AC can be omitted — Janous’s argument shows that the result continues
to hold starting with any point P on the line AB and any point R 6= Q on the line
AC (because λ and µ are free to be assigned any real values as long as λ + µ 6= 0).
Since
n−2 Å ãk 1 1 2 n−1
X 1 2 3 − 3 3
= →1
k=0
3 3 1 − 32
and (yn )n≥1 converges, then (xn )n≥1 converges as well.