Académique Documents
Professionnel Documents
Culture Documents
CRUXv34n8 PDF
CRUXv34n8 PDF
MATHEMATICAL MAYHEM
Mayhem Problems
M369. Propose par l'Equipe de Mayhem.
Soit A(0, 0), B(6, 0), C(6, 4) et D(0, 4) les sommets d'un re
tangle.
Par le point P (4, 3), on tra
e d'une part une droite horizontale
oupant BC
en M et AD en N et d'autre part une droite verti
ale
oupant AB en Q et
CD en R. Montrer que AP , DM et BR passent toutes par le m^eme point.
M370. Propose par l'Equipe de Mayhem.
(a) Montrer que cos(A + B) + cos(A B) = 2 cos A cos B pour tous les
angles A et B .
(b) Montrer que cos C + cos D = 2 cos C + D CD
pour tous
cos
2 2
les angles C et D.
(
) Trouver la valeur exa
te de cos 20 + cos 60 + cos 100 + cos 140 ,
sans l'aide d'une
al
ulatri
e.
M371. Propose par Panagiote Ligouras, E
ole Se
ondaire Leonard
de
Vin
i, No
i, Italie.
Un segment AB de longueur 3
ontient un point C tel que AC = 2. On
onstruit d'un m^eme
ot^ e de AB deux triangles equilat
eraux
ACF et CBE .
Determiner
l'aire du triangle AKE si K est le point milieu de F C .
450
M372. Propose par l'Equipe de Mayhem.
Soit x un nombre reel
satisfaisant x3 = x + 1. Trouver des entiers a, b
et c de sorte que x = ax2 + bx + c.
7
.................................................................
Mayhem Solutions
r8 1 2 4 8 16 32 64
h8 64 32 16 84 4 2 1
r 9 10 12 16 24 40 72
h 72 40 24 16 12 10 9
V 5832 4000 3456 4096 6912 16000 46656
Winning positions for Anne: 1, 3, 5, 6, 7, 8, 10, 12, 14, 15, 16, 17, 19, 21,
23, 24, 25, 26, 28, 30, 32, 33, 34, 35, 37, 39.
Losing positions for Anne: 2, 4, 9, 11, 13, 18, 20, 22, 27, 29, 31, 36, 38, 40.
Therefore, Brenda wins for n = 36, 38, 40.
Also solved by JACLYN CHANG, student, Western Canada High S
hool, Calgary, AB.
See the Problem of the Month
olumn in [2007 : 15{17 for a similar problem with a
more detailed explanation.
3y 3 + 3
(b) Determine all integers y for whi
h 3y 2 + y 2
is an integer.
II. Solution by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, ON.
We show that the only integer solutions to part (a) are x = 1 and x = 3.
x3
Let f (x) = 3x 2
. Then f (0) = 32 , f (1) = 2, f (2) = 14 , and
f (3) = 0. Of these, only f (1) and f (3) are integers.
If x > 3, then f (x) is not an integer, sin
e 3x 2 > x 3 > 0 for
x3
x > 3 and so 0 < < 1.
3x 2
s+3
If x 1, let x where s 1. Then f (x) = f (s) = 3s
= s
+2
.
Sin
e 3s + 2 > s + 3 > 0 for s 1, f (s) is not an integer by a similar
argument so, f (x) is not an integer.
454
hen
e a = 13
5
or a = 2.
Therefore, the sequen
es are a = 135
, b = 26 5
, c = 95 , d = 32
5
and
a = 2, b = 4, c = 3, d = 7. Both sequen
es satisfy the given requirements.
Also solved by EDIN AJANOVIC, student, First Bosniak High S
hool, Sarajevo,
Bosnia and Herzegovina; JACLYN CHANG, student, Western Canada High S
hool, Calgary,
AB; RICHARD I. HESS, Ran
ho Palos Verdes, CA, USA; CAO MINH QUANG, Nguyen Binh
Khiem High S
hool, Vinh Long, Vietnam; KUNAL SINGH, student, Kendriya Vidyalaya S
hool,
Shillong, India; BILLY SUANDITO, Palembang, Indonesia; and TITU ZVONARU, Comane sti,
Romania. There was one in
orre
t and one in
omplete solution submitted.
The equation |x| + |y| = 0 has one integer solution only, namely
(x, y) = (0, 0).
Consider next |x| + |y| = k, for an integer k with 1 k n. We
an
remove the absolute values by splitting into four
ases:
Case 1. The integers x and y satisfy x + y = k, where x 0 and y 0.
This has solutions (k, 0), (k 1, 1), . . . , (1, k 1), (0, k), for a total of k + 1
solutions.
Case 2. The integers x and y satisfy x y = k, where x 0 and y < 0.
This has solutions (k 1, 1), (k 2, 2), . . . , 1, (k 1) , (0, k), for
a total of k solutions.
Case 3. The integers x and y satisfy x + y = k, where x < 0 and y 0.
This
ase is the same as Case 3, but with the roles of x and y swit
hed, so
there are a total of k solutions here as well.
Case 4. The integers x and y satisfy x y = k, where x < 0 and y < 0.
This has solutions , , , (k 2), 2 ,
1, (k 1) 2, (k 2) . . .
(k 1), 1 , for a total of k 1 solutions.
Also solved by RICARD PEIRO, IES \Abastos", Valen
ia, Spain. There were one in
orre
t
and two in
omplete solutions submitted.
OF 2 = AF 2 OA2
2 2 p !2
x + y2 x2 + y 2
=
2x 2
x4 + y 4 + 2x2 y 2 x2 + y 2
=
4x2 4
x4 + y 4 + 2x2 y 2 x4 x2 y 2
=
4x2
4 2 2
y +x y
= .
4x2
Therefore,
s p p
y 4 + x2 y 2 y 2 (y 2 + x2 ) y x2 + y 2
OF = = = ,
4x2 2x 2x
and p p
2y x2 + y 2 y x2 + y 2
EF = 2 OF = = .
2x x
In part (a), this yields
12 162 + 122 12(20)
EF = = = 15 .
16 16
Also solved by EDIN AJANOVIC, student, First Bosniak High S
hool, Sarajevo, Bosnia
and Herzegovina; JACLYN CHANG, student, Western Canada High S
hool, Calgary, AB (part
(a) only); RICHARD I. HESS, Ran
ho Palos Verdes, CA, USA; RICARD PEIRO, IES \Abastos",
Valen
ia, Spain; CAO MINH QUANG, Nguyen Binh Khiem High S
hool, Vinh Long, Vietnam;
BILLY SUANDITO, Palembang, Indonesia; LUYAN ZHONG-QIAO, Columbia International
College, Hamilton, ON; and TITU ZVONARU, Comane
sti, Romania.
457
Ian VanderBurgh
Here is a problem that might seem to be not very interesting initially,
but turns out to have a whole lot of unexpe
ted solutions.
Problem (2005 Canadian Open Mathemati
s 3 0 5 6 2
Challenge) In the grid shown, ea
h row has 2 5 0 1 y
a value assigned to it and ea
h
olumn has a 5 2 x 8 0
value assigned to it. The number in ea
h
ell 0 3 2 3 5
is the sum of its row and
olumn values. For 4 7 2 1 9
example, the \8" is the sum of the value as-
signed to the 3 row and the value assigned to the 4
olumn. Determine
rd th
Therefore,
3 + (5) + 2 + 8 + (9) 3 0 5 6 2
2 5 0 1 y
= (4) + (3) + x + 1 + (2)
5 2 x 8 0
= 3 + y + 2 + (2) + 3 , 0 3 2 3 5
4 7 2 1 9
or 1 = x 8 = y + 6. Thus, x = 7 and
y = 7.
Solution 2. Consider the rst two entries in row 1. From the labels above, we
have 3 = A + a and 0 = B + a. Subtra
ting these, we obtain the equation
3 = 3 0 = (A + a) (B + a) = A B .
Noti
e that whenever we take entries in
olumns 1 and 2 from the same
row, their dieren
e will always equal A B , whi
h is equal to 3. Similarly,
sin
e the dieren
e between the 0 and the 5 in the rst row is 5, then every
entry in
olumn 3 will be 5 greater than the entry in
olumn 2 from the same
row. In row 3, we see that x = 2 + 5 = 7.
Also, sin
e the dieren
e between the 6 and the 2 in the rst row is
8, then every entry in
olumn 5 is 8 less than the entry in
olumn 4 from the
same row. In row 2, we see that y = 1 8 = 7. Thus, x = 7 and y = 7.
0 1
Solution 3. Consider the sub-grid .
x 8
Sin
e the 0 is in row 2 and
olumn 3, then 0 = b + C . Similarly,
1 = b + D , 8 = c + D , and x = c + C .
But then 0 + 8 = (b + C) + (c + D) = (c + C) + (b + D) = x + 1, or
x = 7.
In a similar way, by looking at the sub-grid 18 y0 we
an show that
1 + 0 = y + 8, or y = 7. Thus, x = 7 and y = 7.
So there are three dierent but neat solutions to the problem. One
footnote to the nal solution is that in fa
t, in any sub-grid of the form
p q
r s
, we must have p + s = q + r. Can you see why?
Another interesting point about this problem is that it might be easier
for those who know less! If we repla
ed the x and the y with \?" and gave
it to someone who didn't know a lot of algebra, they might nd the answers
faster than those of us who go immediately to algebra. Sometimes, the extra
ma
hinery that we have
an get in the way.
As 2008 draws to a
lose, the Mayhem Editor has three enormous sets of
thanks to oer. First, to the Mayhem Sta, espe
ially to Monika Khbeis and
Eri
Robert, for all of their help over the past year. Se
ond, to the Editor-
in-Chief of CRUX with MAYHEM, Va
lav Linek, for all of his help and en-
ouragement over the past year (as well as for his sharp eyes!). Third, to
the Mayhem readership for their support. Please keep those problems and
solutions
oming!
459
Team Leader at the IMO for
olle
ting them for our use.
47th INTERNATIONAL MATHEMATICAL OLYMPIAD
SLOVENIA 2006
Problems Proposed But Not Used
Contributing Countries. Argentina, Australia, Brazil, Bulgaria, Canada,
Colombia, Cze
h Republi
, Estonia, Finland, Fran
e, Georgia, Gree
e, Hong
Kong, India, Indonesia, Iran, Ireland, Italy, Japan, Republi
of Korea,
Luxembourg, Netherlands, Poland, Peru, Romania, Russia, Serbia and
Montenegro, Singapore, Slovakia, South Afri
a, Sweden, Taiwan, Ukraine,
United Kingdom, United States of Ameri
a, Venezuela.
Problem Sele
tion Committee. Andrej Bauer, Robert Gerets
hlager, Geza
Kos,
Mar
in Ku
zma, Sventoslav Sav
hev.
Algebra
A1. Given an arbitrary real number a0 , dene a sequen
e of real numbers
a0 , a1 , a2 , . . . by the re
ursion
ai+1 = ai {ai } , i 0,
for some nite set J of positive integers. Prove that there exist real numbers
, , m, and M with the property that an ordered pair of non-negative
integers (x, y) satises the inequality
m < x + y < M
A5. Let a, b, and c be the lengths of the sides of a triangle. Prove that
b+ca c+ab a+bc
+ + 3.
b+ c a c+ a b a+ b c
Combinatori
s
C1. There are n 2 lamps L1 , L2 , . . . , Ln arranged in a row. Ea
h of them
is either on or o. Initially the lamp L1 is on and all of the other lamps are
o. Ea
h se
ond the state of ea
h lamp
hanges as follows: if the lamp Li
and its neighbours (L1 and Ln ea
h have one neighbor, any other lamp has
two neighbours) are in the same state, then Li is swit
hed o; otherwise, Li
is swit
hed on. Prove that there are
(a) innitely many n for whi
h all of the lamps will eventually be o,
(b) innitely many n for whi
h the lamps will never be all o.
C2. Let S be a nite set of points in the plane su
h that no three of them
are on a line. For ea
h
onvex polygon P whose verti
es are in S , let a(P )
be the number of verti
es of P , and let b(P ) be the number of points of S
whi
h are outside of P . Prove that for every real number x
xa(P ) (1 x)b(P ) = 1 ,
X
where the sum is taken over all
onvex polygons with verti
es in S . (A line
segment, a point, and the empty set are
onvex polygons of 2, 1, and 0
verti
es, respe
tively.)
461
E
G2. Let ABCDE be a
onvex pen- .........................
.....p
....................................
tagon su
h that A ...p.......................................................
.....
...
... ..
... ..
.. ...
......................... ... .
.... ...... ....................... ... ...
CAD = DAE ;
.
...
BAC = ...
. ....
..
...
........
........
........ ...
...
...
...
...
....
ACD = ADE .
........ .
.. ........ .
. .
=
..
ABC
... ........ ..
.. ..
...
........ ...
.
......... ...
...
.. ...
..
.. P .... .. .. .. ..................p
.. ... ............... ..
. .
...
The diagonals BD and CE interse
t at
... .. .. .. .. ......
.. . .. .. .. .. ....... p.... ...... D
.. .. .. ... .. .. .. ..
...p..................... .. .. .. .. .. .. .. ....... ..
.........
P . Prove that the line AP bise
ts the
.
.
B ............. .. ..
. ........
............. ....... .....................
side CD.
............. ... ...........
......p...
C
qJ
... ... .. ...
Cq .. .
. ...
..... .
. .
.
.
. ..
.... .. .
.. .
. . .. ..... ..... ...... .
..
............................................................................................................................................................................................................................................
and AEB1 .
q q q q
A D B C1
qF
... ... ..
... ... ............................
. . ..... ........ ......
A q qB
.
.............................................................................................................................................................................................................................
q
that the lines AO1 , BO2 , EF , and t ..
... ..
.
... ..
. ...
.. ..... ...
are
on
urrent.
..
... .... ....
....
.
463
BC , CA, AB of the
ir
um
ir
le of
. .
.... .
.
.... ..
. . .... .
.
. .... .
. .. . ......
... ..
.... .. .. ..
... ...
.... ... .. ..
rC
........
... ...................................................................................
D and a
ir
le passing through B and
.....
.....
. .. ...................
...
. . .... .....
. . ... ........ .........
C are externally tangent at the point
.. . .. ...
...
.. ... ... ..
......
... ....
... .
. ... ....
P in the interior of the quadrilateral.
.....
P r
....
. ... ....
... ...
. .
..... ... ....
... . .....
Prove that if P AB + P DC 90
... .
. ... ... ......
... .
. .
.. ....
..... ..... .....
. . . . . r
... . ... ........................ ...........
.. ....
B
and P BA + P CD 90 , then
.... . .
. .
.... . .
.
... ......... ... . .
..
................... . .
. ...
..... ..
.............. ............................
........ ................
AB + CD BC + AD .
..r
............
A
G8. Points A1 , B1 , C1 are on the sides BC , CA, AB of a triangle ABC , re-
spe
tively. The
ir
um
ir
les of triangles AB1 C1 , BC1 A1 , CA1 B1 interse
t
the
ir
um
ir
le of triangle ABC again at points A2 , B2 , C2 , respe
tively
(that is, A2 6= A, B2 6= B , C2 6= C ). Points A3 , B3 , C3 are symmetri
to A1 , B1 , C1 with respe
t to the mid-points of the sides BC , CA, AB
respe
tively. Prove that the triangles A2 B2 C2 and A3 B3 C3 are similar.
.................... ................................................... A
..............
........... ....... ............................
......... .................. r .
.. ...........................
. ................................
..... .........................................
.
.................
.. .
A2............. . . ............. . .. . ... ..... .......
...
. .
r ...
....... . .. . ..... ... ..... .......
... ... ......
. .
..... . . ... .... .....
. . . . . ... ... ....
.... ...
... ... . . . .... .. .. ...
...
............ B1 .....
.
.
.. ... . .. . . .... . . ... ...... ...
. .......................... .......
. ....... . r
.... ... . . . . . ....... . . ...
.. . . ..
.
.............. ...
.
. .. .. .....
. . . .
. .. ..
.. ... ... ..... ... .. .... ..
...
..
...
...
...
... . . . ..... .....
....
.
.. .. ....
.. .... ...... ....
..
.... .. .....
. .
... .
.
. ... .... .....
.. C1 .......................................
. . ... .... ....
..
. ...
. r
.......... .......... .. ..
. ... ... ...
.... ................. .... ...... .. .. ... .......
..... .... ..
A
... ........ ... .... .. ...
... .......
........... ... 1
..................................................................................................................................................................................
. .. . .. ..
B....... rC
. .
.r . .... r ...... ... .
....... . .
...... ....... ......
..... ..... ....... .. .. .. . . . .....
. . ........ .... ....... ....
..... .... .........
..... .. .
.. . .
...... . ........ .
.....
. .
................ ..
... .. r .... ................ .
......
... ... ..........................
... . .. .. .....
... ..... .. ... ....
... ... .. .. ...... .
..
.......
.... ...... .... r
.. ....
......... C2
... ..... .....
..... .... ......
..... ... ..... .......
........ ..... ...... ......... ..........
.................. ...................... ............. ..
. .
. ...................
r .............. ................................ ..
.. .
.....
B2 .......................
..
.......
.......
........
..........
............ ...... . . ...........
........................ .....
........................................
464
Number Theory
N1. Given x (0, 1) let y (0, 1) be the number whose n digit after the
th
de
imal point is the (2 ) digit after the de
imal point of x. Prove that if x
n th
N4. Let a and b be relatively prime integers with 1 < b < a . Dene the
weight of an integer c, denoted by w(c), to be the minimum possible value
of |x| + |y| taken over all pairs of integers x and y su
h that
ax + by = c .
...... .
....
.. .......................................................................
........
....
..
2 ..
..
..
..
.......
AB = AC , we have ACB = 2 .
... ....................
...
. ..... .....
.. ........... .... ...
.......... .... .........
A B
......
......................................................................................................................................................................................................................................................
Also, BC is tangent to the
ir
le and
.. .............. .......... ..
..... .............
.............. .............. ..
... ...
.. .............. .............. ...
AB is a
hord, hen
e D AB = .
..... .............. ............. ..
.. ............................. ...
... ..
..
Let ABO = . O
... .
.
.. ..
466
As an indu
tion step, assume that f 2 (an ) 2nf (1) for some n 1. Then
1
f 2 (an+1 ) = f 2 an +
an
1
f 2 (an ) + 2f (1) + f 2
an
f (an ) + 2f (1) 2(n + 1)f (1) ,
2
ompleting the indu
tion. Hen
e f 2 (an ) 2nf (1) for all n 1,
ontra-
di
ting the fa
ts that f (1) > 0 and f is bounded.
And to
omplete our les for the Corner, we look at a problem of the
Taiwan Mathemati
al Olympiad, Sele
ted Problems 2005, given in [2008:
21{22.
1. A ABC is given with side lengths a, b, and c. A point P lies inside
ABC , and the distan
es from P to the three sides are p, q , and r , respe
-
tively. Prove that
a2 + b2 + c2
R ,
18 3 pqr
where R is the
ir
umradius of ABC . When does equality hold?
Solved by Arkady Alt, San Jose, CA, USA; Mi
hel Bataille, Rouen, Fran
e;
and George Tsapakidis, Agrinio, Gree
e. We give Bataille's write-up.
Let F denote the area of ABC . We have the well-known relation
abc
2F =
2R
, but also from the denition of p, q, and r we have the equation
2F = ap + bq + cr . Thus, the proposed inequality is equivalent to
abc a2 + b2 + c2
2(ap + bq + cr) 18 3 pqr
or
(a2 + b2 + c2 )(ap + bq + cr) 9abc 3
pqr . (1)
By the AM{GM Inequality,
3
and abcpqr ,
p
a2 + b2 + c2 3 a2 b2 c2 ap + bq + cr 3 3
That
ompletes the Corner for this number, and this Volume. As Joanne
Canape, who has been translating my s
ribbles into beautiful LTEX has de-
A
ided that twenty-plus years is enough, I want to thank her too for all the
help over the time we've worked together.
468
BOOK REVIEW
6{fold, 3{fold, and 2{fold gyrational points but no re
e
tions or mira
les;
222 for a pattern with two kinds of kaleidos
opi
points where a pair of
mirrors interse
t at right angles, and one point where there is a half-turn
symmetry but no mirror.
.......................................................................................................................................................................................................................................
... ... ... ...
.... .... .... ....
... ... ... ...
.... .... .... ....
.... .... .... ..
..........................................................................................................................................................................................................................................
..... ..... ..... ..... .....
.... .... .... .... ....
... ... ... ... ...
.... .... .
. .
..
.
. ....
.............................................................................................................................................................................................................................................
. . .
. . . .
..
....
..
....
.
.
. .
...
.
.
...
.
.... .................................................................... .....
...
.. ... 2 .. ...
......................................................................................................................................................................................................................................................
...
..
2
q ..
.... .... . ..
. ....
.... .... ......................................................... ..... ....
.... .... .... .... ....
....
.
.
....
.
. 2 .
. .
.......................................................................................................................................................................................................................................
.
.
.
..
.
.
....
... ... .
. .
....
.
....
.... .... . . .
... ... .... .... ....
.... .... .... ....
.. .. .. ..
.............................................................................................................................................................................................................................................
..
..... ..... ...
. ..... .....
.... .... .
... ..
. ....
... ... .... ...
.... .... .... .... ....
.
. .
. .
..............................................................................................................................................................................................................................
. .
.
632 222
Unlike most other notation systems that have been devised for des
rib-
ing plane symmetry, these orbifold signatures
an also be used to des
ribe
frieze patterns and spheri
al patterns. (We learn in Part III that they work
equally well for des
ribing hyperboli
patterns.) But how does one know that
the resulting lists of 17 signatures for plane patterns, 7 signatures for frieze
patterns, and 14 signatures for spheri
al patterns are
orre
t and
omplete?
There is a \Magi
Theorem" that assigns a
ost to every symbol in the sig-
nature in su
h a way that plane patterns and frieze patterns
ost exa
tly $2
while spheri
al patterns
ost a bit less. That theorem tells us immediately
whi
h signatures are feasible. To establish the Magi
Theorem, a pattern
on the surfa
e is asso
iated with a folded surfa
e they
all an orbifold. The
orbifold is obtained by identifying points related by a symmetry of the pat-
tern (whereby points of an orbit are folded atop of one another so that a
single representative point of every orbit lives on the orbifold). This sounds
a bit s
ary, but the authors manage to explain the details in a gentle way
using suitable pi
tures and simple examples. They then state the Classi
a-
tion Theorem for Surfa
es and provide Conway's elementary and intuitive Zip
proof. They also prove that these surfa
es
an be distinguished using Euler's
formula (involving the numbers of verti
es, edges, and fa
es of a suitable map
on the surfa
e), whi
h they also prove. Sin
e the orbifolds are easily
lassied
using Euler's formula, the
orresponding patterns are thereby
lassied.
Remarkably, all the proofs should satisfy the professional mathemati-
ian even though they are dire
ted at an elementary audien
e. The authors
a
hieve this feat by repeatedly redu
ing te
hni
al di
ulties down to prob-
lems that are postponed to the following
hapter. This way they present
one
on
ept at a time, as
ompared to the typi
al textbook's initial barrage
of poorly motivated denitions and lemmas. Their proofs are every bit as
brilliant as their notation. The illustrations are not just beautiful, but they
470
have been
arefully
hosen to
larify the exposition. I really appre
iated
the authors' de
ision to repeat pi
tures that they require for illustrating new
ideas | instead of making the reader turn ba
k to a pi
ture on an earlier
page, they reprodu
ed a smaller version of it whenever needed. The authors
learly have fun
oining whimsi
al new words; their terminology will not ap-
peal to everybody, but the informal nature of their dis
ussions makes for
enjoyable reading. I rather liked the word mira
le in pla
e of the standard,
but awkward and misleading term glide re
e
tion; however I saw little need
for gyrational in pla
e of rotational or wandering in pla
e of translation. We
will have to wait to see whi
h words
at
h on.
What I have des
ribed so far is the
ontent of the 116 pages of the
rst nine
hapters. Originally, a
ording to the prefa
e, this was all that
the authors had intended to write. But they de
ided it was worthwhile to
extend the signature to
olour symmetry, and the book grew from there.
For a
areful reading of Part II the reader needs some group theory and
a bit of mathemati
al maturity. The authors' main goal for this part is to
present their analysis and notation for
olour symmetry. They enumerate the
p{fold
olour types for plane, spheri
al, and frieze patterns (for all primes
p). The
omplete
lassi
ations appear in a book for the rst time. Along
the way the authors show how their orbifold notation
orresponds to previ-
ous
lassi
ation systems, whi
h gives them the opportunity to dis
uss the
short
omings of those systems. Also in this part, they enumerate the iso-
hedral tilings of the sphere and plane, and they extend to n = 2009 the
Bes
he-Ei
k-O'Brien table of the number of abstra
t groups of ea
h order n.
The informative lists of Part II
an probably be understood by readers
who might not take an interest in the a
ompanying te
hni
al arguments.
Similar
omments apply to Part III, whi
h the authors expe
t to be
ompletely
understood only by a few professional mathemati
ians. Still, as they point
out, mu
h of Part III
an protably be explored by other readers, while many
more will enjoy inspe
ting the pretty pi
tures. Here, among other things, the
authors dis
uss hyperboli
groups and Ar
himedean polyhedra and tilings;
they list the 219
rystallographi
spa
e groups (and explain why
hemists
distinguish 230 groups), and they provide a
omplete list for the rst time in
print of the 4{dimensional Ar
himedean polytopes. Apparently they
ould
have kept writing, but they de
ided to leave something for the rest of us to
do. Their nal words are, \A universe awaits | Go forth!"
The ordering of these lemmas indi
ates how Theorem 1 was found. First
the
ases of d = 7 and d = 11 were settled and that led to the general result
of Lemma 1. It followed that the only
andidates for attainability had the
form 2a 3b 5c . On
e the powers of 2, 3, and 5 were resolved (Lemma 2), the
andidate list was redu
ed to the 45 divisors of 3600 = 16 9 25. Resolving
the situation for those divisors, with some
omputer help, led to Lemmas 3
and 4. Finally, the
omputer sear
hes were eliminated and the whole thing
was redone by hand. Theorem 1 follows from the lemmas be
ause Lemmas
3 and 4 settle the status of all 45 divisors of 3600.
473
Sin
e d > 10, d
annot divide B A. Now suppose that 3 divides d and
d > 81. Suppose the value of w , in the formula just given, is a multiple of d.
Then multiplying by 9 yields 9(B A) + A (10e 1) = 9Kd, and hen
e d
divides 9(B A). However, A 6= B and 81 9(B A) 81, so d > 81
annot divide 9(B A), a
ontradi
tion.
There remain the
ases where 3 divides d and 11 d 81, namely
d {21, 27, 33, 39, 51, 57, 63, 69, 81}. Suppose that d is one of these
but d 6= 21, 27, 81; then ordd (10) = ord3d (10). This means that from
B A + A (10e 1) /9 = Kd, we have 9(B A) + A (10e 1) = 3K(3d),
when
e 3d divides 9(B A). Thus, d divides 3(B A), whi
h means that
d 27, a
ontradi
tion.
475
Stan Wagon
Ma
alester College
St. Paul, MN, USA
wagon@macalester.edu
478
on One Parameter
Iesus C. Diniz
In this arti
le we will
al
ulate the following limit of an improper inte-
gral that depends on one parameter R+
Z
exp K(x + l)n Knxn1 dx ,
lim
0+ 0
where vn (1) is the volume of the n{dimensional unit ball, is the Poisson
intensity, l is the distan
e between two distinguished points in Rn , and r
is the distan
e from the rst point to the
losest o
urren
e in the Poisson
point pro
ess. We shall show that this limit is equal to 1.
Proposition For all positive real numbers K and l, and for ea
h positive in-
teger n we have
Z
exp K (x + l)n Knxn1 dx = 1 .
lim
0+ 0
whi
h yields
Z
1
exp (w n ) w n1k dw
lK n
Z
k
exp z n z n1k dz
= n
1
(ln K) n
Z
exp z n z n1k dz . (2)
k
< n
0
It now su
es for us to show that the last integral in (2) is nite for
ea
h k {1, 2, . . . , n 1}.
Setting Z 1
C = exp (z n ) z n1k dz
0
1
= C + ,
ne
whi
h is a nite number. This
ompletes the proof.
Acknowledgments
This work was supported by FAPESP grant 0415864-1.
The author also thanks J.C.S. de Miranda for many dis
ussions about
this problem.
Iesus C Diniz
Institute of Mathemati
s and Statisti
s
University of S~ao Paulo
S~ao Paulo, Brazil
iesus@usp.br
481
Je Babb
Suppose that a ve
tor is an
hored at the origin and lies along the posi-
tive x-axis. Consider rotating the ve
tor
ounter
lo
kwise about the origin
through an angle A, with 0 < A < . Consider a parti
le of mass m whi
h
is initially at rest and then slides, under gravity and without fri
tion, from a
starting point on the in
lined ve
tor down towards the origin. Let DA denote
the distan
e of the starting point from the origin. For ea
h value of A, sup-
pose that DA is
hosen to ensure that the parti
le requires exa
tly T se
onds
to rea
h the origin. Determine the
urve
hara
terized by the starting points
of the parti
les.
For the parti
le under
onsideration, let dA (t) be the distan
e travelled
along the ve
tor at time t, vA (t) = dA (t) be the velo
ity along the ve
tor at
time t, and let aA (t) = vA
(t) be the a
eleration along the ve
tor at time t.
Note that by denition, DA = dA (T ).
If aA (t) is some
onstant K , then
K 2
dA (t) = t . (1)
2
This may be
onrmed by integrating aA (t) twi
e with respe
t to time and
applying the initial
onditions dA (0) = 0 and vA (0) = 0 to obtain zero for
both
onstants of integration.
Sin
e the parti
le is sliding down a fri
tionless in
line in the Earth's
gravitational eld, the
omponent of a
eleration along the in
line is
K = g sin A, where g is the a
eleration due to gravity at the Earth's surfa
e.
If the des
ent time is xed at T se
onds, then
g
DA = dA (T ) = T 2 sin A . (2)
2
A point (r, ) in polar
oordinates may be expressed in Cartesian
oordinates
as (x, y), where x = r cos and y = r sin . Consider the following equa-
tion, whi
h is expressed in polar
oordinates as
r = 2c sin , (3)
where r > 0 and 0 < < . Multiplying both sides of equation (3) by r
yields
r 2 = 2cr sin (4)
Copyright c 2008
Canadian Mathemati
al So
iety
Crux Mathemati
orum with Mathemati
al Mayhem, Volume 34, Issue 8
482
T .
.. .
.
.
.... ..
.
.
....
...
.... ...
. ...
.. ...
4 . . ...
PROBLEMS
Toutes solutions aux problemes dans
e numero doivent nous parvenir au plus
tard le 1er juin 2009. Une etoile
() apres le numero indique que le probleme a et
e
soumis sans solution.
Chaque probleme sera publie dans les deux langues o
ielles du Canada
(anglais et fran
ais). Dans les numeros 1, 3, 5 et 7, l'anglais pre
edera
le fran
ais,
et dans les numeros
2, 4, 6 et 8, le fran
ais pre
edera
l'anglais. Dans la se
tion des
solutions, le probleme
sera publie dans la langue de la prin
ipale solution present ee.
La reda
tion
souhaite remer
ier Rolland Gaudet, de College universitaire de
Saint-Bonifa
e, Winnipeg, MB et Jean-Mar
Terrier, de l'Universite de Montreal,
d'avoir traduit les problemes.
alors A2007 + B 2007 + C 2007 + D2007 = O, ou O est la matri
e nulle de taille
2 2.
holds for ea
h positive integer n, where x is the greatest integer not ex-
eeding x.
488
SOLUTIONS
3229. [2007 : 170, 172; 2007 : 179{181 Proposed by Mihaly Ben
ze,
Brasov, Romania.
(a) Let x and y be positive real numbers, and let n be a positive integer.
Prove that
n n ni n
1
(n + 1)2 .
X X X
n k
(x + y) n nk k n+1+2 n
k=0 k
x y i=1 k=0 k+i
Q! = q1 !q2 ! qk ! ;
Proof. If P (X) is identi
ally zero, then there is nothing to prove, so we as-
sume at least one
oe
ient cQ is not zero. Note that P (x) has a minimum
value, sin
e P (X) is
ontinuous on and tends to innity as any of the
xi approa
hes 0. Suppose that the minimum o
urs at a point with at least
two unequal
oordinates. Without loss of generality (due to the symmetry of
P (X)) we may assume that x1 > x2 . We will show that by slightly de
reas-
ing x1 and slightly in
reasing x2 (while keeping all other variables and the
sum x1 + x2 un
hanged) the value of P (X) will be
ome smaller,
ontrary to
our assumption. Fixing x3 , x4 , . . . , xn
auses P (X) to be
ome a symmetri
fun
tion of two variables
Aj,s
,
X
F (u, v) = P (u, v, x3 , . . . , xn ) =
j+sn
uj v s
d2 F dF uv
Hen
e, dt2
> 0. Sin
e
dt
= 0 when u = v (this o
urs when t =
2
),
dF
itfollows that dt < 0 when t = 0. We have obtained a
ontradi
tion by
assuming x1 > x2 at a point a
hieving the minimum. This proves that the
minimum o
urs when all the xi are equal.
It follows that the minimum sought in part (b) is
i1 !i2 ! . . . ik !
.
X
kn
i1 ++ik =n
n!
i1 ,...,ik 0
where the rst equality follows Theorem 1 and the last expression is the minimum obtained
by Bataille [2007 : 179{181. He notes that the rst equality yields a minimum of at least
2n+1 ,
onsiderably improving the lower bound of (n + 1)2 if n > 4. He observes that if
bi = ni xni yi , then by the AM{HM Inequality
1 X 1 1 1 X (x + y)n
bi = ,
n+1 bi n+1 n+1
hen
e (x + y)2 b1 (n + 1)2 , whi
h yields a qui
k proof of part (a).
P
i
Sadov
omments that the fun
tion P (X) in Theorem 1 is S
hur-
onvex, referring to [1
for the denition of this term and appli
ations. He indi
ates that the AM-GM Inequality and
Pthe
AM{HM Inequality
an be obtained by taking P (X) = (x1 x2 xn )1 and P (X) = xi
in Theorem 1, respe
tively.
He mentions that parti
ular
ases (and other theorems of a more general nature) of
Theorem 1
an be found in [2, Chapter 3, Se
tion G, Examples G.1.k and G.1.m; though he
believes that Theorem 1 is present somewhere in the existing literature.
Finally, he refers to [3, Se
tion 2.18, for a treatment of (the related) Muirhead's
Inequality.
Referen
es
[1 M.L. Clevenson and W. Watkins, Majorization and the Birthday Inequality, Math.
Magazine, vol. 64, No. 3 (1991), pp. 183{188.
[2 A. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Appli
ations,
A
ademi
Press, 1979.
[3 G.H. Hardy, J.E. Littlewood, and G. Polya, Inequalities, Cambridge University Press,
1952.
4b (a b)2
N , .
a+b a+b
3(u2 v 2 ) a2
2
S = (cos 2) + av +b
2 2
3(u2 + v 2 ) a2
+ (sin 2)(3uv au) + av + + b2 .
2 2
In both
ases, the two solutions are symmetri
about the
entroid of the
triangle; in the rst
ase, the two points lie on the median through A and
in the se
ond
ase the two points lie on a line parallel to BC and passing
through the
entroid of ABC .
Also solved by GEORGE APOSTOLOPOULOS, Messolonghi, Gree
e; ROY BARBARA,
Lebanese University, Fanar, Lebanon; CHIP CURTIS, Missouri Southern State University,
Joplin, MO, USA; FRANCISCO JAVIER GARC I A CAPITAN,
IES Alvarez Cubero, Priego de
Cordoba,
Spain; WALTHER JANOUS, Ursulinengymnasium, Innsbru
k, Austria; V ACLAV
KONECN Y, Big Rapids, MI, USA (2 solutions); SKIDMORE COLLEGE PROBLEM SOLVING
GROUP, Skidmore College, Saratoga Springs, NY, USA; GEORGE TSAPAKIDIS, Agrinio, Gree
e;
PETER Y. WOO, Biola University, La Mirada, CA, USA; TITU ZVONARU, Comane
sti, Romania;
and the proposer.
3292. [2007 : 485, 488 Proposed by Mihaly Ben
ze, Brasov, Romania.
Let a, b, c, and d be arbitrary real numbers. Show that
11a2 + 11b2 + 221c2 + 131d2 + 22ab + 202cd + 48c + 6
98ac + 98bc + 38ad + 38bd + 12a + 12b + 12d .
Then f (a) < 0, and the leading
oe
ient of f is positive, hen
e f has two
distin
t real roots; that is, the dis
riminant of f is positive. By
omputing
the dis
riminant, we nd p2 44q = 120(c+6d1)2 0, a
ontradi
tion.
Also solved by APOSTOLIS K. DEMIS, Varvakeio High S
hool, Athens, Gree
e; MICHEL
BATAILLE, Rouen, Fran
e; CHIP CURTIS, Missouri Southern State University, Joplin, MO, USA;
RICHARD I. HESS, Ran
ho Palos Verdes, CA, E-U; WALTHER JANOUS, Ursulinengymnasium,
Innsbru
k, Austria; KEE-WAI LAU, Hong Kong, China; JOEL SCHLOSBERG, Bayside, NY, USA;
STAN WAGON, Ma
alester College, St. Paul, MN, USA; PETER Y. WOO, Biola University, La
Mirada, CA, USA; and the proposer.
495
3293. [2007 : 485, 488 Proposed by Mihaly Ben
ze, Brasov, Romania.
Prove that
9k + 2
n arcsin
27k + 54k 2 + 36k + 8
3
= 3n .
Y
1
k=1 arctan
3k + 1
we obtain
9k + 2
sin1
27k3 + 54k2 + 36k + 8
!
9k + 2
= sin1 p = sin1 (sin 3) = 3 ,
(3k + 2)3
3
and it follows that Pk =
= 3.
Also solved by GEORGE APOSTOLOPOULOS, Messolonghi, Gree
e; SEFKET
ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; DIONNE BAILEY,
ELSIE CAMPBELL, CHARLES DIMINNIE, and KARL HAVLAK, Angelo State University, San
Angelo, TX, USA; ROY BARBARA, Lebanese University, Fanar, Lebanon; CHIP CURTIS,
Missouri Southern State University, Joplin, MO, USA; OLEH FAYNSHTEYN, Leipzig,
Germany; OLIVER GEUPEL, Bruhl, NRW, Germany; SALEM MALIKIC, student, Sarajevo
College, Sarajevo, Bosnia and Herzegovina; HENRY RICARDO, Medgar Evers College
(CUNY ), Brooklyn, NY, USA; JOEL SCHLOSBERG, Bayside, NY, USA; GEORGE TSAPAKIDIS,
Agrinio, Gree
e; PETER Y. WOO, Biola University, La Mirada, CA, USA; TITU ZVONARU,
Comane
sti, Romania; and the proposer.
496
3294. [2007 : 486, 488 Proposed by Mihaly Ben
ze, Brasov, Romania.
For all positive integers m and n, show that
m(m + 1)n2 (n + 1)2 (2n2 + 2n 1) n(n + 1)m2 (m + 1)2 (2m2 + 2m 1)
is divisible by 720.
Solution by Chip Curtis, Missouri Southern State University, Joplin, MO,
USA.
Let f (k) = k(k + 1) 2k2 + 2k 1 . Write
= m (m + 1) n2 (n + 1)2 2n2 + 2n 1
A (m, n)
n (n + 1) m2 (m + 1)2 2m2 + 2m 1
= mn (m + 1) (n + 1) [f (n) f (m)] .
(a) Divisibility by 16. The residues of f (n) modulo 4 are given in the fol-
lowing table.
n (mod 4) 0 1 2 3
f (n) (mod 4) 0 2 2 0
(b) Divisibility by 9. The residues of f (n) modulo 9 are given in the next
table.
n (mod 9) 0 1 2 3 4 5 6 7 8
f (n) (mod 9) 0 6 3 6 6 6 3 6 0
On the other hand, there exists t1 R su
h that u(t) < L + for all
t > t1 . Sin
e et > 0, let M > 0 be su
h that K M et < L + . We
1 1
while if x > M and t > t1 , then u(t) xet < u(t) < L + .
Therefore, for x > M we have L 2 < g(x) < L + 2, hen
e
lim g(x) = L.
x
Finally, writing S(v) = sup {u(t) : t > v} and making two
hanges of
variable in the limit yields
lim S ln(1/x) = lim S(ln y) = lim S(z) = L .
lim f (x) =
x0+ x0+ y z
+ a5 c3 + c2 b + cb2 + b3
499
(c b) c4 b4 a4 + a4 (a b) c3 + c2 b + cb2 + b3
=
(c b)(b a) c4 b3 + b2 a + ba2 + a3
=
a4 c3 + c2 b + cb2 + b3
(c b)(b a) b3 c4 a4 + cb2 a c3 a2
=
+ c2 ba2 c2 a2 + c3 a3 (c a)
(c b)(b a)(c a) b3 c3 + c2 a + ca2 + a3
=
+ cb2 a c2 + ca + a2 + c2 ba2 (c + a) + c3 a3 .
P W
Hen
e, Q
= 2 2 2,
a b c
where
b3 c3 + c2 a + ca2 + a3 + cb2 a c2 + ca + a2
W =
+ c2 ba2 (c + a) + c3 a3 .
3bc 2 b2 c2 1 .
p
For x 1, let y = 3x 2 x2 1. Then y is positive and from
(y 3x)2 = 4(x2 1) we get 5x2 6xy + y 2 + 4 = 0. Sin
e x is real, the
dis
riminant of the quadrati
polynomial above must be non-negative.
Thus,
(6y)2 20(y 2 + 4) 0, or 16y 2 80 0, from whi
h we
obtain y 5. The result now follows by setting x = bc.
Also solved by GEORGE APOSTOLOPOULOS, Messolonghi, Gree
e (two solutions);
SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; MICHEL
BATAILLE, Rouen, Fran
e; ROY BARBARA, Lebanese University, Fanar, Lebanon; CHIP
CURTIS, Missouri Southern State University, Joplin, MO, USA; APOSTOLIS K. DEMIS,
Varvakeio High S
hool, Athens, Gree
e (two solutions); OLEH FAYNSHTEYN, Leipzig,
Germany; OLIVER GEUPEL, Bruhl, NRW, Germany; RICHARD I. HESS, Ran
ho Palos Verdes,
CA, USA; V ACLAV KONECN Y,
Big Rapids, MI, USA; SOTIRIS LOURIDAS, Aegaleo, Gree
e;
PANOS E. TSAOUSSOGLOU, Athens, Gree
e; PETER Y. WOO, Biola University, La Mirada,
CA, USA; KONSTANTINE ZELATOR, University of Toledo, Toledo, OH, USA; TITU ZVONARU,
Comane
sti, Romania; and the proposer. There was one in
orre
t solution submitted.
From
q the proof given above, it is easy to dedu
e that equality holds if and only if b = c
and a = 4 45 , in whi
h
ase A = cos1 23 48.19 . This was pointed out by Barbara,
3299. [2007 : 487, 489 Proposed by Vi
tor Oxman, Western Galilee Col-
lege, Israel.
Given positive real numbers a, b, and wb , show that
(a) if a triangle ABC exists with BC = a, CA = b, and the length of
the interior bise
tor of angle B equal to wb , then it is unique up to
isomorphism;
(b) for the existen
e of su
h a triangle in (a), it is ne
essary and su
ient
that
2a |a wb |
b > 0;
2a wb
(
) if ha is the length of the altitude to side BC in su
h a triangle in (a),
we have b > |a wb | + 12 ha .
502
B aw
2a cos w = .
2 c
B
By the Law of Cosines we have W C 2 = a2 + w 2 2aw cos
2
; using the
ab
standard formula WC =
a+c
, we therefore have
a2 b2 B aw 2
= a2 w 2a cos w = a2 .
(a + c)2 2 c
Thus, if a triangle ABC with the given parameters does exist, then its side
lengths are uniquely determined, and (a) is proved.
(b) First, it is easy to see that the two given inequalities are equivalent
to the
onjun
tion of the following three inequalities
w < 2a ; (2a + b)w < 2a(a + b) ; 2a(a b) < (2a b)w . (1)
Se
ond, the existen
e of a suitable triangle ABC is equivalent to the fa
t
that the solution c of f (x) = a satises |a b| < c < a + b; that is,
> a > f (a + b) . (2)
f |a b|
To show that (1) and (2) are equivalent, we rst suppose that the inequalities
in (1) hold. The inequality f (a + b) < a redu
es to the equivalent inequality
(2a + b)w < 2a(a + b), whi
h holds by (1). As for f |a b| > a, it is
equivalent to
.
2 2
ab2 |a b| + w 2 a + |a b| > a |a b| a + |a b|
Moreover, from f (a + b) < a we obtain (2a + b)w < 2a(a + b). As for the
ondition 2a(a b) < (2a b)w, it follows from f |a b| > a if a > b,
and from (2a w)(a b) < aw if a b (be
ause 2a > w, the left side is
negative). The desired equivalen
e follows.
(
) Note that b > |a w| + 21 ha is equivalent to
ab > a |a w| + Area(ABC) ;
3300. [2007 : 487, 489 Proposed by Arkady Alt, San Jose, CA, USA.
Let a, b, and c be positive real numbers. For any positive integer n
dene
3(an + bn + cn ) X bn + cn
Fn = .
a+b+c
y
li
b+c
Solution by Cao Minh Quang, Nguyen Binh Khiem High S
hool, Vinh Long,
Vietnam.
Sin
e F1 = 0, we take n > 1. We note that xn1 yn1 (x y) 0
m(an n n
1 + a2 + + am )
X an + + an
Fn = 2 m
,
a1 + a2 + + am a2 + + am
y
li
then Fn 0 for all n 1. Alt ultimately proved that if a, b, c, p, and q are positive real
numbers and
3(ap + bp + cp ) X ap + bp
F (p, q) = ,
aq + bq + cq aq + bq
y
li
well deserved! I look forward to working with Jean-Mar
in the New Year. As well,
I wel
ome ROLLAND GAUDET of College Universitaire Saint-Bonifa
e, Winnipeg.
Rolland is also helping with translations, espe
ially in times of
risis! I thank our
past CRUX editor BILL SANDS for his proof reading and sound advi
e.
My
olleagues in the Dept. of Mathemati
s and Statisti
s have lent their sup-
port. Those who have taken pity on this Editor-in-Chief are ANNA STOKKE, ROSS
STOKKE, TERRY VISENTIN, and JEFF BABB. Our se
retary, JULIE BEAVER, has also
helped out in a pin
h as little emergen
ies have arisen. I thank the previous Dean
of S
ien
e, GABOR KUNSTATTER, for his understanding and foresight in supporting
CRUX with MAYHEM at the University of Winnipeg.
The LATEX expertise of JOANNE CANAPE at the University of Calgary, and TAO
GONG and JUNE ALEONG at Wilfrid Laurier University goes a long way to produ
ing
high quality
opy. Joanne is nishing up her work in this area, so after my one year
of servi
e here I thank her for giving twenty! I wel
ome JILL AINSWORTH on board
who is taking over from Joanne to prepare the Olympiads.
Thanks go to the University of Toronto Press and to Thistle Printing, in parti
-
ular TAMI EHRLICH. The quality nished
opy and the purple
overs are just lovely.
I thank you MICHAEL DOOB and CRAIG PLATT for te
hni
al support, and JUDI
BORWEIN for putting CRUX on the net.
Someone spe
ial who has helped me through my rst year with her
areful proof
reading and knowledge of geometry is CHARLENE PAWLUCK. Thank you for sharing
your
opy of Eu
lid with me, and so mu
h more.
Finally, I thank you, the readers, for all that you have done for me and for the
journal. CRUX with MAYHEM is built from your
ontributions and all the time,
are
and
reativity that you put into your submissions is re
e
ted in these pages. I wish I
ould mention all the truly marvellous people that I have gotten to know in the last
year, but this margin is too small to hold all the names and praises.
I
lose with a
all for a new Skoliad Editor. Please refer anyone to us you may
think is suitable. Skoliad is missing from this issue, but will be ba
k next year; from
now on please send all Skoliad materials dire
tly to the Editor-in-Chief (or resend
your past submissions if you did not re
eive a reply from us).
I wish ea
h of you the very best in 2009 in all areas of life,
Va
lav
(Vazz) Linek
Mathemati
al Mayhem
Founding Editors / Reda
teurs-fondateurs:
Patri
k Surry & Ravi Vakil
Former Editors / An
iens Reda
teurs:
Philip Jong, Je Higham, J.P. Grossman,
Andre Chang, Naoki Sato, Cyrus Hsia, Shawn Godin, Je Hooper
508
Proposers
Missouri State University Problem Solving Group 3259, 3266 Skidmore College Problem Solving Group 3245
512