Professional Documents
Culture Documents
SKOLIAD
No. 114
Va
lav
Linek
+
W
O
K
O
K
O
W
(E) 9
2
. (Grades 7-8) An ant is running along a ruler ..................................sq...q.r................................................
...
of length 10
m with a
onstant speed of 1
m ...
.
1
2
3
4
5
6
7
8
9
.
per se
ond (see the gure). Any time when .......................................................................................
the ant rea
hes one of the ends of the ruler, it
turns ba
k and runs in the opposite dire
tion. It takes the ant exa
tly 1 se
ond to make a turn. The ant starts from the left end of the ruler. Nearest
whi
h number will it be after 2009 se
onds?
(A) 1
m
(B) 2
m
(C) 3
m
(D) 4
m
(E) 5
m
3
.
....
.
.
....
.
.
....
.
....
.. .....
...............
.
.....
....
.
.
.
....
.
.
....
.
.
....
.
.
....
.
. (Grades 7-8) Some points are marked on a straight line so that all distan es
between these points. At least how many points are marked on the line?
(A) 4
(B) 5
(C) 6
(D) 7
(E) 8
. (Grades 9-10) Eva, Betty, Linda, and Cathy went to the
inema. Sin
e it
was not possible to buy four seats next to ea
h other, they bought ti
kets for
seats number 7 and 8 in the 10th row and ti
kets for seats number 3 and 4
in the 12th row. How many seating arrangements
an they
hoose from, if
Cathy does not want to sit next to Betty?
(A) 24
(B) 20
(C) 16
(D) 12
(E) 8
9
3
10.
(Grades 11-12) Triangle ABC is
isos
eles with BC = AC . The segments
DE , F G, HI , KL, M N , OP , and XY
divide the sides AC and CB into equal
parts. Find XY , if AB = 40
m.
(A) 38
m
(B) 35
m
(C) 33
m
(D) 30
m
(E) 27
m
C
...
... ....
D ..................................... E
F .......................................................... G
H ............................................................................. I
K .................................................................................................. L
M ....................................................................................................................... N
O ............................................................................................................................................ P
X ................................................................................................................................................................ Y
A ........................................................................................................................................................................... B
..........
.......................
......................................
.. .. .. .....................
...........................................................
................................................
.. .. .. .. .. ...
................................................
............
................................
. .
..............................
.........................................
............................
Ni
k's
building
Matt's
building
12. (Grades 5-6) Consider all four-digit numbers divisible by 6 whose digits
are in in
reasing order, from left to right. What is the hundreds digit of the
largest su
h number?
(A) 7
(B) 6
(C) 5
(D) 4
(E) 3
.........1..........................2.................
.. ...................................................................................................................... ..... 1
. ........................................................................................................ .
2 .. ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
.. ................................................................................................................................................................................................................................................................................................................................. ...
......................................................................................................................................................................................................................................................................................................................................................................................................... .. 2
. . .................................................................................................................................................................................................................... ....
.
1 ....
........................................................
2
14. (Grades 9-10) A boy always tells the truth on Thursdays and Fridays,
always tells lies on Tuesdays, and tells either truth or lies on the rest of the
days of the week. Every day he was asked what his name was and six times in
a row he gave the following answers: John, Bob, John, Bob, Pit, Bob. What
did he answer on the seventh day?
(A) John
(B) Bob
(C) Pit
(D) Kate
(E) Not enough information to de
ide
15
....
.................. .........................
...... K
..........
..... ... ........
....
.... ..... ...............
....
.
.
.
........
...
...
........
...
..
...
........
....M ....
.
........
........ ....
..................... ...
........ ...
......
......
.........
..
....
.........
.
.
.
.....
.
.....
.
.
.
.
..
.........................
........ ....
...
.
........
..
.....
...
.......
..
........
...
...
........
.
.
.... ....
.
...
.
.
.
...
.... ... .............
.
.
.
.
....... ........
...........
......
................. ........................
......
4
Con
ours Math Kangaroo
Feuille d'entra^
nement
O
K
O
(A) 0
(B) 1
(C) 2
+
W
(D) 8
K
O
W
(E) 9
(A) 100 m
(B) 98 m
(C) 82 m
(D) 102 m
(E) 96 m
.....
.
(A) 1
m
4
(B) 2 m
(C) 3 m
.....
.
(D) 4 m
.....
.
...
.. ......
..............
....
.....
.
.
.....
.
.....
.
.....
.
.....
.
(E) 5 m
(B) 35
(C) 44
(D) 53
(E) 62
(A) 5 L
(B) 6 L
(C) 7 L
(D) 8 L
(E) 9 L
. (Classes 3-4) Deux gar
ons jouent au tennis jusqu'a
e que l'un d'eux gagne
quatre fois. Un mat
h de tennis ne peut nir en un pointage nul. Quel est le
plus grand nombre de jeux qu'ils peuvent jouer ?
6
(A) 8
(B) 7
(C) 6
(D) 5
(E) 9
5
. (Classes 5-6) Dans deux ans, mon ls aura deux fois l'^age qu'il avait il y a
deux ans. Dans trois ans, ma lle aura trois fois l'^age qu'elle avait il y a trois
ans. Quelle reponse
de
rit-elle
le mieux l'^age de la lle et du ls ?
(A) Le ls est plus a^ ge ;
(B) La lle est plus a^ gee
;
(C) Ils sont des jumeaux ; (D) Le ls est deux fois plus a^ ge que la lle ;
(E) La lle est deux fois plus a^ gee
que le ls.
7
. (Classes 7-8) Sur une droite on marque des points de sorte que toutes
les distan
es de 1
m, 2
m, 3
m, 4
m, 5
m, 6
m, 7
m et 9
m gurent
parmi les distan
es entre
es points. Combien y a-t-il au minimum de points
marques
sur
ette droite ?
(A) 4
(B) 5
(C) 6
(D) 7
(E) 8
8
C
..
.... ....
D ..................................... E
F ......................................................... G
H .............................................................................. I
K .................................................................................................. L
M ...................................................................................................................... N
O ............................................................................................................................................ P
X ................................................................................................................................................................. Y
A .......................................................................................................................................................................... B
. (Classes 3-4) En utilisant des
ubes identiques, Mathieu et Ni
olas ont
onstruit deux
b^atiments,
omme illustres
dans les gures. Le
b^atiment de Mathieu pese
200 g et
elui de Ni
olas 600 g. Combien de
ubes du b^atiment de
Ni
olas sont-ils
a
hes
et ne peuvent e^ tre vus
dans la gure ?
(B) 2
(C) 3
(A) 1
(D) 4
(E) 5
11
..........
.......................
......................................
.. .. .. .....................
...........................................................
................................................
.. .. .. .. .. ...
................................................
b^atiment
de Ni
olas
............
................................
.
..............................
.........................................
............................
b^atiment
de Mathieu
6
. (Classes 7-8) On divise un
arre de
ot
^ e 3 en polygones ave
plusieurs segments
omme indique dans
la gure. Quel est le per
entage de l'aire de la gure
ombree
par rapport a
elle du
arre ?
(A) 30%
(B) 33 13 %
(C) 35%
(E) 50%
(D) 40%
13
.........1..........................2................
.. ..................................................................................................... ..... 1
. ........................................................................................................................ .
2 .. ..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
.. .............................................................................................................................................................................................................................................................. ..
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... .... 2
................................................................................................................................. ...
1 .....
......
................................................
2
.....................................
..........
........
.................
.....K
..... ... ...............
....
........
.... .....
...
.
.
........
...
...
..
.
.
.
.
.
........
..
....
........
.... .M
........ ....
.............................
........ ..
..........
...
...
...
...
.
.
.
.
........
.......
....
........ ....
.........................
.
........
...
..
..
.......
.
.
.
.
.
...
...
.
.
.
.
.
.
...
..
........
.... .....
...
.......
.
.
.
.
.
.
.
.
.
.
.... ... .........
...............
.....
.........
......
...........................................
6
7
2
Imagine now that we de
ide to invent a new form of su
h squares by repla
ing
the sum by a produ
t. We ask you to nd su
h a square by repla
ing the
asterisks, , by natural numbers, not ne
essarily distin
t or
onse
utive, in
the following square:
1
4
7
Solution by the editor.
Suppose that the square A below is a magi
square. Then the square
B is a magi
square for produ
ts. For example, by the Law of Exponents, the
produ
t along the rst row of B is xa xb xc = xa+b+c and the produ
t along
the rst
olumn of B is xa xd xg = xa+d+g and these are the same be
ause
a + b + c = a + d + g . The same is true for the other rows,
olumns, and
diagonals of B .
A =
a b
d e
g h
c
f
i
xa
xd
xg
B =
xb
xe
xh
xc
xf
xi
Now, if we subtra
t 1 from every entry of the rst square given in the question
and if we take x = 2, then the square B below is a solution to the problem.
A =
7 0
2 4
3 8
5
6
1
B =
27
22
23
20
24
28
25
26
21
128
4
8
1
16
256
32
64
2
by
by
8
51, 17, 33, 11, 21, 7, 15, 5, 9, 3, 1.
9
........................................
4. The three atta
hed barrels. Three big
ylindri
al
........
.....
....
......
...
....
.
.
...
..
barrels, lying parallel to the earth, are atta
hed by
..
..
.......................
.
.
.
.
.
.
.
.
..
.
.
...
.
.
........
...
..... ....
.... ..........
.... ..
a steel
able at their
onta
t points, A and B , su
h .................................. ........
... ...........................
....
.....
...
....
....
...
that they stay xed in pla
e. Knowing that the two ........... ..............
..
....
.
............................ ....
.... ...............................
.
.
.
smaller ones ea
h have a radius of 4 metres and the ............ ........q....A
.
.
.
.
B
.......
........................................................................q
.
..
biggest one has a radius of 9 metres, what is the ............ .............................. ................................. ............
.....................
..............................
.....................
length of the steel
able?
Solution by the editor.
Join the
entres of the smaller barrels
........................................
..........
.......
.......
.....
.....
....
and drop a perpendi
ular to this segment from
....
....
.
.
...
...
.
...
.
.
.
..
.
the
entre of the larger barrel, as in the dia..
...
..
...
...
C
.
..
.
...
.
.
gram at right. Sin
e the barrels rest on the
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...
...... .... ...............
..
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.......... B........................................
........A ..........
...
......
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
earth, the length of CZ is the dieren
e of ...... ...........................q............................................................................................................................................q.................. .........
...................................................................................
...
..
their radii, that is, |CZ| = 9 4 = 5. Also ........... X ..............................................................................................Z
... ...
..... .....
Y .........
........
......
.....
.....
.
.................. .........................
.
...............................
.
.
.
.
.....................
.......
the length of CY is the sum of the radii, that
is, |CY | = 9 + 4
= 13. By the Pythagorean
Theorem |ZY | = 132 52 = 12. Thus, |XY | = 24. Finally, sin
e triangle
9
216
CAB is similar to triangle CXY , we have |AB| =
|XY | =
.
13
13
10
We now have N1 = 0, N2 = 4, N3 = N2 + 4N1 = 4 + 4 0 = 4, and so
forth. The results of
al
ulating the Ni are summarized in the table below:
N1
0
N2
4
N3
4
N4
20
N5
36
N6
116
N7
260
N8
724
N9
1764
N10
4660
11
MATHEMATICAL MAYHEM
Mathemati
al Mayhem began in 1988 as a Mathemati
al Journal for and by
High S
hool and University Students. It
ontinues, with the same emphasis,
as an integral part of Crux Mathemati
orum with Mathemati
al Mayhem.
The Mayhem Editor is Ian VanderBurgh (University of Waterloo). The
other sta members are Monika Khbeis (As
ension of Our Lord Se
ondary
S
hool, Mississauga) and Eri
Robert (Leo Hayes High S
hool, Frederi
ton).
Mayhem Problems
Please send your solutions to the problems in this edition by 1 May 2009. Solutions re
eived after this date will only be
onsidered if there is time before publi
ation
of the solutions.
Ea
h problem is given in English and Fren
h, the o
ial languages of Canada.
In issues 1, 3, 5, and 7, English will pre
ede Fren
h, and in issues 2, 4, 6, and 8,
Fren
h will pre
ede English.
The editor thanks Jean-Mar
Terrier of the University of Montreal for translations of the problems.
M376. Proposed by the Mayhem Sta.
2
2
102009 + 25 102009 25 = 10x .
12
M380. Proposed by Bru
e Shawyer, Memorial University of Newfoundland, St. John's, NL.
Triangle ABC is right-angled at C and has BC = a and CA = b, with
a b. Squares ABDE , BCF G, and CAHI are drawn externally to triangle
ABC . The lines through F I and EH interse
t at P , the lines through F I
and DG interse
t at Q, and the lines through DG and EH interse
t at R. If
triangle P QR is right-angled, determine the value of ab .
M381. Proposed by Mihaly Ben
ze, Brasov, Romania.
Determine all solutions to the equation
1
1
1
1
+
+
+
= x2 4x 4 .
x1
x2
x6
x7
.................................................................
M376. Propose par l'Equipe
de Mayhem.
Determiner
la valeur de x si
2
2
102009 + 25 102009 25 = 10x .
M377. Propose par l'Equipe
de Mayhem.
Determiner
la suite arithmetique
formee
de 9 entiers positifs dont la
somme se situe entre 200 et 220 et dont le se
ond terme vaut 12.
M378. Propose par l'Equipe
de Mayhem.
A partir du point A, on
hoisit deux points C et D sur un demi-
er
le
de diametre
AB . Soit P l'interse
tion des droites CB et DA, et Q
elle des
droites AC et BD. Montrer que la droite P Q est perpendi
ulaire a AB .
M379. Propose par John Grant M
Loughlin, Universite du NouveauBrunswi
k, Frederi
ton, NB.
Les entiers 27 + C , 555 + C et 1371 + C sont tous des
arres
parfaits
dont les ra
ines
arrees
forment une suite arithmetique.
Trouver toutes les
valeurs possibles de C .
M380. Propose par Bru
e Shawyer, Universite Memorial de Terre-Neuve,
St. John's, NL.
Dans un triangle ABC d'angle droit en C , soit BC = a et CA = b,
ave
a b. Exterieurement
au triangle ABC , on
onstruit les
arres
ABDE ,
BCF G et CAHI . Soit respe
tivement P , Q et R les interse
tions des droites
F I et EH , F I et DG, DG et EH . Determiner
la valeur de ab pour que P QR
soit un triangle re
tangle.
13
M381. Propose par Mihaly Ben
ze, Brasov, Roumanie.
Determiner
toutes les solutions de l'equation
1
x1
1
x2
1
x6
1
x7
= x2 4x 4 .
Mayhem Solutions
Solution by Taylor Thetford, student, Lakeview High S
hool, San Angelo, TX,
USA.
The roots of the quadrati
equation that Jim writes down are 5 and 4.
His quadrati
equation is thus (x 5)(x 4) = x2 9x + 20 = 0. Sin
e Jim
opied b
orre
tly, we
an
on
lude that in the original quadrati
equation,
b = 9.
Similarly, sin
e Vazz's roots are 2 and 4, his quadrati
equation has the
form (x 2)(x 4) = x2 6x + 8 = 0. Sin
e Vazz
opied c
orre
tly, then
c = 8.
Thus, the original equation was x2 9x + 8 = 0. Fa
toring, we obtain
(x 1)(x 8) = 0. Therefore, the roots of the original equation are 1 and 8.
Also solved by CAO MINH QUANG, Nguyen Binh Khiem High S
hool, Vinh Long,
Vietnam; JACLYN CHANG, student, Western Canada High S
hool, Calgary, AB; PETER CHIEN,
student, Central Elgin Collegiate, St. Thomas, ON; IAN JUNE L. GARCES, Ateneo de Manila
University, Quezon City, The Philippines; JOHAN GUNARDI, student, SMPK 4 BPK PENABUR,
IES
Jakarta, Indonesia; RICHARD I. HESS, Ran
ho Palos Verdes, CA, USA; RICARD PEIRO,
\Abastos", Valen
ia, Spain; JOSE HERNANDEZ
SANTIAGO, student, Universidad Te
nologi
a
de la Mixte
a, Oaxa
a, Mexi
o; KUNAL SINGH, student, Kendriya Vidyalaya S
hool, Shillong,
India; BILLY SUANDITO, Palembang, Indonesia; LUYAN ZHONG-QIAO, Columbia International College, Hamilton, ON; and TITU ZVONARU, Comane
sti, Romania.
100
and
199,
in lusive,
14
Solutions by Taylor Thetford, student, Lakeview High S
hool, San Angelo,
TX, USA.
1xy .
Case 1. The rst and last digits are the same. Here, we are looking for
integers 1x1 where the middle digit
an take any value ex
ept 1. This yields
9 possibilities.
Case 2. The rst and se
ond digits are the same. Here, we are looking for
integers 11y where the last digit
an take any value ex
ept 1. This again
yields 9 possibilities.
Case 3. The se ond and last digits are the same. Here, we are looking for
Adding the results from our three
ases, we nd that there are 27 numbers between 100 and 199, in
lusive, that
ontain exa
tly two equal digits.
(b) We
ount the number of integers in the range 1 to 999, in
lusive,
that have exa
tly two equal digits.
First, between 1 and 99, there are 9 of these, namely, 11, 22, . . . , 99.
Next, between 100 and 199, we have
ounted 27 in part (a). Using the same
argument as in (a), we
an show that there are 27 numbers between 200 and
299, in
lusive, and for every other interval of one hundred numbers up to
the range of 900 to 999.
There are therefore 9 + 9 27 = 252 numbers between 1 and 999 whi
h
ontain exa
tly two equal digits.
The probability that a randomly sele
ted integer between
28
has exa
tly two equal digits is thus 252
=
.
999
111
and
999
Also solved by PETER CHIEN, student, Central Elgin Collegiate, St. Thomas, ON; IAN
JUNE L. GARCES, Ateneo de Manila University, Quezon City, The Philippines; RICHARD
I. HESS, Ran
ho Palos Verdes, CA, USA; and LUYAN ZHONG-QIAO, Columbia International
College, Hamilton, ON. There were 3 in
orre
t solutions and 1 partial solution submitted.
15
Solution by Cao Minh Quang, Nguyen Binh Khiem High S
hool, Vinh Long,
Vietnam.
T
Sin
e ABC is isos
eles with sides AB
and AC of equal length, we have M A BC .
Also, sin
e P T BC , then M A||P T .
A
Sin
e M A||P K , then M BA is similar
to P BK sin
e ea
h is right-angled and they
K
share the angle at B . From this, we obtain
P B MA
PK
MA
, hen
e P K = M B .
=
PB
MB
Similarly, sin
e M A||P T , then CP T
T
MA
is similar to CM A, when
e PP C
=
MC
......
... ....
.... .....
... ....
.
...
...
.....
...
...
...
...
....
...
..........
....
... ... ...
... ..... ......
.
....
.
... ..... .... ......
...
.... ....
.....
...
... ....
...
....
...
.....
....
...
......
...
.
.
.
.
...
.
.. ...
.
.
.
.
...
..
... ....
...
.
.
.
.
...
..
.. ....
.
.
...
.
.
...
..
...
..
.
.
.
.
...
..
...
.....
.
...
.
.
...
.
..
..
.
.
.
.
.
...
..
....
..
...
.
.
.
.
...
...
....
....
.
...
.
.
.
..
...
...
.
.
.
.
..
.
.
..
.
.
.
.
.
.
...............................................................................................................................................
MA
and so P T = P CM C
.
Sin
e M B = M C =
PK + PT
1
BC
2
P M
, we an on lude that
(P B + P C) M A
P B MA
P C MA
+
=
MB
MC
MB
BC M A
= 2M A .
MB
Solution by Taylor Thetford, student, Lakeview High S
hool, San Angelo, TX,
USA.
Let 2x and 3x be the lengths of
B
CB and AB , respe
tively. Let y and
y + 10 be the lengths of CD and DA,
3x
respe
tively. Let z be the length of
2x
z
BD . We wish to nd 2y + 10, whi
h
is the length of CA.
By applying the Pythagorean
A
y
Theorem in ABC , we nd that
y + 10
C
D
(2x)2 + (3x)2 = (2y + 10)2 and so
13x2 = 4y 2 + 40y + 100.
....
..............
.... ... .............
.......
.... ...
.......
.... .....
.
.
.......
.
.......
....
....
.......
...
.
.
.
.
.......
..
..
.
.
.......
.
.
.
..
..
.......
.
.
.
.
.
.......
..
..
.
.
.
.......
.
.
..
..
.......
.
.
.
.
.
.......
..
.
.
.
.
.
.......
.
..
..
.
.......
.
.
.
.
.......
..
..
.
.
.
.
.
.......
..
........
.
.
.......
.
.
.
..
..
. ...
.
.
.
.
.
......................................................................................................................................................................................................
16
Applying the Pythagorean Theorem to BDC and BDA, we nd
that y2 + z 2 = 4x2 and z 2 + (y + 10)2 = 9x2 .
Eliminating z in the last two equations gives 4x2 y2 = 9x2 (y+10)2 .
Therefore, 5x2 = (y + 10)2 y2 = 20y + 100 or x2 = 4y + 20, and so
13x2 = 52y + 260.
Combining this result with 13x2 = 4y2 + 40y + 100, we nd that
52y + 260
4y 12y 160
y 2 3y 40
(y + 5)(y 8)
2
=
=
=
=
4y 2 + 40y + 100 ;
0;
0;
0.
They start moving the boxes at 9:00 am. What is the earliest time at whi
h
they
an be nished moving all of the boxes?
Solution by Mayhem Sta.
Let x represent the number of small boxes and y represent the number
of large boxes that Celine moves. Sin
e there are 10 small boxes and 10 large
boxes, then Quin
y moves 10 x small boxes and 10 y large boxes.
Given the lengths of time that ea
h takes, it takes Celine x+6y minutes
and it takes Quin
y 3(10 x) + 5(10 y) = 80 3x 5y minutes. If x = 9
and y = 4, then Celine takes 33 minutes and Quin
y takes 33 minutes. We
show that it
annot be done faster than this.
If Quin
y and Celine nish in fewer than 33 minutes, then ea
h takes
at most 32 minutes, so the total working time is at most 64 minutes, so
x + 6y + (80 3x 5y) = 80 2x + y 64 or 2x y 16.
Sin
e x and y are nonnegative integers and ea
h is less than 10, then
the possible pairs (x, y) that satisfy this inequality are (8, 0), (9, 0), (9, 1),
(9, 2), (10, 0), (10, 1), (10, 2), (10, 3), and (10, 4).
17
Sin
e we want ea
h of Celine's time and Quin
y's time to be at most
minutes, then we need x + 6y 32 and 80 3x 5y 32. The
rst inequality eliminates the pair (10, 4) from the list of possible pairs. The
se
ond inequality simplies to 3x + 5y 48; none of the remaining pairs
satisfy this inequality.
Thus, none of these possibilities take any less time than 33 minutes.
Therefore, the earliest possible nishing time is 9:33 a.m.
32
Sn =
n
1 X
(f3k +f3k ) =
k=1
n
1 X
k=1
3n
1 X
fk .
(1)
k=1
From (1) and (2), we nd that Sn = 12 (f3n+2 1). In our parti
ular
ase, S100 = 12 (f302 1). Maple
omputes the value of S100 to be exa
tly
290905784918002003245752779317049533129517076702883498623284700.
For the re
ord, by Binet's formula for Fibona
i numbers we have that
1
1
1
fm = (m m ), where = (1 + 5) and = (1 + 5). Hen
e
2
2
5
1
1
302 302 .
2
2 5
Also solved by EDIN AJANOVIC, student, First Bosniak High S
hool, Sarajevo, Bosnia
and Herzegovina; CAO MINH QUANG, Nguyen Binh Khiem High S
hool, Vinh Long, Vietnam;
IAN JUNE L. GARCES, Ateneo de Manila University, Quezon City, The Philippines; RICHARD
IES \Abastos", Valen
ia, Spain;
I. HESS, Ran
ho Palos Verdes, CA, USA; RICARD PEIRO,
DIVYANSHU RANJAN, Delhi, India; JOSE HERNANDEZ
SANTIAGO, student, Universidad
Te
nologi
a
de la Mixte
a, Oaxa
a, Mexi
o; and TITU ZVONARU, Comane
sti, Romania.
18
Problem of the Month
Ian VanderBurgh
ti ation, the fra tion pq , where p and q are positive integers and q
< 100,
p
q
p
3 = 7p 3q = |7p 3q|
q
7
7q
7q
19
What
an we do to make this as small as possible? Two approa
hes
would be to make the numerator of the dieren
e as small as possible or to
make the denominator of the dieren
e as large as possible.
Let's fo
us initially on the numerator. The numerator
annot equal 0
be
ause the fra
tions pq and 37 are not equal. Thus, the smallest possible
value for the numerator is 1, be
ause p and q are integers. So let's try to
nd values of p and q for whi
h the numerator equals 1. In this
ase, the
1
dieren
e equals 7q
whi
h is minimized when q is largest.
For the numerator to equal 1, we need 7p 3q = 1. Sin
e we also
want to maximize q, we rewrite this as 7p = 3q 1 and work from the largest
possible integer values of q to see when we also get an integer value for p.
If q = 99, the equation be
omes 7p = 3(99) 1 = 297 1. Neither
possibility is a multiple of 7.
If q = 98, the equation be
omes 7p = 3(98) 1 = 294 1. Neither
possibility is a multiple of 7.
If q = 97, the equation be
omes 7p = 3(97) 1 = 291 1. Neither
possibility is a multiple of 7.
If q = 96, the equation be
omes 7p = 3(96) 1 = 288 1. Sin
e
287 is a multiple of 7, then taking q = 96 and p = 41 gives a dieren
e with
numerator 1.
3
1
1
So we have 41
=
=
and this is the smallest possible
96
7
7 96
672
dieren
e with the numerator equal to 1.
If the numerator equalled 2 or something larger, then the smallest possible dieren
e o
urs when the numerator is as small as possible and the
2
denominator is as large as possible, so is 7 299 = 693
. This is the smallest
possible dieren
e with numerator at least 2.
1
Combining the
ases, the smallest possible dieren
e is indeed 672
,
3
and so the
losest fra
tion to 7 of all of the fra
tions under
onsideration is
p
41
=
.
q
96
The approximation of fun
tions with polynomials is often seen in rstyear university
al
ulus
ourses. As part of these investigations, we learn
how to estimate the amount of error when approximating, for example, sin x
1 5
with x 16 x3 + 120
x . The te
hniques used to estimate this type of error
are not dissimilar to what we have seen above, and are very useful in many
types of
al
ulations.
20
The year has
own by, and it has brought many
hanges to Crux and
to the Corner. Of
ourse it has been overshadowed by the sudden and untimely loss of a great friend and a devoted
olleague, Jim Totten, mid-way
through the transition to a new Editor-in-Chief. I think Vazz Linek has done
a wonderful job of stepping in and keeping the journal on tra
k with only an
understandable slowing of the produ
tion pa
e in the interim.
Readers will have noti
ed the announ
ement at the end of the De
ember Corner that Joanne Canape, who has transformed my s
ribbles into a
high quality tex le for many years, has de
ided that two de
ades is enough.
As I
ustomarily begin the year by thanking all those who
ontributed to the
Corner in the last year, I would be very remiss not to lead o with sin
ere
thanks to Joanne.
It is also appropriate to thank those who submitted problem sets for our
use as well as a spe
ial thanks to the dedi
ated readers who furnish their ni
e
solutions whi
h we use. Hoping, as always, that I've not missed someone,
here is the list for the 2008 members of the Corner.
Robert Morewood
Arkady Alt
Andrea Munaro
Miguel Amengual Covas
Vedula N. Murty
Jean-Claude Andrieux
Felix Re
io
Houda Anoun
Xavier Ros
Ri
ardo Barroso Campos
D.J. Smeenk
Mi
hel Bataille
Babis Stergiou
Jose Luis Daz-Barrero
Daniel Tsai
J. Chris Fisher
Panos E. Tsaoussoglou
Kipp Johnson
Georey A. Kandall
George Tsapakidis
Jan Verster
Ioannis Katsikis
Edward T.H. Wang
R. Laumen
Salem Maliki
Luyan Zhong-Qiao
Li Zhou
Pavlos Maragoudakis
Titu Zvonaru
Our apologies to Svetoslav Sav
hev for the misspelling of his name in
the De
ember 2008 Olympiad.
For your problem solving pleasure in the new year we start o with the
problems of the German Mathemati
al Olympiad, Final Round, 2006. My
thanks go to Robert Morewood, Canadian Team Leader to the 47th IMO in
Slovenia 2006, for
olle
ting them for our use.
21
German Mathemati
al Olympiad
Final Round, Grades 12{13
Muni
h, April 29 { May 2, 2006
First Day
is a prime.
2. Five points are on the surfa
e of a sphere of radius 1. Let amin denote
the smallest distan
e (measured along a straight line in spa
e) between any
two of these points. What is the maximum value for amin , taken over all
arrangements of the ve points?
3. Find all positive integers n for whi
h the numbers 1, 2, 3, . . . , 2n
an be
oloured with n
olours in su
h a way that every
olour appears twi
e and
every number 1, 2, 3, . . . , n appears exa
tly on
e as the dieren
e of two
numbers with the same
olor.
Se
ond Day
Our se
ond problem set for this number is a set of sele
ted problems
from the Thai Mathemati
al Olympiad Examinations 2005. Again, thanks
go to Robert Morewood, team leader to the 47th IMO in Slovenia 2006, for
olle
ting them for the Corner.
22
Thai Mathemati
al Olympiad Examinations 2005
Sele
ted Problems
+ Q x x2
1 + x + x2 R(x) .
for all x, y R.
3. Let a, b, and c be positive real numbers. Prove that
1 +
3
6
ab + bc + ca
a+b+c
23
As a third set of problems we give the 46th Ukrainian Mathemati
al
Olympiad Final Round 2006 - 11th form problems. Again, thanks go to Robert
Morewood, team leader to the 47th IMO in Slovenia 2006, for
olle
ting them
for our use.
46th Ukrainian Mathemati
al Olympiad 2006
Final Round
th
11
Form
1. (V.V. Plakhotnyk) Prove that for any rational numbers a and b the graph
of the fun
tion
f (x) = x3 6abx 2a3 4b3 , x R
has exa
tly one point in
ommon with the x-axis.
2. (O.A. Sarana) A
ir
le is divided into 2006 equal ar
s by 2006 points.
Baron Mun
hausen
laims that he
an
onstru
t a
losed polygonal
urve
with the set of verti
es
onsisting of these 2006 points su
h that amongst its
2006 edges there are no two whi
h are parallel to ea
h other. Is his
laim
true or false?
3. (T.M. Mitelman)
(a) Prove that for any rational number (0, 1)
exists
an innite
there
set of real numbers that satisfy the equation x x{x} = and any
two of them have the same fra
tional part. (The fra
tional part of a real
number a is given by {a} = a a, where a is its integer part, that
is, the greatest integer that does not ex
eed a.)
(b) Prove that for any rational number (0, 1)
exists
an innite
there
set of real numbers that satisfy the equation x x{x} = and any
two of them have dierent fra
tional parts.
4. (V.A. Yasinskiy) Two
ir
les 1 and 2 interse
t ea
h other at two distin
t
points A and B . The tangent line of the
ir
le 1 at the point A and the
tangent line of the
ir
le 2 at the point B meet at point C . The rst of
these two lines interse
ts the
ir
le 2 for the se
ond time at point T 6= A.
The point X (distin
t from A and B ) is on the
ir
le 1 , and the line XA
interse
ts the
ir
le 2 for the se
ond time at point Y (distin
t from A). The
lines Y B and XC meet at point Z . Prove that T Z is parallel to XY .
5. (O.O. Kur
henko) Prove that for any real numbers x and y
| cos x| + | cos y| + | cos(x + y)| 1 .
6. (T.M. Mitelman) Find all fun
tions f : R R su
h that
f x3 + y 3
= x2 f (x) + yf (y 2 )
24
7. (V.A. Yasinskiy) A point M lies inside a
ube ABCDA1 B1 C1 D1 . Points
A , B , C , D , A1 , B1 , C1 , and D1 belong to the rays M A, M B , M C ,
M D , M A1 , M B1 , BC1 , and M D1 respe
tively. Prove that if the polyhedron A B C D A1 B1 C1 D1 is a parallelepiped (that is, all of its fa
es are
parallelograms), then it is a
ube.
8. (V.A. Yasinskiy) There are n 3 soldiers in
aptain Petrenko's squad,
no two of the same height. The
aptain orders them to stand single-le (not
ne
essarily sorted by height). A \wave" is any subsequen
e of (not ne
essarily next to ea
h other) soldiers in this line su
h that the rst (leftmost) soldier
in the wave is taller than the se
ond soldier in it, but the se
ond soldier in it
is shorter than the third one, who is in turn taller than the fourth one, and
so on. (For example, if n = 9, the soldiers are enumerated by height, and
the
aptain lines them up as 9, 3, 5, 7, 1, 2, 6, 4, 8 then a longest wave for
this line-up is 9, 3, 7, 1, 6, 4, 8. However, if the
aptain lines them up as
1, 2, 3, 4, 5, 6, 7, 8, 9, then a longest wave
onsists of (any) one soldier.)
For every n,
onsider the number of possible lines with the longest waves of
even lengths and the number of possible lines with the longest waves of odd
lengths. Whi
h of these numbers is bigger?
Continuing with problems for readers to solve we give the Cze
h-PolishSlovak Mathemati
s Competition written on June 26-28, 2006 at Z ilina,
Slovakia. Thanks again go to Robert Morewood, Canadian team leader to
the 47th IMO in Slovenia 2006, for
olle
ting them for our use.
Cze
h-Polish-Slovak Mathemati
s Competition 2006
1. Five distin
t points A, B , C , D, and E lie in this order on a
ir
le of
radius r and satisfy AC = BD = CE = r. Prove that the ortho
entres
of the triangles ACD, BCD, and BCE are the verti
es of a right-angled
triangle.
2. There are n
hildren sitting at a round table. Erika is the oldest among
them and she has n
andies. No other
hild has any
andy. Erika distributes
the
andies as follows. In every round, all the
hildren with at least two
andies show their hands. Erika
hooses one of them and he/she gives one
andy to ea
h of the
hildren sitting next to him/her. (So in the rst round
Erika must
hoose herself to begin the distribution.) For whi
h n 3 is it
possible to redistribute the
andies so that ea
h
hild has exa
tly one
andy?
3. The sum of four real numbers is 9 and the sum of their squares is 21.
Prove that these four numbers
an be labelled as a, b, c, and d so that the
inequality ab cd 2 holds.
25
4. Prove that for every positive integer k there is a positive integer n su
h
that the de
imal representation of 2n has a blo
k of exa
tly k
onse
utive
zeros, that is, 2n = a00 0b , where a and b are nonzero digits with
k zeros between them.
5. Find the number of integer sequen
es (an )
n=1 su
h that an 6= 1 and
an+2 =
an + 2006
an+1 + 1
Ai Ai+3
Our nal problem set for this issue is the XXI Olimpiadi Italiano della
Matemati
a, Cesenati
o, written 5 May 2006. Thanks again go to Robert
Morewood, Canadian team leader to the 47th IMO in Slovenia, for
olle
ting
them for our use.
XXI Olimpiadi Italiano della Matemati
a
Cesenati
o
May 5, 2006
26
4. On an innite
hessboard all the
positive integers are written in as
ending order along a spiral, starting
from 1 and pro
eeding anti
lo
kwise;
a portion of the
hessboard is shown
in the gure.
A "right half-line" of the
hessboard is the set of squares given by
a square C and by all squares in the
same row as C and to the right of C .
.......................................................................................................................................................................................
... 17 ...... 16 ...... 15 ...... 14 ...... 13 ...
......................................................................................................................................................................
...... ..... ..... ..... .... ....
..... 18 ..... 5 .... 4 .... 3 ..... 12 ....
................................................................................................................................
...... ...... ..... ...... ..... .....
..........19
... 6 ... 1 .. 2 ... 11 .
... ..............................................................................................................................................
...... 20 ....... 7 ....... 8 ....... 9 ....... 10 ......
.................................................................................................................................................................
...... 21 ........ 22 ........ 23 ........ 24 ........ 25 ........
...................................................................................................................................................................................
(a) Prove that there exists a right half-line none of whose squares
ontains
a multiple of 3.
(b) Determine if there exist innitely many pairwise disjoint right half-lines
none of whose squares
ontains a multiple of 3.
5. Consider the inequality
(x1 + + xn )2 4(x1 x2 + x2 x3 + + xn x1 ) .
(a) Determine for whi
h n 3 the inequality holds true for all possible
hoi
es of positive real numbers x1 , x2 , . . . , xn .
(b) Determine for whi
h n 3 the inequality holds true for all possible
hoi
es of any real numbers x1 , x2 , . . . , xn .
6. Albert and Barbara play a game. At the start there are some piles of
oins
on the table, not all ne
essarily with the same number of
oins. The players
move in turn and Albert starts. At ea
h turn a player may either take a
oin
from a pile or divide a pile into two piles with ea
h pile
ontaining at least
one
oin (a player may exer
ise only one of these options).
The one who takes the last
oin wins the game. In terms of the number
of piles and the number of
oins in ea
h pile at the start, determine whi
h of
the players has a winning strategy.
27
(a) If a, b Z and gcd(a, b) = 1 , then gcd(am , bn ) = 1 for any positive
integers m and n.
(b) If a|b, a is a positive integer, b Z, and gcd(a, b) = 1, then a = 1.
Let
(1)
(2)
(4)
28
4. Find all pairs (a, b) of real numbers su
h that all roots of the polynomials
6x2 24x 4a and x3 + ax2 + bx 8 are non-negative real numbers.
p
3
1 2 3 ,
EC
Similarly, AD =
=
=
=
=
bc
.
a+b
AB
;
AC
c
;
b
b+c
b
ab
b+c
...
........
.. ... ....
.. .. ...
.. .... .......
.
.
....
.. ....
....
..
...
....
..
....
...
..
....
..
..
.
....
...
.
....
...
...
....
.
.
...
.
....
...
..
....
.
...
....
.
.
....
...
...
....
..
.
.
....
...
.
....
...........
...
....
. .........
.
..
..........
....
.
...
..........
...
....
.
.......... ...
....
.
...........
.
....
..........
...
....
.
.
.
.
.
.
.
.
.
.
....
... ...........
.
.
....
.
.
...
.
...
..........
....
.
.
.
.
.
.
.
.
..........
...
....
.
.
.
.
.
...
..........
....
..
.
.
.
....
.
.
.
.
.
..........
..
.
....
..........
...
...
.
..........
.
...
.
.......... .......
.
..
.......... ....
...
...
........ ...
...
..............................................................................................................................................................................................................................
;
.
29
We have
|AD| + |EC| |AC| =
= b
bc
a+b
ab
b+c
2abc cos(B)
1
2
(a + b)(b + c)
Hen
e,
|AD| + |EC| = |AC|
|AD| + |EC| > |AC|
|AD| + |EC| < |AC|
ABC = 60 ,
ABC < 60 ,
ABC > 60 .
Solved by Arkady Alt, San Jose, CA, USA; and Mi
hel Bataille, Rouen, Fran
e.
We give the solution of Bataille.
and
Pmax = 9 + 3 15.
We show that Pmin = 21 9 + 3 21
First, x = 1 and y = 12 11 + 3 21 satisfy the
onstraint equation
2
and P = 12 9+3 21. Similarly, for x = 12 10+3 15 , y = 21 8+3 15 ,
we have P = 9 + 3 15 and the
onstraintis satised. Now, let x and y
satisfy the
onstraint equation. Then P = 3 x + 1 + 3 y + 2, so that
p
P 2 = 9 P + 3 + 2 (x + 1)(y + 2)
(1)
or
omplete.
is
30
4. Find all real-valued fun
tions f dened on R that satisfy the identity
f f (x y) = f (x)f (y) f (x) + f (y) xy .
=0
(1)
f (x)2 = x2 + a2
2
2
4
2
for all real
x. In parti
ular f (a)
= 2a , that is, a = 2a , hen
e
numbers
a {0, 2, 2}. Assume
that a = 2. Then for any given x we have
f (x) = x2 + 2 or f (x) = x2 + 2 and taking y = 0 in (1), we obtain
2 1 f (x) +
2.
(2)
2
taking x = 2 in (2) yields
a
ontradi
tion sin
e 6 6= 3 2 2 . Similarly,
x! + y!
= 3n
n!
Solved by Daniel Tsai, student, Taipei Ameri
an S
hool, Taipei, Taiwan; and
Konstantine Zelator, University of Toledo, Toledo, OH, USA. We give the
solution of Tsai.
Let S be the set of all ordered triples (x, y, n) of nonnegative integers
+ y!
su
h that x! n!
= 3n , or equivalently x! + y! = 3n n!. For n = 0, it is
seen at on
e that there is no
orresponding (x, y, n) S . For n = 1, let
(x, y, n) S ; then if x 3 or y 3 we have x! + y! 7 > 3 = 31 1!,
thus x, y < 3 and simple
he
king yields that {(0, 2, 1), (1, 2, 1), (2, 0, 1),
(2, 1, 1)} S .
Lemma Let (x, y, n) S with n 2. Then x, y n and x > n or y > n.
31
y!
an integer but n!
is not. Thus, if x > n, then y
y > n we have x n by symmetry.
n.
x!
n!
y!
n!
= 1 + (n + 1)(n + 2) y = 3n .
x!
n!
ontradi
ting n + 1 0
If x = n + 1, then
y!
n!
= 1 + (n + 1)(n + 2) y = 3n ,
(mod 3).
x! + y!
x!
y!
=
+
= (n + 1) + (n + 1)(n + 2) y = 3n .
n!
n!
n!
If furthermore y = n + 1, then
2(n + 1) = (n + 1) + (n + 1)(n + 2) y = 3n
32
for 1 n 5 and by indu
tion (n + 1) 1 + (n + 2)(n + 3)
ontradi
ting the fa
t that (x, y, n) S .
< 3n
for n 6,
Solved by Arkady Alt, San Jose, CA, USA; Mi
hel Bataille, Rouen, Fran
e;
and Daniel Tsai, student, Taipei Ameri
an S
hool, Taipei, Taiwan. We give
Bataille's write-up.
Let f (x) = 3x3 7x2 + 5x and g(x) = f (x) x = x(x 1)(3x 4).
The sequen
e {xn }, whi
h satises xn+1 = f (xn ) for all positive integers n,
an only
onverge to a root of g(x) = 0. Thus, the only possible nite limits
of {xn } are 0, 1, and 43 . We show that the sequen
e is
onvergent if and only
if 0 a 43 , in whi
h
ase the limit is 1 ex
ept if a = 0 and n
lim xn = 0 or
4
4
if a = 3 and n
lim xn = 3 .
Suppose rst a < 0. Sin
e g(x) < 0 when x < 0, it follows that
xn < x1 = a < 0 for all positive integers n. If {xn } had a nite limit, ,
we would have a,
ontradi
ting the fa
t that {0, 1, 43 }. Thus, {xn }
is divergent when a < 0. Using the fa
t that g(x) > 0 for x > 43 , similar
reasoning shows that {xn } is divergent when a > 43 .
If a {0, 1, 43 }, then the sequen
e {xn } is
onstant.
If a (1, 34 ), then using f (x) 1 = (x 1)2 (3x 1) an easy indu
tion shows that 1 < xn+1 < xn for all positive integers n. Thus, {xn } is
de
reasing and bounded, hen
e
onvergent. Its limit satises 1 and
{0, 1, 43 }, that is, = 1.
If a [ 13 , 1) then x2 = f (a) 1 and x2 < 43 , as the maximum of f on
< 43 . From the previous
ase, we see that lim xn = 1.
[0, 1] is f 59 = 275
243
n
1
1
It remains to study the
ase a 0, 13 . Then, 3m+1
a < m for
3
some unique positive integer m. If any of the numbers x2 , x3 , . . . , xm is not
less than 13 , let xk be the one with the smallest index. Then 13 xk < 43 and
by the previous
ases {xn }nk
onverges to 1 and n
lim xn = 1. Otherwise,
noting that f (x) 3x = x(x 2)(3x 1) is positive for x 0, 13 , we have
x2
x3
xm
1
3m1
3m
,
1
32
33
To nish this number of the Corner we give solutions from the readers
to problems of the 2005 German Mathemati
al Olympiad, given at [2008 : 82.
1. Determine all pairs (x, y) of reals, whi
h satisfy the system of equations
x3 + 1 xy 2 y 2
y 3 + 1 x2 y x2
=
=
0,
0.
Solved by George Apostolopoulos, Messolonghi, Gree
e; Konstantine Zelator, University of Toledo, Toledo, OH, USA; and Titu Zvonaru, Comane
sti,
Romania. We give the write-up of Apostolopoulos.
We subtra
t the two equations of the system to obtain
x3 y 3
+ xy(x y) + x2 y 2 = 0 ,
Thus, y = x or y = x or y = x 1.
If y = x, then x = 1, hen
e (x, y) = (1, 1) or (x, y) = (1, 1).
If y = x, then again x = 1, hen
e (x, y) = (1, 1) or (x, y) = (1, 1).
If y = x 1 we substitute into the rst equation to obtain
x3 + 1 x(x + 1)2 (x + 1)2 = 3x(x + 1) = 0 ,
34
.
.
....
....
...
....
....
....
....
....
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...
.
.
.
.
.
.
.
.
.
.
...
.
.
.
..........
...................................................
.
.
.
.
.
.
.
.
.
.
.
.
.
.
....
.
.
.
.
.
.
...
.......
...... ... .... .... ............. ...............
.
.
.
.
.
.
.
.
.
.
.
.
....
.
.
...
.
.
........
........
. ... ...
......
......
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
....
....
.
.
.
.
.
.......
........
. .... ...
......
.....
.
.
.
.
.
.
.
.
.
.
.
...
.
.
.
.
.
.
.
.
....
.
.
.
.
........
......
. ... ...
.....
....
.
.
.
.
.
.
.
.
.
.
.
.
.
.
....
.
.
.
.
.
.
..
........ ....
...
.
...
..
........ ..... ....
...
.... ........ ..................
.
.
.
...
........ ... ..
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
........ ... ...
... .... ...........
...
..
.
....
.
.
.
.
...............
.
.
.
.
...........
...
.........
...
...
......
...
..............
..
..
................
..
..
........... ..... .....
..
.
... ..... .... ............
.
.
.
.
.
.
.
.
.
.
.
.
.
..
..
...
..
.. .. .. ......
....... .. ... ..
...
...
...
.. ................ ............
...... .... .... ....
...
...
.......
...
. .....
.......
...
..
..
..
..
....
...
..
..... .................
.. .............
..
.......................
...
.
..
..
... ......... ............ ...
.
.
..
.
.
.
.
.
.
.
.
.
.
.
.
..
.. ........... ............
.......
..
.........
..
....
....
...
...
........ .......
..
....... .... ......................
.
.
...
.
.
.
.
.
.
.
.
....
.
.
.
...
.
.
.
......... ......
...
.......... ..
....
.
..
...
.
.
.
.
.
.
.
.
.
.
.
.
...
...
.
.
.
.
...
... ..
.......
.
...
...
.
.
.
.
.
.
.
.
.
.
.
.
.
...
....
.
.
.
.
..
.
.
.......
.
.
... ...
...
....
.
.
.
.
...
..
.
.
.
.
.
.
.
....
.
.
....
.
.
.
....... . ......
....
...
..
... ...
.
.
....... .. .......
...
.
.
.
..
....
.
... ...
..............
.
.
..
.....
.
....
.
.
......
.............
. ....
.
.
.
.
.
.
.
...
.
....
.
...
.
.
...
.
..
..... .... ...........
.
...
..
.
......
.
..
.
.
.
.
.
.
.
.
.
.......
.
...
.
...
. ..
.
.
.
..
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.......
..
.
...
...
.
..
..
.......
..
... ....
.......
....
....
...
...
...
..
....... ....
... ............
...
...
..
...
...
...
..
........
... .........
..
..
...
..
...
....
....
..
.............
..
..
..
.
.
..
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.......
...
.
..
... .
..
..
..
.......
..
...
...
.....
....... ....
... ....
...
..
.......
...
..
.
.......
...
..
...
...
. ..
.......
... .......... .... ............
..
...
..
....... ............... ....
... .... ...... .........
..
...
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
....... ... ... ..
... ... .. .......
..
....... .... ...
...
... .. .. .......
...
...
........
..
...............
...
.
.....................................................................................................................................................................................................................................................
............
.
...
..
..........
.
.
.
.
.
.
.
.... .........
.
.
.
.
...
.
...... ......
.
..
.
.
.... .........
.
.
.
.
.
.
.
.
.
..
...
.... ........
..
..
......... ........
.....
.
...
..
..
.........
.
....... ................
.........
... ..... ....
......
.
.......
.........
.......
........ ................
... ... ..
.........
.......
.
.
.
.
.
.
........
.........
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.....
..........
.....
.
.
.
.
.
.
.
.
.
............ ................ ............. .................
..........................................
............
..................................................
.........
...............
............
.........
............
.........
..........
............
...
..
......
.....
and
|A B | = |AB| .
Sin
e the right triangles BM F and A C A are similar, as are the right triangles CN G and A B A, we have
BF
BM
=
=
AA
C A
and
from whi
h we obtain
CG
CN
=
=
AA
A B
BF CG =
1
AB
2
CA
1
CA
2
AB
1
|AA |2
4
2005 = 13572 + 14762 then at some time the lamps at the following latti e
35
points will be swit
hed on:
A1 (1357, 1476) ,
A2 (3 1357, 1476) ,
..
.
Ak (2k 1) 1357, 1476 ,
O1 (2 1357, 0) ,
O2 (4 1357, 0) ,
..
.
Ok (2k 1357, 0) ;
and then the lamps at these latti
e points will be swit
hed on:
B1 (2k 1357 2005, 0) ,
B2 (2k 1357 2 2005, 0) ,
B3 (2k 1357 3 2005, 0) ,
..
.
Bt (2k 1357 t 2005, 0) .
The equation 2k 1357 2005t = 1 is the same as 2714k 2005t = 1,
whi
h has a solution in positive integers k, t be
ause gcd(2714, 2005) = 1,
for example, 2714 1134 2005 1535 = 1. Thus the lamp at (1, 0) will be
swit
hed on at some time. It follows (by symmetry) that every lamp will be
swit
hed on at some time.
4. LetQ(n) denote thesum of the digits of the positive integer n. Prove
that Q Q Q(20052005 ) = 7.
9).
Q Q(20052005 ) ,
Let k = Q
(2)2005 = 2 22004 = 2 23
2(1)668 = 2 7 (mod 9)
668
Q Q 20052005
5 9 = 45
and hen
e k = Q Q Q(20052005 ) is at most Q(39) = 12.
Altogether, k is an integer satisfying 0 k 12 and k 7 (mod 9),
hen
e k = 7, as desired.
That
ompletes the Corner for this issue. Send me your ni
e solutions,
generalizations, and Olympiad problem sets.
36
BOOK REVIEWS
Amar Sodhi
37
But these problems are of the minor variety. This wonderful book is an
ex
ellent problems resour
e and should be
ome a part of any serious library
for problem solving. By
olle
ting together problems by topi
, the authors
provide readers the
han
e to study ea
h of these important problem-solving
te
hniques and ideas in isolation, and help them begin to see the inherent
patterns. This should be one of the rst books
onsidered as a resour
e by
anyone
oa
hing groups of problem solvers.
Mathemati
al Conne
tions: A Companion for Tea
hers and Others
By Al Cuo
o, Mathemati
al Asso
iation of Ameri
a, 2005
ISBN 978-0-88385-739-7, hard
over, 239+xix pages, US$54.95
Reviewed by Peter S. Brouwer, State University of New York, Potsdam,
NY, USA
Al Cuo
o is the Dire
tor of the Center for Mathemati
s Edu
ation at
the Edu
ation Development Center in Newton, MA, where he works in the
areas of
urri
ulum development and professional development of tea
hers.
This book joins a number of re
ent others in addressing se
ondary s
hool
mathemati
s
ontent topi
s from an advan
ed (or deeper) perspe
tive. The
primary audien
e is high s
hool mathemati
s tea
hers, and the book is based
on the assumption that providing a more advan
ed treatment of some of the
mathemati
al topi
s taught at that level is a valuable form of professional development. The author's emphasis is on making
onne
tions between topi
s
and developing mathemati
al habits of mind.
The
hoi
e of topi
s is somewhat idiosyn
rati
, and re
e
ts the interrelated topi
s that Cuo
o is interested in exploring. The
hapter titles are:
1. Dieren
e Tables and Polynomial Fits, 2. Form and Fun
tion: The Algebra of Polynomials, 3. Complex Numbers, Complex Maps, and Trigonometry,
4. Combinations and Lo
ks, and 5. Sums of Powers.
The strength of this book is that it is essentially a problems book (on
the above topi
s). There are many problems, in
luding 90 in the rst
hapter alone, and the reader is asked to work them sequentially while reading
through the text. These are grouped by themes, whi
h aids
oheren
e. In
addition, there are many problems given as exer
ises. The author in
ludes
helpful notes on sele
ted problems at the end of ea
h
hapter.
Many of the problems in this book are quite
hallenging, but its in
remental and themati
approa
h helps. As polynomial algebra (and patterns in
polynomial
oe
ients) appear in every
hapter, the reader must be
omfortable manipulating rather
ompli
ated algebrai
expressions. I would re
ommend this book for serious, mathemati
s-based professional development
programs as well as for experien
ed independent readers who would enjoy
pursuing a fruitful intelle
tual journey through sele
ted advan
ed se
ondary
mathemati
s topi
s.
38
Velo
ity Analysis: an Approa
h to Solving
Geometry Problems
Peng YuChen
Introduction
We introdu
e velo
ity analysis for solving otherwise
omplex geometry problems, then we give two examples of the use of this method: (1) to give a very
brief proof of the opti
al property of the ellipse, and (2) to nd the length of
a logarithmi
spiral. At the end of this note we leave some problems for the
reader; the solutions will be very brief if velo
ity analysis is used.
Velocity Analysis
In analyti
geometry, a
urve is a set of points whose
oordinates (x, y) satisfy a
ertain formula. For example, the set of points {(x, y) : x2 + y2 = R2 }
is a
ir
le or radius R.
As we all know, the tra
e of a moving point is a
urve. In the analyti
notion of a
urve above, we mainly pay attention to the position of a moving
point, rather than its velo
ity. In fa
t, either the position or the velo
ity of
a moving point
an des
ribe the
ourse of its motion, and in some
ases it
is more
onvenient to study the velo
ity rather than the position. If instead
of studying the
oordinates of a moving point we study its velo
ity, then
it is very simple for us to dedu
e
ertain geometri
properties of the tra
ed
urve without engaging in
omplex mathemati
s, espe
ially when seeking the
tangent or ar
length. (As we know, the velo
ity ve
tor of a moving point
gives a tangent to the
urve tra
ed by the point.)
Now we introdu
e the basi
idea of velo
ity analysis in solving geometry
problems.
A point P is moving under a ertain restri tion on its velo ity V . For
c 2009
39
...
.
..........
..
................................................................................
.
.
.
.
.
.
.
.
.
.
..
... ....
....
..... ...............
......
..
...
.. ......
......
....
.........
...
.............
.
.
.
...
.
.
.
......
.
.
...
.....
.
.
.
.
.
.
.
.
.
.
.
..
.....
..
.
.
.
.
.
.
.
..
.
.
.
.
...
.
...
........
.....
...
........
.
.
.
.
.
.
.
.
.
.
.
....................
................................r..........................................................................................................................................................r.................................................
.
... F1
F2 ..
.....
...
....
.
....
.
.
......
....
.
.....
.
.
.
........
.
...
............... ......... .....................
.............................
.
.........
....
.
Figure 1
............
............
............
............
............
............
.... ........................
.. ........ .. ................
... ... .............
........
.
.
.
............
.
.
.
........
.
.
............
........
...
............
........
.
.
.
.....
.
...
.
.
.
.....
.
.
.
.
.
.
.
.
.
..
.....
.
.
.
.
.
.
.
.
..
.....
.
.
.
.
.
.
.
.
...
...
........
...
........
.
........
...........................................................................................................................................................................................................................................
...........................................
.............
........
.
.
.
.
.
.
.
..
....
.
.
.......
.
.
...
....
..
... r
r ....
...
... F1
F2 ...
....
.
......
....
.
.
.
.
........
.
...............
.......
........................................
Figure 2
V2
are xed. A point P moves so that
.........
V
..
|P F1 |+|P F2 | is always a
onstant. We
F2 ..
ing point, P , has velo
ity ve
tor V .
....
.
......
....
.
.
.
.
Let V1 and V2 be the
omponents of V
........
.
.......
................
towards F1 and away from F2 , respe
......................................
..
...
.
...... ....
..
...
......
..
...
......
.
...
.
.
.
.
.
..
............ ......
...
............
..
.. ......................
...
.
............
..
............
..
............
...
..
............
............ ...........
.............. ...
..
... ..................
.
........... ... ..............
.
..
.
.
.. .... .................
.....
.
.......
............
........
............
...
........
............
...
........
.
...
.
.
...
.
.
.
.
.....
.
.
.
.
.
.
.
.
.
..
.. .........
...
........
.
.
.
.
.
.
.
.
.
.
..
..
........
...
........
.
........
............................................................................................................................................................................................................................................
......
40
It is obvious that the two denitions are equivalent. For when P moves
towards F1 a short distan
e, it must then move away from F2 by that same
V2........ A
....
Figure 4
....
.................
O
r
....
..
............
...
....
..
.
.
.
...
O
r
...
...
...
.
...........................................
..
.. .. ..
.. ... ..
.
.. ..... .... .....
. . .. ..
... .... ..... .....
...
.. ..
...
...
....
.....
...
.....................
...
..
.
...
.
.
.
1 .......
...
.
...
..
.
...
..
...
...
...
...
.
...
.
..
...
.
.
...
..
.
.
...
.
.
.
...
...
...
.
...
..
.
...
..
.
...
.
.
.
...
...
...
.
...
..
.
...
.
.
.
...
..
.
.
...
...
...
.
.
...
.
.
...
..
.
.
.
...........................................................................................................................................................................................................
...
...
...
.
....
......
... ....
...
...
...
...
.
...
...
...
..
...
.
.
...
.
.
...
...
.
...
..
...
.
.
.
...
.
...
...
.
...
..
.
...
.
.
.
...
..
.
...
.
.
...
.
.
...
..
.
.
...
..
.
...
.
.
.
...
.
...
...
.
...
..
.
...
..
...
.
.
.
...
.
...
...
.
...
..
.
...
.
.
...
.
...
...
.
...
..
.
...
.
.
.
...
..
.
..
.
...........................................................................................................................................................................................................
....
..
.
.
.
...
.................
Figure 5
The solution of this problem is easy: obviously the three points will
meet at the point O, whi
h is the
entre of the triangle. We de
ompose the
velo ity V of A at ea h instant into two omponents: one towards the point
and V2 , respe
tively. We have that |V1 | = | V | cos 30 = 23 s (see Figure 5),
0
0
so the time until they meet is t =
and the distan
e traveled
=
is
2
d = st = 0 .
3
|V 1 |
( 3/2)s
system with the origin at O and with the ve tor V2 pointing in the dire tion
d
|V 2 | =
and |V1 | = d
, we have d = ad, the dierential equation
dt
dt
|V 1 |
41
........
the problem of nding a suitable physi
al model for other values of a to the
reader.
We leave three more problems for the reader to
...
Figure 6
solve. They
ould be solved by using analyti
ge...
ometry and
al
ulus, but are more
onveniently
.
solved using the approa
h of velo
ity analysis.
..... ..... A
1. The pursuant traje
tory problem. As in Figure
.. ..r 1
.
.
6, suppose that an obje
t A starts from the point
..
.
(0, 1), and moves with a
onstant speed s in the
.
B .
dire
tion of the positive y{axis. At the same time
..
.
.
another obje
t B starts from the point (1, 0),
.r.....
and moves with speed 2s and always in the dire
0
1
tion of the obje
t A. When will the obje
ts meet?
2. The opti
al property of a hyperbola. If a light ray leaves one fo
us of a
hyperbola and strikes the hyperbola, then the (reverse) extended line of its
re
e
tion will pass through the other fo
us of the hyperbola (see Figure 7).
3. The opti
al property of a parabola. If a light ray leaving the fo
us is re
e
ted in the parabola, then its re
e
tion is parallel to the axis of symmetry
(see Figure 8).
.......
.
....
....
...
....
...
....
....
....
...
....
...
....
....
....
...
....
....
....
...
....
...
....
....
....
...
....
....
.............................................................................................................................
.
..
...
.....
.
...
.
.
.
..
...
F2
Figure 7
.............
F1...
..
...............
.
.
.
.
.
.
.
.
.
.
.
.
.
.........
............
.
.
.
.
.
.
.
.
.
......
........
.
.
.
.
.
..
.....
...
... r
... F
.....
.......
........
.........
...........
............
.............. Figure 8
................
......
...
....
..
.....
...
....
....
........ .... .... .... .... .... .... .... .... .....................................................................
....
....
....
....
...
.
.
....
.
..
....
...
...
....
....
.
.
.
...
..
...
..................................................................................................................................................................................................................................
...
..
.....
...
....
....
...
....
....
...
....
....
....
....
...
...
.
.........
.
.
...........
...... ...
.......... ..
.......... ...
. ....... ..
........
......
........ ....
..... ....
... .. .... ....
... .. .... ..
... .. . ...
...
... ..
...
... ..
.
..........................................................................r.................................................
................................................................r
.
Referen es
42
PROBLEMS
Solutions to problems in this issue should arrive no later than 1 August 2009.
An asterisk () after a number indi
ates that a problem was proposed without a
solution.
Ea
h problem is given in English and Fren
h, the o
ial languages of Canada.
In issues 1, 3, 5, and 7, English will pre
ede Fren
h, and in issues 2, 4, 6, and 8,
Fren
h will pre
ede English. In the solutions' se
tion, the problem will be stated in
the language of the primary featured solution.
The editor thanks Rolland Gaudet of the University College of Saint Bonifa
e
and Jean-Mar
Terrier of the University of Montreal for translations of the problems.
3401. Proposed by Tigran Sloyan, Basi
Gymnasium of SEUA, Yerevan,
Armenia.
Let ABCDE be a
onvex pentagon su
h that BAC = EAD and
BCA = EDA, and let the lines CB and DE interse
t in the point F .
Prove that the midpoints of CD, BE , and AF are
ollinear.
3402. Proposed by Mihaly Ben
ze, Brasov, Romania.
Let D and E be the midpoints of the sides AB and AC in triangle
ABC , respe
tively. Prove that CD is perpendi
ular to BE if and only if
5BC 2 = AC 2 + AB 2 .
43
3406. Proposed by Jose Luis Daz-Barrero and Miquel Grau-San
hez,
Universitat Polite
ni
a
de Catalunya, Bar
elona, Spain.
Find
"
#
n
1 Y
lim ln
2n
2+
k=1
n2
(b) If x S , then
x3 1007x + 3007 S .
ci q ci
i=1
1+
q ci
q
1q
i=1
1
0, 2 .
min
a 2 + b2
c2 + d2 a 2 + c2
b2 + d2 a 2 + d2
b2 + c2
+
,
+
,
+
3/2
3/2
3/2
3/2
3/2
(ab)
(cd)
(ac)
(bd)
(ad)
(bc)3/2
y li
b+c
F
2R
44
3411. Proposed by Mihaly Ben
ze, Brasov, Romania.
Let a, b, and c be positive real numbers su
h that
a6 + b6 + c6 <
32
33
a3 + b3 + c3
2
ax2 + bx + c, bx2 + cx + a,
or
3412. Proposed by Cao Minh Quang, Nguyen Binh Khiem High S
hool,
Vinh Long, Vietnam.
Let a, b, and c be positive real numbers su
h that abc = 1. Prove that
X
y li
1
1.
3
a + 2b3 + 6
3413. Proposed by Vo Quo
Ba Can, Can Tho University of Medi
ine and
Pharma
y, Can Tho, Vietnam.
Let a, b, c, and d be real numbers in the interval [1, 2]. Prove that
a+b
c+d
c+d
a+b
a+c
b+d
3
2
.................................................................
3401. Propose par Tigran Sloyan, Ly
ee
de la SEUA, Erevan, Armenie.
Soit ABCDE un pentagone
onvexe tel que BAC = EAD et
BCA = EDA. Soit F le point d'interse
tion des droites CB et DE .
Montrer que les milieux des CD, BE et AF sont
olineaires.
3402. Propose par Mihaly Ben
ze, Brasov, Roumanie.
Soit le triangle ABC , ou D et E sont les milieux des
ot
^ es
AB et AC ,
respe
tivement. Montrer que CD est perpendi
ulaire a BE si et seulement
si
5BC 2 = AC 2 + AB 2 .
3403. Propose par D.J. Smeenk, Zaltbommel, Pays-Bas.
Les
er
les 1 et 2 interse
tent a P et Q. Une ligne passant par P
interse
te une se
onde fois 1 et 2 a A et B , respe
tivement. Les tangentes
de 1 et 2 a A et B interse
tent a C . Si O est le
entre du
er
le
ir
ons
rit
du ABC determiner
le lieu de O lorsque tourne autour de P .
45
3404. Propose par Mi
hel Bataille, Rouen, Fran
e.
Soit Q un quadrilatere
y
lique. Les perpendi
ulaires a
haque diagonale issues de ses sommets forment un parallelogramme
P . Cara
teriser
le
^ es
opposes
de Q se
oupent sur une dia
entre de P et montrer que les
ot
gonale de P .
3405. Propose par Mi
hel Bataille, Rouen, Fran
e.
Determiner
la valeur minimum de
| cos | + | cos | + | cos | + | cos( )| + | cos( )| + | cos( )| ,
lim ln
2n
2+
k=1
n2
ci q ci
i=1
1+
q ci
q
1q
i=1
1
0, 2 .
min
a 2 + b2
c2 + d2 a 2 + c2
b2 + d2 a 2 + d2
b2 + c2
+
,
+
,
+
(ab)3/2
(cd)3/2 (ac)3/2
(bd)3/2 (ad)3/2
(bc)3/2
46
3410. Propose par Joe Howard, Portales, NM, E-U.
Soit a, b et c les
ot
^ es
du triangle ABC , soit R le rayon de son
er
le
ir
ons
rit et F son aire. Montrer que
X bc sin2 A/2
F
b+c
2R
y
lique
2
32 3
a + b3 + c3
33
a + 2b + 6
.
c+d
a+b
b+d
47
SOLUTIONS
No problem is ever permanently
losed. The editor is always pleased
to
onsider for publi
ation new solutions or new insights on past problems.
Last year we re
eived a bat
h of
orre
t solutions from Steven Karp,
student, University of Waterloo, Waterloo, ON, to problems 3289, 3292, 3294,
3296, 3297, 3298, and 3300, whi
h did not make it into the De
ember issue
due to being misled. Our apologies for this oversight.
3301. [2008 : 44, 46 Proposed by Ovidiu Furdui, University of Toledo,
Toledo, OH, USA.
Prove that
1
1
1
1
1
ln 2
+
+ +
1 + + +
X
X
n+1
n+2
2n
2
n
=
n
(2n + 1)(2n + 2)
n=1
n=1
Solution by Manuel Benito, Os
ar
Ciaurri, and Emilio Fernandez, Logrono,
~
Spain, expanded by the editor.
Let A and B denote the summations on the left side and the right side
of the proposed equality, respe
tively. Also, let Hn = 1 + 21 + + n1 . Then
1
n+1
=
1
1
+ +
= H2n Hn
n+2
2n
2n
X
1
1
1
(1)j1
H2n 2
+ + +
=
2
4
2n
j
j=1
+
P
(1)j 1
X
1
n=1
k=1
j1
(1)
H j1 =
2
Hk
(2k + 1)(2k + 2)
j=2n+1
X
(1)j1
j=3
= ln 2,
j=1
Hk
k=1
1
2k + 1
X
1+
n=1
X
(1)j1
j=3
1
2
j1
2
X 1
n=1
2k + 2
+ +
1
n
(2n + 1)(2n + 2)
= B.
48
To nd the
ommon value of the two absolutely
onvergent series, let
X
(1)j1
f (x) =
j=3
H j1 xj ,
2
where the power series for f
onverges for all x (1, 1). Then
f (x)
=
=
(1)j1 H j1 xj1 =
j=3
(1)j H j xj
2
j=2
n=1
Hn x2n .
(1)
n=1
[Ed : Multiply 1 1 x
ln
1
1x
= 1+x+x2 +
Hn xn .
(2)
n=1
with ln(1x) = x+ 12 x2 + 13 x3 +
n=1
(1 x)
n=1
Hn xn = ln(1 x).
Hn x2n = ln(1 x2 ),
n=1
Hn x2n =
1
1+x
ln(1 x2 ) .
(3)
1
ln(1 x2 ) .
1+x
lim f (x) =
x1
f (x) dx =
1
0
ln 1 x2
dx .
1+x
(4)
1
0
ln 1 x2
1+x
dx =
1/2
ln 4u(1 u)
u
du = I1 + I2 ,
(5)
49
where
I1
1
ln(4u)
1 2
1
du =
ln (4u)
=
(ln 4)2 (ln 2)2
u
2
2
1/2
1/2
1
3
1
(ln 4 + ln 2)(ln 4 ln 2) = (ln 8)(ln 2) = (ln 2)2 .
2
2
2
=
=
(6)
On the other hand, using integration by parts and then making the
hange of variable u = 1 t, we have
I2
1
Z 1
ln(1 u)
ln u
=
du = (ln u) ln(1 u)
+
du
u
1/2
1/2 1 u
1/2
Z 1/2
Z 1
ln(1 t)
ln(1 t)
= (ln 2)2 +
dt = (ln 2)2 +
dt I2 ,
t
t
0
0
Z
1
0
ln(1 t)
dt .
t
(7)
u)
at u = 1 must be done by
omputing lim (ln u) ln(1 u) using L'Hospital's
^
Rule.
u1
Finally,
Z 1
1
1
ln(1 t)
dt =
ln
dt
t
1t
0 t
0
!
Z 1
Z 1 n1
X
1 X tn
t
=
dt =
dt
t
n
n
0
n=1
n=1 0
Z
n=1
X
tn 1
1
2
=
n2 0
n2
6
n=1
(8)
2
(ln 2)2 .
12
50
Solution by Mi
hel Bataille, Rouen, Fran
e.
First, using the two known formulas s2 + r2 + 4Rr = ab + bc + ca and
abc = 4Rrs, where a, b, and c are the sides of the triangle, we dedu
e that
(a + b)(b + c)(c + a) =
=
=
a2 b3 + a3 b2 + b2 c3 + b3 c2 + c2 a3 + c3 a2
= abc.
8Rrs(5s2 + r 2 + 4Rr) ,
2e3 e21 + e2 ,
2e3 e21 ,
and nally to
a2 (b c)2 (b + c) + b2 (c a)2 (c + a) + c2 (a b)2 (a + b) 0 .
The last inequality is obviously true, whi
h
ompletes the proof. Equality
holds if and only if a = b = c, that is, if and only if the triangle ABC is
equilateral.
Also solved by ARKADY ALT, San Jose, CA, USA ; GEORGE APOSTOLOPOULOS,
University of Sarajevo, Sarajevo, Bosnia and
Messolonghi, Gree
e ; SEFKET
ARSLANAGIC,
Herzegovina ; ROY BARBARA, Lebanese University, Fanar, Lebanon ; CHIP CURTIS, Missouri
Southern State University, Joplin, MO, USA ; CHARLES R. DIMINNIE, Angelo State
University, San Angelo, TX, USA ; OLIVER GEUPEL, Bruhl,
NRW, Germany ; JOE HOWARD,
Portales, NM, USA ; WALTHER JANOUS, Ursulinengymnasium, Innsbru
k, Austria ; KEE-WAI
LAU, Hong Kong, China ; THANOS MAGKOS, 3rd High S
hool of Kozani, Kozani, Gree
e ; SALEM
student, Sarajevo College, Sarajevo, Bosnia and Herzegovina ; ANDREA MUNARO,
MALIKIC,
student, University of Trento, Trento, Italy ; PANOS E. TSAOUSSOGLOU, Athens, Gree
e ;
GEORGE TSAPAKIDIS, Agrinio, Gree
e ; PETER Y. WOO, Biola University, La Mirada, CA, USA ;
TITU ZVONARU, Comane
sti, Romania ; and the proposer.
y li
2(a + b)3
y li
(a + s1 )(bc + s2 ) ,
51
Composite of similar solutions by Manuel Benito, Os
ar
Ciaurri, Emilio
Fernandez, and Luz Ron
al, Logrono,
~ Spain ; and Chip Curtis, Missouri
Southern State University, Joplin, MO, USA.
By straightforward
omputations, we have
2(a + b)(b + c)(c + a) (a + s1 )(bc + s2 )
= 2(a + b)(b + c)(c + a) (2a + b + c)(ab + 2bc + ca)
= 2(a2 b + ab2 + b2 c + bc2 + c2 a + ca2 + 2abc)
(2a2 b + ab2 + 2b2 c + 2bc2 + c2 a + 2ca2 + 6abc)
= ab2 + ac2 2abc = a(b c)2 0 .
Hen e,
Similarly, we have
The result now follows by multiplying a
ross the last three inequalities.
Also solved by ARKADY ALT, San Jose, CA, USA ; GEORGE APOSTOLOPOULOS,
University of Sarajevo, Sarajevo, Bosnia and HerMessolonghi, Gree
e ; SEFKET
ARSLANAGIC,
zegovina ; DIONNE BAILEY, ELSIE CAMPBELL, and CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA ; MICHEL BATAILLE, Rouen, Fran
e ; CAO MINH QUANG, Nguyen
Binh Khiem High S
hool, Vinh Long, Vietnam ; OLIVER GEUPEL, Bruhl,
NRW, Germany ;
student, Sarajevo College, Sarajevo, Bosnia and Herzegovina ; ANDREA
SALEM MALIKIC,
MUNARO, student, University of Trento, Trento, Italy ; NGUYEN MANH DUNG, High s
hool
student, HUS, Hanoi, Vietnam ; PAOLO PERFETTI, Dipartimento di Matemati
a, Universita
degli studi di Tor Vergata Roma, Rome, Italy ; DANIEL TSAI, student, Taipei Ameri
an S
hool,
Taipei, Taiwan ; PANOS E. TSAOUSSOGLOU, Athens, Gree
e ; GEORGE TSAPAKIDIS, Agrinio,
Gree
e ; PETER Y. WOO, Biola University, La Mirada, CA, USA ; TITU ZVONARU, Comane
sti,
Romania ; and the proposer.
k=1
Similar solutions by Mi
hel Bataille, Rouen, Fran
e ; Walther Janous, Ursulinengymnasium, Innsbru
k, Austria ; Steven Karp, student, University of
Waterloo, Waterloo, ON ; Xavier Ros, student, Universitat Polite
ni
a
de Catalunya, Bar
elona, Spain ; and Daniel Tsai, student, Taipei Ameri
an S
hool,
Taipei, Taiwan.
Reorder the numbers a1 , a2 , . . . , an from smallest to largest and rename them x1 , x2 , . . . , xn . Then 0 x1 x2 xn and if yi = x2i
52
for ea
h i then we also have 0 y1 y2 yn . The Rearrangen
n
P
P
ment Inequality states that
xi yi
xi y(i) for any permutation of
{1, 2, . . . , n}.
n
P
i=1
i=1
n
P
n
P
Sin
e
=
xi yi and
ak a2k+1
k=1
i=1
k=1
appropriate permutation , the result follows.
a3k
n
P
xi y(i)
i=1
for an
Also solved by MOHAMMED AASSILA, Strasbourg, Fran
e ; ARKADY ALT, San Jose,
UniCA, USA ; GEORGE APOSTOLOPOULOS, Messolonghi, Gree
e ; SEFKET
ARSLANAGIC,
versity of Sarajevo, Sarajevo, Bosnia and Herzegovina ; ROY BARBARA, Lebanese University,
Fanar, Lebanon ; MANUEL BENITO, OSCAR
CIAURRI, EMILIO FERNANDEZ, and LUZ
RONCAL, Logrono,
~ Spain ; CAO MINH QUANG, Nguyen Binh Khiem High S
hool, Vinh Long,
Vietnam ; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA ; OVIDIU
FURDUI, University of Toledo, Toledo, OH, USA ; OLIVER GEUPEL, Bruhl,
NRW, Germany ;
student, Sarajevo College, Sarajevo, BosJOE HOWARD, Portales, NM, USA ; SALEM MALIKIC,
nia and Herzegovina ; DUNG NGUYEN MANH, High S
hool of HUS, Hanoi, Vietnam ; PAOLO
PERFETTI, Dipartimento di Matemati
a, Universita degli studi di Tor Vergata Roma, Rome,
Italy ; HENRY RICARDO, Medgar Evers College (CUNY ), Brooklyn, NY, USA ; PANOS
E. TSAOUSSOGLOU, Athens, Gree
e ; GEORGE TSAPAKIDIS, Agrinio, Gree
e ; PETER Y. WOO,
Biola University, La Mirada, CA, USA ; TITU ZVONARU, Comane
sti, Romania ; and the proposer.
Ri
ardo
omments that this problem appears as Problem 11.7 on p. 148 of Elementary
Inequalities by D.S. Mitrinovi
(P. Nordho, 1964), but that no solution is provided there.
6
2
+ 4 sin
13
13
4
+ 4 sin
13
5
tan
+ 4 sin
13
= tan
=
13
q
2
=
13 + 2 13 .
13
Solution by Manuel Benito, Os
ar
Ciaurri, Emilio Fernandez, and Luz Ron
al,
Logrono,
~ Spain, in memory of Jim Totten.
We will prove that
tan
2
6
+ 4 sin
13
13
5
+ 4 sin
13
6
4 sin
= tan
13
= tan
and
tan
4
13
+ 4 sin
13
= tan
= tan
13
3
13
+ 4 sin
+ 4 sin
2
13
q
5
=
13 + 2 13
13
(1)
3
13
4
13
13 2 13 .
(2)
We will make use of two elegant results due to K.F. Gauss and in
luded in
the Se
tio VII of the Disquisitiones Arithmeti
(DA).
53
Lemma (DA, art. 362, II). Let n > 1 be an odd number and =
k
2k
,
n
where
tan = 2 sin(2) sin(4) + sin(6) + sin (n 1) .
Theorem (DA, art. 356). Let n > 1 be an odd prime number, R be the set of
the (positive and less than n) quadrati
residues modulo n, and N be the set
of the (positive and less than n) quadrati
non-residues modulo n. Then,
and
X
2m
2r
n if
cos
=
cos
0 if
n
n
rR
mN
X
rR
sin
X
2r
2m
0
sin
=
n
n
n
mN
For n = 13 with =
2k
n
if
if
n 1 (mod 4)
n 3 (mod 4)
,
,
n 1 (mod 4)
n 3 (mod 4)
,
.
tan = 2 sin(2) sin(4) + sin(6) sin(8) + sin(10) sin(12) .
. (3)
6
2
3
4
5
6
tan
= 2 sin
+ sin
+ sin
+ sin
+ sin
+ sin
. (4)
tan
2
4
5
3
6
2
= 2 sin
sin
+ sin
+ sin
sin
+ sin
13
13
13
13
13
13
13
If k = 3 and =
13
13
If k = 4 and =
tan
6
,
13
8
,
13
13
then tan 5
13
13
= tan
13
8
13
13
13
. (5)
. (6)
. (7)
5
3
6
4
2
5
= 2 sin
+ sin
+ sin
+ sin
sin
sin
13
13
13
13
13
13
13
By
omparing the equations (3), (4), and (5) we see that the rst three
expressions in equation (1) are equal.
If k = 2 and = 4
, then the Lemma yields
13
tan
4
5
3
2
6
4
= 2 sin
+ sin
sin
sin
sin
+ sin
13
13
13
13
13
13
13
If k = 5 and =
tan
10
,
13
then tan 3
13
= tan
10
13
5
2
4
3
3
= 2 sin
sin
sin
+ sin
+ sin
sin
13
13
13
13
13
13
13
54
If k = 6 and =
tan
12
,
13
then tan 13
= tan
12
13
2
4
6
5
3
= 2 sin
sin
+ sin
sin
+ sin
sin
13
13
13
13
13
13
13
. (8)
By
omparing the equations (6), (7), and (8) we see that the rst three
expressions in equation (2) are equal.
6
and B = tan 4
Now we take A = tan 2
+ 4 sin
+ 4 sin .
13
13
13
13
Clearly A and B are positive numbers. From (3) and (6) it follows that
3
4
A + B = 4 sin
+ sin
+ sin
13
and
13
13
5
6
2
sin
+ sin
A B = 4 sin
13
Then,
13
13
3
4
2
5
6
A2 B 2 = 16 sin
+ sin
+ sin
sin
sin
+ sin
2
3
4
5
6
A2 B 2 = 8 cos
+ cos
+ cos
cos
cos
+ cos
13
13
13
13
13
13
13
13
13
13
13
However, for n = 13 1 (mod 4), the sets R and N in the Theorem are
R = {1,4,9,3,12,10} and N = {2,8,6,11,5,7} ; thus, by the Theorem
2
6
5
3
4
2 cos
+ cos
cos
+ cos
+ cos
cos
=
13 ,
13
13
and therefore
13
13
13
13
A2 B 2 = 4 13 .
=
=
2
3
4
5
6
4 sin
+ sin
+ sin
+ sin
sin
+ sin
13
13
13
13
13
13
2
3
4
5
6
sin
sin
+ sin
+ sin
+ sin
sin
13
13
13
13
13
13
2
3
4
5
6
+ cos
+ cos
cos
cos
+ cos
6 cos
13
13
6 13
= 3 13 .
2
13
13
13
13
13 + 2 13
and
B =
13 2 13 .
55
This
ompletes the proof of the identities (1) and (2). The following similar
identities
an be dedu
ed when n = 11 :
tan
+ 4 sin
11
11
2
5
+ 4 sin
11
11
3
2
4
tan
+ 4 sin
= tan
+ 4 sin
11
11
11
11
5
4
tan
4 sin
11
11
= tan
=
=
=
11 .
University of Sarajevo, Sarajevo, Bosnia and HerAlso solved by SEFKET
ARSLANAGIC,
zegovina ; MICHEL BATAILLE, Rouen, Fran
e ; APOSTOLIS K. DEMIS, Varvakeio High S
hool,
Athens, Gree
e (2 solutions) ; JOHN HAWKINS and DAVID R. STONE, Georgia Southern University, Statesboro, GA, USA ; and PETER Y. WOO,
Biola University, La Mirada, CA, USA.
q
All solvers noted that tan 13 +4 sin 13 6= 13 + 2 13, as did George Apostolopoulos,
Messolonghi, Gree
e ; and Luyan Zhong-Qiao, Columbia International College, Hamilton, ON.
Wagon used Mathemati
a to
he
k that the rst and third identities are
orre
t and the se
ond
is in
orre
t. The proposer oered a partially
orre
t solution.
2,
g(t) =
3,
and
h(t) =
7.
Set = 2 + 3 + 7 and = 2 3 7. Computing 3 , 5 , and 7 ,
we obtain
2 +
3 +
7
16 2 + 15 3 + 11 7 + 3
This is a
1 3
,
2
1 5
281 2 + 241 3 + 161 7 + 60 =
,
4
1 7
4796 2 + 3975 3 + 2611 7 + 1043 =
.
8
linear system for 2, 3, 7, and . Solving for 2, 3,
=
and
56
yields
59
1
1 5
3 +
,
20
2
80
313
297 3
67 5
3 7
=
+
,
80
160
320
640
469
377 3
71 5
3 7
=
+
+
.
80
160
320
640
=
2+ 3+ 7
Finally, setting t = 80
=
we obtain 2 = f (t), 3 = g(t),
80
and 7 = h(t), where the polynomials f (x), g(x), and h(x) have integer
oe
ients :
f (x)
= 236x
g(x)
= 313x
h(x)
= 469x +
2
1
2
(80)3 x3 + (80)4 x5 ,
(80)2 297x3 +
1
2
1
4
(80)2 377x3
(80)4 67x5
1
4
3
8
(80)6 x7 ,
(80)4 71x5 +
3
8
(80)6 x7 .
= cos( + ) ,
= 2 sin( + ) .
Similar solutions by Manuel Benito, Os
ar
Ciaurri, Emilio Fernandez, and
Luz Ron
al, Logrono,
~ Spain ; Joe Howard, Portales, NM, USA ; and George
Tsapakidis, Agrinio, Gree
e.
The given system
an be rewritten as a linear system in cos and sin :
cos cos sin sin
sin cos + cos sin
= (cos2 sin2 ) ,
= sin cos .
and
sin = sin3 ;
57
when
e,
(1)
Comments from the Spanish team. Note that the original system has a solution if and only if and satisfy (1). In parti
ular, letting x = cos and
y = sin , we see that for 1 || 2 the solutions
an be represented
by the interse
tion points of the unit
ir
le x2 + y2 = 1 with the astroid
x2/3 + y 2/3 = 2/3 . Thus for ea
h with absolute value between 1 and 2,
(1) will be satised for eight values of ; for {1, 2}, it will be satised by four values of . There
an be no real solutions for other values of
.
Also solved by ARKADY ALT, San Jose, CA, USA ; GEORGE APOSTOLOPOULOS,
University of Sarajevo, Sarajevo, Bosnia and
Messolonghi, Gree
e ; SEFKET
ARSLANAGIC,
Herzegovina ; MICHEL BATAILLE, Rouen, Fran
e ; CHIP CURTIS, Missouri Southern State
University, Joplin, MO, USA ; APOSTOLIS K. DEMIS, Varvakeio High S
hool, Athens, Gree
e ;
JOSE LUIS D I AZ-BARRERO, Universitat Polite
ni
a
de Catalunya, Bar
elona, Spain ; OLIVER
GEUPEL, Bruhl,
NRW, Germany ; JOHN HAWKINS and DAVID R. STONE, Georgia Southern
University, Statesboro, GA, USA ; WALTHER JANOUS, Ursulinengymnasium, Innsbru
k,
Austria ; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA ; ANDREA MUNARO,
student, University of Trento, Trento, Italy ; PAOLO PERFETTI, Dipartimento di Matemati
a,
Universita degli studi di Tor Vergata Roma, Rome, Italy ; XAVIER ROS, student, Universitat Polite
ni
a
de Catalunya, Bar
elona, Spain ; BOB SERKEY, Leonia, NJ, USA ; PANOS E. TSAOUSSOGLOU, Athens, Gree
e ; and the proposer. There was one in
orre
t submission.
Our readers produ
ed solutions in a variety of formats. Here are a few of the ni
est.
Instead of (1), Alt, Bataille, and the proposer independently obtained the equivalent equation
sin2 (2) =
3
4 2 1
272
Geupel found that in terms of a real parameter t, the solutions of the given system satisfy
= arctan t + m ,
= arctan(t ) + n ,
3
and
m+n
= (1)
(1 + t2 )3
1 + t6
for integers m and n. In addition, there were several impli
it solutions where
the solver simply
presented an equation for in terms of or ; for example, = arctan 3 tan + k
ame
from Arslanagi
and from Ros.
3
sin B
a.
2
58
We start with the inequality
1
=
3
1
cos A +
sin A ,
2
2
whi h is equivalent to
3 cos A sin A .
(1)
a2 2 sin A .
sin A
sin B
= ,
a
3
(2)
or
a =
3 sin A
sin B
3 sin A
sin B
2 sin A ,
3BC
.
2
3BC
AD = d(A, BC) d(N, BC) =
2
59
MO, USA ; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA ; IAN
JUNE L. GARCES, Ateneo de Manila University, Quezon City, The Philippines ; FRANCISCO
IES Alvarez
JAVIER GARC I A CAPITAN,
Cubero, Priego de Cordoba,
Spain ; OLIVER GEUPEL,
Bruhl,
NRW, Germany ; STEVEN KARP, student, University of Waterloo, Waterloo, ON ;
Y,
Big Rapids, MI, USA ; KEE-WAI LAU, Hong Kong, China ; THANOS
V ACLAV
KONECN
student, Sarajevo
MAGKOS, 3rd High S
hool of Kozani, Kozani, Gree
e ; SALEM MALIKIC,
College, Sarajevo, Bosnia and Herzegovina ; ANDREA MUNARO, student, University of
Trento, Trento, Italy ; JOEL SCHLOSBERG, Bayside, NY, USA ; PANOS E. TSAOUSSOGLOU,
Athens, Gree
e ; GEORGE TSAPAKIDIS, Agrinio, Gree
e ; DANIEL TSAI, student, Taipei
Ameri
an S
hool, Taipei, Taiwan ; PETER Y. WOO, Biola University, La Mirada, CA, USA ; TITU
ZVONARU, Comane
sti, Romania ; and the proposer.
q
More generally, Kone
ny proved that AD 2
BC if AC : AB = q with q > 1.
q 1
His argument was mu
h like that of solution II above.
=
=
1,
1,
(1)
[1 + ( )z] 4(z 2 z + ) = 0 ,
2
(2)
( + )2 ( )2 4 (1 4) = 0 ,
2 + 2 + 2 + 1 = 2( + + ) .
(3)
60
Now, suppose (3) holds. Then we have
( )2 4 = 2 + 2 + 2 2 2 2 = 1 .
=
=
1 + ( )( + )
1 + ( )2 2
2
2
2 2 + 2 + 2
1 + 2 2 + 2 2
=
= +.
2
2
1 y z = 1 ( + ) ( + )
2 + + ,
Also solved by ARKADY ALT, San Jose, CA, USA ; GEORGE APOSTOLOPOULOS, Messolonghi, Gree
e ; ROY BARBARA, Lebanese University, Fanar, Lebanon ; MICHEL BATAILLE,
Rouen, Fran
e ; MANUEL BENITO, OSCAR
CIAURRI, EMILIO FERNANDEZ, and LUZ RONCAL,
Logrono,
~ Spain ; CHIP CURTIS, Missouri Southern State University, Joplin, MO, USA ; OLIVER
GEUPEL, Bruhl,
NRW, Germany ; STEVEN KARP, student, University of Waterloo, Waterloo,
ON ; PAOLO PERFETTI, Dipartimento di Matemati
a, Universita degli studi di Tor Vergata
Roma, Rome, Italy ; DANIEL TSAI, student, Taipei Ameri
an S
hool, Taipei, Taiwan ; PETER
Y. WOO, Biola University, La Mirada, CA, USA ; TITU ZVONARU, Comane
sti, Romania ; and
the proposer. There was also one partially in
orre
t solution submitted.
2s(s a)x
x2 + s(s a)
if and only if x = rb
if and only if
61
Similar solutions by Mi
hel Bataille, Rouen, Fran
e ; Oliver Geupel, Bruhl,
NRW, Germany ; Titu Zvonaru, Comane
sti, Romania ; and the proposer.
It is well known that the area F of ABC
p
an be variously expressed
as 12 aha , rs, ra (s a), rb (s b), rc (s c), or s(s a)(s b)(s c). We
have
rb + rc
sb
sc
F (2s b c)
(s b)(s c)
a F (s a)
as(s a)
=
s(s a)(s b)(s c)
F
2as(s a)
aha
2s(s a)
(1)
ha
and
rb rc
F2
(s b)(s c)
= s(s a) .
(2)
It follows from (1) and (2) that x = rb and x = rc are the solutions of
ha x2 2s(s a)x + ha s(s a) = 0 ,
=
=
F
sa
F
s
aF
s(s a)
2(s b)(s c)
a F (s b)(s c)
=
2
F
ha
and
ra r =
F2
= (s b)(s c) .
s(s a)
(3)
(4)
62
3311. [2008 : 46, 48 Proposed by Mi
hel Bataille, Rouen, Fran
e.
Let n be an integer with n 2. Suppose that for k = 0, 1, . . . , n 2
we have
n2
(1)k (k + 1) (mod n) .
k
6 (1)k (k + 1) (mod n)
(1)
Toward that end, let p be the least prime fa
tor of n. If (1) holds for some
k < p, then we are done. Otherwise the given
ongruen
e holds in parti
ular
for k = p 2, and we have
n2
n2
np
(p 1)
=
(n p 1)
p
p2
p
n
(1)p2 (p 1)
1 (p 1)
p
n
(p 1) (1)p p + 1
(mod n) .
p
Be
ause p 1 is
oprime to the modulus n, we
an divide both sides by it
and
on
lude that (1) holds with k = p :
n2
p
n
(1)p p + 1
6 (1)p (p + 1) (mod n)
p
Also solved by MANUEL BENITO, OSCAR
CIAURRI, EMILIO FERNANDEZ, and
LUZ RONCAL, Logrono,
~ Spain ; JOHN HAWKINS and DAVID R. STONE, Georgia Southern
University, Statesboro, GA, USA ; STEVEN KARP, student, University of Waterloo, Waterloo,
student, Sarajevo College, Sarajevo, Bosnia and Herzegovina ; DAVID
ON ; SALEM MALIKIC,
E. MANES, SUNY at Oneonta, Oneonta, NY, USA ; JOEL SCHLOSBERG, Bayside, NY, USA ; and
the proposer.
The
onverse is a known result : If p is a prime, then p2
(1)k (k + 1) (mod p)
k
for k = 0, 1, . . . , p 2. Karp provided a simple proof (by indu
tion on k) ; Bataille provided
a referen
e : E. Lu
as, Theorie
des nombres, A. Blan
hard (1961), p. 420.
a1
a2
+ +
ak
63
Solution by Steven Karp, student, University of Waterloo, Waterloo, ON.
We solve the problem for all positive integers n. If n 0 or 3 (mod 6),
1
then n3 = n/3
. If n 1 (mod 6), then
3
=
n
If n 2
1
n+1
3
n(n+1)
3
If n 1
(mod 6)
1
n+c
3
n(n+c)
3c
(mod 6),
then
We see that k is minimal in all of these
ases, sin
e n3 = a1 for some positive
1
integer a1 only if n 0 (mod 3). Now, if n > 1, n 1 (mod 6) and all
divisors of n are
ongruent to 1 modulo 6, then
3
=
n
1
n+1
2
1
+
n
1
n(n+1)
2
and we
laim that k = 3 is minimal in this
ase. To prove this suppose for
the sake of
ontradi
tion that
3
n
1
a
1
b
b(3a n)
a
b
p
(3a n) 3a n 1 or 2 (mod 6)
a
ontradi
tion.
Finally, for n = 1 we have
3 = 1+
1
1
1
1
1
1
1
1
1
1
1
1
+ + + + + + + +
+
+
+
2
3
4
5
6
7
8
9
10
15
230
57960
64
Also solved by ROY BARBARA, Lebanese University, Fanar, Lebanon ; MANUEL
BENITO, OSCAR
CIAURRI, EMILIO FERNANDEZ, and LUZ RONCAL, Logrono,
~ Spain ; CHIP
CURTIS, Missouri Southern State University, Joplin, MO, USA ; JOHN HAWKINS and DAVID
R. STONE, Georgia Southern University, Statesboro, GA, USA ; WALTHER JANOUS, Ursulinengymnasium, Innsbru
k, Austria ; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA ; JOEL
SCHLOSBERG, Bayside, NY, USA ; PETER Y. WOO, Biola University, La Mirada, CA, USA ; TITU
ZVONARU, Comane
sti, Romania ; and the proposer.
Benito et al. refer to the note by Thomas R. Hagedorn, A proof of a
onje
ture on Egyptian
fra
tions, Amer. Math. Monthly, 107 (2000) 62-63, where it is proved that for ea
h odd integer
n 3 not divisible by 3 there exist distin
t odd, positive integers a, b, and c su
h that
3
1
1
1
=
+ +
n
a
b
c
The result had been
onje
tured by R. Hardin and N. Sloane. When n = 6p+ 1 Hagedorn gives
the de
omposition
3
3
1
1
1
=
=
+
+
n
6p + 1
2p + 1
(2p + 1)(4p + 1)
(4p + 1)(6p + 1)
A Happy New Year to all CRUX with MAYHEM readers. The Jim Totten
spe
ial issue was slated to be
ompleted in May of this year, but due to delays
we are now going to release the spe
ial issue in September 2009 instead.
This year we plan on improving our database of names and aliations
of you, the readers. If your name does not look quite right, for example, if
the a
ents are not quite right or your family name is in
orre
t, et
., then
please let us know and we will update our les. Many international readers
subs
ribe to CRUX with MAYHEM and we want to get these (fas
inating !)
details right.
Va
lav
Linek.