Crux Mathematicorum 1997

Attribution Non-Commercial (BY-NC)

1.4K vues

Crux Mathematicorum 1997

Attribution Non-Commercial (BY-NC)

- Singapore Mathematical Olympiads (2008)
- Crux Mathematicorum 1999
- Crux Mathematicorum 1998
- Crux Mathematicorum 1996
- Singapore Mathematical Olympiads (2009)
- Balkan Mathematical Olympiad 2014
- Crux Mathematicorum 2001
- Crux Mathematicorum 37
- Moscow Maths Olympiads
- Hanoi Mathematical Society ======================
- Inequalities Marathon
- A Friendly Mathematics Competition - 35 Years of Teamwork in Indiana
- Basics of Olymiad Inequalities
- IMO book
- Titu Andreescu & Dorin Andrica - An Introduction to Diophantine Equations
- PROBLEMS OF OLYMPIADS ACROSS WORL
- Geometry
- Crux Mathematicorum 2002
- Euclidean Geometry Notes
- International Mathematics Olympiad 2002 shortlist with solutions

Vous êtes sur la page 1sur 544

Welcome to CRUX MATHEMATICORUM with MATHEMATICAL MAYHEM. We hope that those of you new to any part of our journal will enjoy all the material. We see this merger as bene cial to all our readers. We now o er a broader range of problems. High School students and teachers will nd more material at that level. Please note that we will accept solutions to problems in the MAYHEM section only from students. These are the people that we wish to stimulate. When they nd they are successful with the MAYHEM and SKOLIAD problems, we hope they will then nd a further challenge with the problems in the OLYMPIAD corner, and, eventually, with the PROBLEMS section. Good luck, and we look forward to hearing from you. You will note that the majority of the members of the Crux Editorial Board are continuing in their previous jobs. Sadly, Colin Bartholomew has taken early retirement from Memorial University, and I shall miss him. However, we are pleased to welcome Clayton Halfyard as Associate Editor. There will be a short pro le of him elsewhere in this issue. We are also delighted to welcome Naoki Sato as Mayhem Editor and Cyrus Hsia as Assistant Mayhem Editor. These two Canadian IMO medallists bring with them a wealth of experience of problem solving, and many years of experience of writing for MAYHEM. There are some minor administrative changes: the table of contents which is larger is now on the back outside cover; and the ordering of the various sections has been changed. There is no change in the quantity of material that has been recently published in CRUX. Whereas previously MAYHEM appeared ve times per year, it now appears eight times per year. The annual quantity of material will be approximately the same. Here are some details that will help you in cross-referencing previous material: 1. Please note that the volume number is consecutive for CRUX. 2. Material occurring in previous volumes of CRUX and material occuring in CRUX with MAYHEM will be referenced as year: page no . For example, the last page of the last issue of CRUX is 1996: 384 , and the rst page of CRUX with MAYHEM is 1997: 1 . 3. Material occurring in previous volumes of MAYHEM will be referenced as MAYHEM volume: issue, page no: year . For example, MAYHEM 8: 5, 28: 1996 is the last page of the last issue of MAYHEM. Bruce Shawyer Editor-in-Chief

Welcome!

Bienvenue au CRUX MATHEMATICORUM with MATHEMATICAL MAYHEM. Nous esp rons que ceux qui ne connaissent pas l'une des e nouvelles parties de notre journal en appr cieront tout le contenu. A notre e avis, la fusion de ces deux magazines sera tout a l'avantage de nos lecteurs. La gamme des probl mes publi sy est plus vaste qu'auparavant, et les el ves e e e et les professeurs du secondaire y trouveront davantage de probl mes a leur e niveau. Nous vous signalons au passage que nous accepterons uniquement les solutions aux probl mes de la section MAYHEM provenant des etudiants; e apr s tout, c'est eux que nous voulons stimuler! Lorsqu'ils pourront r ussir e e les probl mes des sections MAYHEM et SKOLIAD, nous esp rons qu'ils e e s'attaqueront a ceux de la partie OLYMPIAD, et m^ me, un peu plus tard, e a ceux de la section PROBLEMS. Bonne chance et au plaisir de recevoir de vos nouvelles! Vous aurez remarqu que la majorit des membres de l' quipe editoriale e e e du Crux sont demeur s en poste. Malheureusement, Colin Bartholomew a e pris une retraite anticip e de l'Universit Memorial; il me manquera. Nous e e sommes toutefois heureux d'accueillir Clayton Halfyard au poste de r dacteur e adjoint. Vous trouverez son pro l ailleurs dans ce num ro. Nous sommes e egalement enchant s d'avoir parmi nous Naoki Sato et Cyrus Hsia, qui e occupent respectivement les postes de r dacteur et de r dacteur adjoint du e e Mayhem. Ces deux m daill s canadiens de l'OIM apportent avec eux tout un e e bagage d'expertise en r solution de probl mes, et des ann es d'exp rience a e e e e la r daction du MAYHEM. e Vous constaterez en outre quelques petits changements d'ordre administratif : la table des mati res largie est d sormais en quatri me de couvere e e e ture et les sections ne sont plus dans le m^ me ordre. Le volume d'information e du CRUX sera comparable a la quantit d'information qu'il contenait avant e la fusion. Le MAYHEM, qui paraissait cinq fois l'an, sera publi huit fois par e ann e; ainsi, le volume annuel de contenu demeurera approximativement le e m^ me. e Voici quelques d tails sur la fa on de noter les renvois : e c 1. Les num ros de volume du CRUX continuent dans la m^ me s quence. e e e 2. On notera ainsi les renvois a des volumes pr -fusion du CRUX et aux e volumes du CRUX with MAYHEM : ann : no de page . e Par exemple, la derni re page du dernier num ro du CRUX sera 1996: e e 384 , et la premi re page du CRUX with MAYHEM sera 1997: 1 . e 3. On notera ainsi les renvois a des volumes pr -fusion du MAYHEM : e volume du MAYHEM: no, no de page: ann e . e Par exemple, MAYHEM 8: 5, 28: 1996 est la derni re page du dernier e num ro du MAYHEM. e Le r dacteur en chef e Bruce Shawyer

Bienvenue!

No. 8 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7 In this issue, courtesy of Waldemar Pompe, student, University of Warsaw, Poland, we print an international contest paper for university students. Please send me your nice solutions.

INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 31 August 1996, Plovdiv, Bulgaria

First day | August 2, 1996

1. Let for j = 0; 1; : : : ; n, aj = a + jd, where a , d are xed real numbers. Put

0 0

0 1 2 1 0 1 2 1 0 1 2

0

1 2

1 C C: C C A

Z

where n is a natural number. 3. A linear operator A on a vector space V is called an involution if A = E, where E is the identity operator on V . Let dim V = n 1. i Prove that for every involution A on V there exists a basis of V consisting of eigenvectors of A. ii Find the maximal number of distinct pairwise commuting involutions on V .

2

sin nx dx ; , 1 + 2x sin x

4

nP , 4. Let a = 1, an = n akan,k for n 2. k Show that i limsup jan j =n 2, = ; n!1 ii limsup jan j =n 2=3. n!1 5. i Let a, b be real numbers such that b 0 and 1 + ax + bx every x 2 0; 1 . Prove that Z lim n 1 + ax + bx n dx = ,1=a if a 0;: + 1 if a 0 n!1

1 1 1 =1 1 1 2 1 1 2 0

0 for

ii Let f : 0; 1 ! 0; 1 be a function with continuous second derivative and f 00 x 0 for every x 2 0; 1 . Suppose that exists and 0

L +1.

Z L = nlim n f xn dx !1

1 0

CE = inf

i=1

X n

where the in mum is taken over all nite families of sets E ; E ; : : : ; En n S E. in R R such that E i

1 2

i=1

diam Ei

such that L is a closed line segment onto which E can be contracted. Show that i C L = length L, if L is a closed line segment. ii C E KE . iii equality in ii need not hold even if E is compact. Hint: If E = T T 0 where T is the triangle with vertices ,2; 2, 2; 2 and 0; 4, and T 0 is its re ection about the x-axis, then C E = 8 KE.

5

Remarks: All distances used in this problem are Euclidean. Diameter of a set E is diam E = supfdist x; y j x; y 2 E g. Contraction of a set E to a set F is a mapping f : E ! F such that dist f x;f y dist x; y for all x; y 2 E . A set E can be contracted onto a set F if there is a contraction f of E to F which is onto, that is such that f E = F . Triangle is de ned as the union of the three line segments joining its vertices, so that it does not contain the interior.

Problems 1 and 2 are worth 10 points, problems 3 and 4 are worth 15 points, problems 5 and 6 are worth 25 points. You have 5 hours. Please write the solutions on separate sheets of paper. Good luck!

No. 179 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. Another year has passed, and the rst with Bruce Shawyer as Editorin-Chief. He has made the transition pleasant and easy. Special thanks go to Joanne Longworth whose TEX skills have made changed fonts and formats easy to incorporate. Thanks also go to the many contributors to the two Corners including: Miguel Amengual Covas Cyrus C. Hsia Dieter Ruo S fket Arslanagi e c Murray Klamkin Toshio Seimiya Mansur Boase Derek Kisman Michael Selby Seung-Jin Bang Ted Lewis D.J. Smeenk Christopher Bradley Joseph Ling Daryl Tingley Francisco Bellot Rosado Beatriz Margolis Panos E. Tsaoussoglou Paul Colucci Stewart Metchette Ravi Vakil Hans Engelhaupt Richard Nowakowski Edward T.H. Wang Tony Gardiner Michael Nutt Hoe Teck Wee Solomon Golomb Siu Taur Pang Chris Wildhagen Gareth Gri th Bob Prielipp Siming Zhan Georg Gunther Chandan Reddy Let me open with a major apology. In the November 1996 number of the corner we gave twelve of the problems proposed to the jury but not used at the 36th International Mathematical Olympiad held in Canada. Those familiar with the process of selection will know that the problems do not initiate with the host country. They come from proposers in other countries, and the responsibility of the host country selection committee is to re ne and select from these submissions the o cial list of problems proposed to the jury. Over the years I have loosely referred to the problems proposed to the jury at the Xth International Olympiad in Y as the Y-problems" for short. However, when that became part of a longer more o cial sounding sub-title Canadian Problems for consideration by the International Jury," I should have seen that it read as if the original proposers are from Canada, thus insulting the creators. In retrospect I do not understand why that interpretation did not jump o the page. To the many creative non-Canadians who submitted problems for possible use at the 36th IMO my sincere apologies.

7 As an Olympiad Contest this issue we give the problems of the 44th Mathematical Olympiad from Latvia. My thanks go to Richard Nowakowski, Canadian Team Leader to the IMO in Hong Kong for collecting the problems for me.

Final Grade, 3rd Round

Riga, 1994

1. It is given that cos x = cos y and sin x = , sin y. Prove that sin 1994x + sin 1994y = 0.

2. The plane is divided into unit squares in the standard way. Consider a pentagon with all its vertices at grid points. a Prove that its area is not less than 3=2. b Prove that its area is not less than 5=2, if it is given that the pentagon is convex. 3. It is given that a 0, b 0, c 0, a + b + c = abc. Prove that at least one of the numbers a, b, c exceeds 17=10. 4. Solve the equation 1!+2!+3!+ + n! = m in natural numbers. 5. There are 1994 employees in the o ce. Each of them knows 1600 of the others. Prove that we can nd 6 employees, each of them knowing all 5 others. 1st SELECTION ROUND 1. It is given that x and y are positive integers and 3x + x = 4y + y. Prove that x , y , 3x + 3y + 1 and 4x + 4y + 1 are squares of integers. 2. Is it possible to nd 2 di erent pairs of natural numbers ai; bi such that the following 2 properties hold simultaneously: 1 + 1 + + 1 1 ab ab a 1994 b 1994 = 1, 2 a + a + + a 1994 + b + b + + b 1994 = 3 ? 3. A circle with unit radius is given. A system of line segments is called a cover i each line with a common point with the circle also has some common point with some of the segments of the system. a Prove that the sum of the lengths of the segments of a cover is more than 3, b Does there exist a cover with this sum less than 5? 4. A natural number is written on the blackboard. Two players move alternatively. The rst player's move consists of replacing the number n on the blackboard by n=2, by n=4 or by 3n rst two choices are allowed only if they are natural numbers. The second player's move consists of replacing the number n on the blackboard by n + 1 or by n , 1. The rst player wants the number 3 to appear on the blackboard no matter who writes it down. Can he always achieve his aim?

3 2 2 1994 1 1 2 2 2 2 1 2 2 1 2 2 1995

5. Three equal circles intersect at the point O and also two by two at the points A, B , C . Let T be the triangle whose sides are common tangents of the circles; T contains all the circles inside itself. Prove that the area of T is not less than 9 times the area of ABC . 2nd SELECTION ROUND 1. It is given that 0 xi 1, i = 1; 2; : : : ; n. Find the maximum of the expression

x n + x x x x: : x + 1 + + x x : : :xx + 1 : x x : : : xn + 1 : n n,

1 2 2 3 1 3 4 1 2 1

2. There are 2n points on the circle dividing it into 2n equal arcs. We must draw n chords having these points as endpoints so that the lengths of all chords are di erent. Is it possible if: a n = 24, b n = 1994? 3. A triangle ABC is given. From the vertex B, n rays are constructed intersecting the side AC . For each of the n +1 triangles obtained, an incircle with radius ri and excircle which touches the side AC with radius Ri is constructed. Prove that the expression

depends on neither n nor on which rays are constructed. 3rd SELECTION ROUND 1. A square is divided into n cells. Into some cells 1" or 2" is written so that there is exactly one 1" and exactly one 2" in each row and in each column. We are allowed to interchange two rows or two columns; this is called a move. Prove that there is a sequence of moves such that after performing it 1"-s and 2"-s have interchanged their positions. 2. Let aij be integers, jaij j 100. We know that the equation

2 11 2 22 2 33 2 12 13 23

r r : : : rn R R : : : Rn

1 2 1 2

+1 +1

a x + a y + a z + a xy + a xz + a yz = 0 has a solution 1234; 3456; 5678. Prove that this equation also has a solution with x, y , z pairwise relatively prime which is not proportional to the

given one. 3. Let ABCD be an inscribed quadrilateral. Its diagonals intersect at O. Let the midpoints of AB and CD be U and V . Prove that the lines through O, U and V , perpendicular to AD, BD and AC respectively, are concurrent.

9 Next we give ve Klamkin Quickies. My thanks go to Murray Klamkin, the University of Alberta, for supplying them to us. Next issue we will give the quick" solutions along with another ve of his special teasers.

October 21, 1996

0, prove thatx 1 1+ 1 i 1 + x + 1 xx + 2 , ii x + y x + z x y + z y + x y z + xz + y z 4xy x 4yz y 4zx z .

1. For x; y;z

2. If ABCD is a quadrilateral inscribed in a circle, prove that the four lines joining each vertex to the nine point centre of the triangle formed by the other three vertices are concurrent. 3. How many six digit perfect squares are there each having the property that if each digit is increased by one, the resulting number is also a perfect square? 4. Let ViWi, i = 1; 2; 3; 4, denote four cevians of a tetrahedron V V V V which are concurrent at an interior point P of the tetrahedron. Prove that PW + PW + PW + PW max ViWi longest edge: 5. Determine the radius r of a circle inscribed in a given quadrilateral if the lengths of successive tangents from the vertices of the quadrilateral to the circle are a; a; b; b; c; c; d; d, respectively.

1 2 3 4 1 2 3 4

We now turn to solutions from the readers to problems posed in the May 1995 number of the corner on the Sixth Irish Mathematical Olympiad, May 8, 1993 1995: 151 152 .

May 8, 1993 | First Paper

Time: 3 hours

3

3 2

Find + . Solutions by Sefket Arslanagi , Berlin, Germany; by Beatriz Margolis, c Paris, France; by Vedula N. Murty, Andhra University, Visakhapatnam, India; by D.J. Smeenk, Zaltbommel, the Netherlands; by Panos E. Tsaoussoglou, Athens, Greece; and comment by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Margolis's solution.

, 3 + 5 , 17 = 0;

2

, 3 + 5 + 11 = 0:

3 2 3

f , 3 = , 1 + 2 , 1 f , 3 = , 1 + 2 , 1

3 3 3 3

Adding gives

0 = , 1 + , 1 + 2 + , 2 = + , 2 , 1 + , 1 , 1 + , 1 + 2

2 2

and, since the second factor is positive, we obtain the result. See Olympiad Corner 142 and its solution. Wang's Comment: The problem is strikingly similar to problem 11.2 of the XXV Soviet Mathematical Olympiad, 11th Form 1993: 37 . The method used by Bradley given in the published solution 1994: 99 works for the present problem as well and, in fact, yields the same answer: + = 2. 3. The line l is tangent to the circle S at the point A; B and C are points on l on opposite sides of A and the other tangents from B , C to S intersect at a point P . If B , C vary along l in such a way that the product jABj jAC j is constant, nd the locus of P . Solution by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain; and by D.J. Smeenk, Zaltbommel, the Netherlands. We use Smeenk's solution.

t D p B

=2 =2

t r E S q

=2 =2

I r

11 with pq = k , a constant. Let S touch BP and CP at D and E respectively. For 4PEI we have EIP = + . Thus

2 1 2 2 2

t = r tan 1 + = p +,qrr : 2 pq The semiperimeter of 4BCP is p + q + t = p + q + p +,qrr = pqp,+rq : pq pq The area, F , of 4BCP is r pqp,+rq = 1 p + qPH; pq 2 where PH is the altitude to BC . It follows immediately that 2 PH = pq pqr = k2k,rr : ,r So the locus of P is a line parallel to BC . 4. Let a ; a ; : : : ; an, be real numbers, where n 1, and let f x = xn + an, xn, + + a be such that jf 0j = f 1 and each root of f is real and satis es 0 1. Prove that the product of the roots does not exceed 1=2n.

2 2 2 2 2 2 2 0 1 1 1 1 0 1 2

Solution by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. Let f x = x , x , : : : x , n where the i denote the n Q real roots of f , i = 1; 2; : : : ; n. Then from jf 0j = f 1 we get 1 , i = Q . All products are over i = 1; 2; : : : ; n. Using the Arithmetic Mean i Geometric Mean Inequality we then get

Y

i

Q i i = 1; 2; : : : ; n.

from which

1 2n

1 2

Y i + 1 , i
= 21n i 1 , i 2

2 2

Time: 3 hours

cient n denotes r the number ofn , combinations of 0 if n r.chosen r at identity with the con,n = n objects Prove the a time, vention that = 1 and r

0

1 X n , r + 1 r , 1 n d d,1 = r d

=1

,

12 for all integers n, r with 1 r n. Solution by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We use a combinatorial argument to establish the obviously equivalent identity

k X n,r+1 r,1 = n d r,d r d where k = minfr;n , r + 1g. It clearly su ces to demonstrate that the left hand side of counts the number of ways of selecting r objects from n distinct objects without replacements. Let jS j = r , 1. For each xed d = 1; 2; : : : ; k, any selection of d objects from S SnS together with any selection of r , d objections from S would yield a selection of r objects from r S. The total number of such selections is ,n,d ,r,d. Conversely, each r, selection of r objects from S clearly must arise in this manner. Summing over d = 1; 2; : : : , follows. 4. Let x be a real number with 0 x . Prove that, for all natural numbers n, the sum , sin x + sin33x + sin55x + + sin2n, 11x 2n

=1 2 1 2 2 +1 1

is positive. Solutions by Sefket Arslanagi
, Berlin, Germany; and by Vedula N. c Murty, Andhra University, Visakhapatnam, India. We give Murty's solution. We use mathematical induction. Let

n X sin2k , 1x 2k , 1 : k S x = sin x 0 for x 2 0; . Thus the proposed inequality is true for n = 1. Let Sr x 0 for r = 1; 2; : : : ; n , 1. We will deduce that Snx 0 for x 2 0;. Suppose that Snx 0 ford some x 2 0; , and that Sn x attains its minimum at x = x . Hence dx Sn x x x0 = 0. That is n 0 x = X cos2k , 1x = 0; Sn

Snx =

=1

so that

k=1

0 0

0 0 =1 0

k=1 n X

13

0 Thus Sn x =

0 sin 2 2 sin

x 2 2 ; 2 ; 3n ; : : : ; 2n2, 1 : n 2n 2 n It is easily veri ed that at each of these values Sn x 0, a contradiction. Hence Sn x 0 for x 2 0; .

0 0

Editor's Note: Both solutions used the calculus. Does anyone have a more elementary solution? We complete this number of the Corner with solutions by our readers to problems of the 1992 Dutch Mathematical Olympiad, Second Round given in the June 1995 number of the Corner 1995; 192 193 .

September 18, 1992

Second Round

1. Four dice are thrown. What is the chance that the product of the numbers equals 36? Solution by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. There are four di erent kinds of outcomes in which the product is 36: each of f1; 1; 6; 6g and f2; 2; 3; 3g can occur in = 6 ways; f1; 4; 3; 3g can occur in = 12 ways; and f1; 2; 3; 6g can occur in 4! = 24 ways. Hence the probability that the product equals 36 is 4 = . 2. In the fraction and its decimal notation with period of length 4 every letter represents a digit. Di erent letters denote di erent digits. The numerator and denominator are mutually prime. Determine the value of the fraction:

4! 2! 4! 2!2! 1 27 48 6

Note. ADA KOK is a famous Dutch swimmer. She won gold in the 1968 Olympic Games in Mexico. SNEL is Dutch for FAST. Solution by the Editor. ADA Let x = KOK = :SNEL. Then 10 x = SNEL:SNELSNEL : : : and 10 x , x = SNEL. So

4 4

Taking KOK = 909 we obtain SNEL = 11 ADA, and A = L, which is impossible. Taking KOK = 303, we obtain SNEL = 33 ADA, so 3A 10, as the product has four digits and 3A = L. Because S 6= L 6= 0, 3 3A 9,

14 giving A = 1 or A = 2. Now A = 1 gives L = 3 = K , which is impossible, so A = 2. This gives L = 6, and D 2, so there is a carry. This gives D 4, as A = 2, K = 3. ADA For D = 4, KOK = :SNEL is = :7986, a solution. For D = 5, ADA = 252 is not coprime to KOK = 303. For D = 6, SNEL = 8646 and N = L. For D = 7, SNEL = 8976 and D = E . For D = 8, SNEL = 9036 and O = N . For D = 9, SNEL = 9636 and N = L. Taking KOK = 101 gives SNEL = 99 ADA forcing A = 1 for SNEL to have four digits, but then A = K . Thus the only solution is = :7986. 3. The vertices of six squares coincide in such a way that they enclose triangles; see the picture. Prove that the sum of the areas of the three outer squares I, II and III equals three times the sum of the areas of the three inner squares IV, V and VI.

242 303 242 303

PB ,P @ ,

B @

BB III BB BB

B B

Solutions by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain; and by Vedula N. Murty, Andhra University, Visakhapatnam, India. We give Murty's solution. Let the gure on the next page be labelled as shown: Let MN = x , LU = x , UY = x , AC = x , AB = x , BC = x , MBN = , LAU = , V CY = , BAC = A, ACB = C and ABC = B. Then we have + = , + A = , + C =

1 3 2 4 5 6

aaa aaa

2 1 2 2 2 3 2 6 2 4 2 4 2 5 2 6 2 5 5 6 4 6 4 5

1

15

"X T """ TT Y"" TT II TTT W I VI TT """ C T B Q aaa ,@@ PPPP""" aaa ,, @ IV T V aa, V @PP M@ A P

@@ ,,,

PBU

B @

L ,

BB BB BB III BB BB

BT B

S aaa aaa N a

x = x + x , 2x x cos B 9 = x = x + x , 2x x cos C : : : x = x + x , 2x x cos A ;

2 4 2 4 2 6 2 5 2 4 2 4 2 6 2 6 2 5 5 6 4 6 4 6 4 5 5 6

Pa

2

2 4 2 5 2 6

4 6 4 5 5 6 4 6

2 1

2 2 2 3 2 4 2 5 2 6 5 6 4 5 4 6

using 3

2 4 2 4 2 5 2 5 2 6 2 6 2 4 2 5 2 6

1 4 3

16 Solutions by Vedula N. Murty, Andhra University, Visakhapatnam, India; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Wang's solution and his remark. Using the more convenient notation f n for n?, we show that in general p p

4 3

n + 1 f n 4 n 3 p for all even n 6. In particular, for n = 1992, we would get 1993 f 1992 p1992. First note that f n = f nn = nn f n , 2 for all n 3. If N = 2k , , q where k 2, then multiplying f 2q = q, f 2q , 2 for q = 2; 3; : : : ; k,

1

we get

1 2 2

Hence

2

2 4 6 2k 3 5 7 2k + 1 = 2k + 1; 1 3 5 2k , 1 2 4 6 2k

1

Hence

2 2 2

2

17 Remark: Using similar arguments, upper and lower bounds for f n when n is odd can also be easily derived. In fact, if we set P = k, k usually denoted by k, then various upper and lower bounds for P k abound in the literature; for example, it is known that

2 1!! 2 !! 1 3 5 2 2 4 6 2 1

1 5 P 1 3 2 4k + 1 2 2k + 1

and

q 1 P p1 : n n +

1 2

Compare, for example, x3.1.16 on p. 192 of Analytic Inequalities by D.S. Mitronovi
. c Clearly, each pair of these double inequalities would yield corresponding upper and lower bounds for the function f n considered in the given problem. 5. We consider regular n-gons with a xed circumference 4. We call the distance from the centre of such a n-gon to a vertex rn and the distance from the centre to an edge an . a Determine a ; r ; a ; r . b Give an appropriate interpretation for a and r . c Prove: a n = an + rn and r n = pa n rn .

4 4 8 8 2 1 2 2 2 2 2

an

0 1 2 3

rn

0 1 2 1

dia.

2 1

Let O be the centre of the regular n-gon. Let A A denote one side of the regular n-gon

18

rn

1 1 2 2

O an

2

A A Then we have A OA = n , OA A = OA A = , n . Thus r , A j = rn + rn , 2rn cos 2 ,, ! jA n r = 2rn1 , cos 2n r = 4rn sin n = 2rn sin : n The circumference of the regular n-gon is 2nrn sin = 4 whence n

1 2 2 1 2 1 2 2 2 2 2 2 2

In particular

4

p 1 r = 1 sin = 22 ; 2

4 4 8 8 1 2

a = 2 cot = 1 ; 4 4 2

8

4 2 8

2 1 r = 8 sin = 4 sin :

so and

q p sin = 1 2 , 2; 8 2

since cos = 2 cos , 1. For b, r = 1, a = 0 as the 2-gon is a straight line with O lying at the middle of A and A .

4 2 8 2 2 1 2

r = 1p 2 p = 1 p 1 p ; 4 2, 2 2 2, 2 s = 1 2 + p2 = 1 1p p2; a = r cos 8 4 2 , p2 4 2 , 2

8 8 8

19

an + rn = rn 1 + cos n = 2rn cos 2 n 4 cos = n sin 2n n 4 2 = 2n sin cos cos 2 = n cot 2 : n n n n Thus an + rn = n cot = a n , and n

2 2 2 2 2 1 2 1 2 2

1 2 1 1 n a nrn = n cos n n sin = n sin cos cos = n sin ; sin n n n n n pa nrn = so n 2n = r n . For d, note u = 0, u = 1, and u = . For n 2 we have that un is either the arithmetic or geometric mean of un, and un, and in either case lies between them. It is also easy to show by induction that u ; u ; u ; : : : form an increasing sequence, and u ; u ; u ; : : : form a decreasing sequence with u l u s for all l; s 0. Let limk!1 u k = P and limk!1 u k = I . Then P I . We also have from u n = u n, + u n, that P = I + P so that I = P and limn!1 un exists. Let limn!1 un = L. With a = 0 and r = 1, let u k = a k+1 and u k = r k+1 , for k = 0; 1; 2; : : : . From c, u = a 1 = a = 0 and u = r 1 = r = 1. Also for n = 2k + 2, u k = a k+1+1 = a k+1 = a k+1 + b k+1 = u k + u k ; that is un = un, + un, and for n = 2k + 3 uk = u k = k+1 k pa k+1 = rk+1+1+1park+1+1 r k+1 = r = pu = k u k p so un = un, un, . Thus un and un satisfy the same recurrence and it follows that L = limk!1 a k+1 = limk!1 r k+1 . Now, from the solution

2 2 2 2 2 2 2 2 2 2 1 sin 2 0 1 2 1 2 1 2 0 2 4 1 3 5 2 2 +1 2 +1 2 2 2 1 2 1 2 2 2 1 2 2 2 2 2 +1 2 0 2 2 2 +2 1 2 2 2 +1 1 2 2 2 2 1 1 2 2 2 2 2 2 1 2 +3 2 +1+1 22 2 22 2 2 2 2 +1 2 +1 1 2

2 2

to c,

That completes the column for this issue. Olympiad season is approaching. Send me your contests and nice solutions.

20

BOOK REVIEWS

Edited by ANDY LIU

Shaking Hands in Corner Brook and other Math Problems, edited by Peter Booth, Bruce Shawyer and John Grant McLoughlin, published by the Waterloo Mathematics Foundation, Waterloo, 1995, 153 pages, paperback, ISBN 0-921418-31-0. Reviewed by Robert Geretschlager and Gottfried Perz. One representative from each of six regions met in Corner Brook, Newfoundland, to discuss math problems. Each of these delegates shook hands with each other delegate. How many handshakes were there? This is the rst of many problems that can be found in this collection of problems from the Newfoundland and Labrador Teachers' Association NLTA Senior Mathematics League, which conveniently o ers an explanation as to the whereabouts of Corner Brook. The NLTA Math League was started in 1987, and has since developed into a very interesting competition at the regional level. A number of aspects make this competition di erent from most math competitions. First of all, it is purely a team competition, with four students from each participating school comprising a team. There is no individual ranking, and so students are motivated to work together at nding solutions. For each of ten questions posed, a team can receive ve points for a correct team answer. If the members of a team cannot agree on the correct answer, they can submit individual answers, for which their team can get one point each, if correct. Finally, there is a relay question, made up of four parts. In the relay, each part yields an answer, which is necessary to be able to solve the next part much as in the American Regions Mathematics League ARML, which may be better known to many readers. The relay section can yield a maximum of 15 points made up of ve points for the solution and extra points for solving the problems in a short time, for a possible total of 65 points. If teams end up with the same point sum, a tie breaker question is posed. The concept behind this competition is geared to fostering cooperative problem solving, something that is generally ignored in olympiad-style competitions. The level of di culty of the problems posed is adequate to the time allowed usually from 3 to 10 minutes per question and the intentions of the competition, and ranges from fairly easy to pre-olympiad level. The book is divided into sections covering regular questions, relay questions, tie breakers and solutions. The problems are in a random order, and no indication is given of which questions were posed at which competition. Perhaps at least one example of ten speci c questions posed at one competition, and the order they were posed in, might have been of interest.

21 Here are a few problems to whet your appetite: How many three digit numbers include at least one seven but have no zeros? Al, Betty, Charles, Darlene and Elaine play a game in which each is either a frog or a moose. A frog's statement is always false while a moose's statement is always true. Al says that Betty is a moose. Charles says that Darlene is a frog. Elaine says that Al is not a frog. Betty says that Charles is not a moose. Darlene says that Elaine and Al are di erent kinds of animals. How many frogs are there? Triangle ABC is isosceles, with ABC = ACB . There are points D; E and F on BC; CA and AB, respectively, that form an equilateral triangle. Given that AFE = x and CED = y , calculate BDF in terms of x and y . The book has a very pleasing layout, with the cover showing the densest packing of seven circles in an equilateral triangle. The solutions are nicely presented, and in several cases, alternate solutions are given, occasionally labeled the routine way" and the subtle" or smart way". Shaking Hands in Corner Brook should be of interest to anyone involved with high school mathematics, either in competitions, or simply seeking enrichment material for the interested student. Copies of the above reviewed book may be obtained from: Canadian Mathematics Competition Faculty of Mathematics, University of Waterloo Waterloo, Ontario, Canada. N2L 3G1 The cost is $12 in Canadian funds plus 7 GST for shipping to Canadian addresses. Cheques or money orders in Canadian funds should be made payable to: Canadian Mathematics Competition. All pro ts from the sale of this book are for the Newfoundland Mathematics Prizes Fund.

22 Teachers interested in providing a lively and stimulating high school mathematics competition for their students may be interested in participating in a NLTA Senior Mathematics League in their own area. Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario, a regular contributor to CRUX, is already a participant. Meetings can be held within individual schools, or between teams from more than one school. Sample games and other information on how the NLTA Senior Mathematics League is organised may be obtained free from: Dr. Peter Booth Department of Mathematics and Statistics Memorial University of Newfoundland St. John's, Newfoundland, Canada. A1C 5S7 Tel: int+ 709 737 8786 Fax: int+ 709 737 3010 email: pbooth@fermat.math.mun.ca Schools that participate on a regular basis will be sent questions and detailed solutions ve times per year October, November, February, March and May. There is an annual fee of $50 Canadian funds for each group of schools participating. Cheques or money orders should be made payable to Newfoundland Mathematics Prizes Fund.

23

Theodore Chronis

It is well known that the probability for an integer number to be odd is equal to the probability for the number to be even. What about determinants? What is the probability for a rectangular matrix with integer entries to have odd determinant? More generally, if m is a natural number, what is the probability for which det A mi mod m, where mi is chosen from the set f0; 1; 2; : : : ; m , 1g? I have the following problem to propose; I hope you will nd it interesting. Let A be an n n matrix whose elements are integers. What is the probability the determinant of A is an odd number? Solution: Let A = aij ; i; j = 1; : : : ; n. It is obvious that det A det aij mod 2 mod 2: So the problem is to nd the probability that the determinant of an n n matrix with elements from the set f0; 1g is an odd number. Let An be an n n matrix with elements from the set f0; 1g. Let also N det An be the number of odd n n determinants, and P det An be the corresponding probability. Let

0 B B f K = fk ; k ; : : : ; kng = N B B @

1 2 1 2

where k ; k ; : : : ; kn 2 f0; 1g are xed. P Then N det An = f K , where the sum is calculated for all the 2n , 1 possible permutations K = fk ; k : : : ; kn g with ki 2 f0; 1g, i = 1; : : : ; n and k ; k ; : : : ; kn not all zero. Note that f 0; 0; : : : ; 0 = 0:

1 2 1 2

:: :: kn 1 :: :: a n C C : : : C; C : : : A an an :: :: ann k a

1 21

k a

22

24

Lemma: f K = 2n, N det An, , where k + k + : : : + kn 6= 0. Proof. It is well known that a determinant remains unchanged if from the elements of one of its columns we substract the corresponding elements of another column. It is also obvious that the same is true for N det An . Additionally, a determinant just changes sign if we interchange two columns, while N det An remains unchanged. So

1 1 1 2

0 1 0 :: :: 0 :: :: kn 1 :: :: a n C C = N B a: a: :: :: a : n B B : : : C C B : : A @ : : : : an an :: :: ann an an :: :: ann f K = 2n, N det An, : Hence N det An = 2n, N det An, 2n , 1. Of course N det A = 1 and so n Y N det An = 2n n, = 2i , 1:

k a

1 21

0 B B NB B @

k a

22

21

22

1 C C C C A

1 2

Finally, P det An = N n2An P det An = n 1 , 2,i . Qn 1 , 2,i; n = 1; 2i; : : : is decreasing and Note: The in nite sequence i bounded below by 0, so limn!1 P det An exists. Using Mathematica, we found that

det 2 =1 =1

i=1

25

No. 19 R.E. Woodrow

The problem set we give in this issue comes to us with our thanks from Tony Gardiner of the UK Mathematics Foundation, School of Mathematics, University of Birmingham. The Nat West Junior Mathematical Challenge was written Tuesday, April 26, 1994 by about 105,000 students. Students from England and Wales must be in school year 8 or below. The use of calculators, calendars, rulers, and measuring instruments was forbidden.

Tuesday, April 26, 1994 | Time: 1 hour 1. 38 + 47 + 56 + 65 + 74 + 83 + 92 equals A. 425 B. 435 C. 445 D. 456

E. 465.

them have birthdays in the same month? A. 11 B. 12 C. 13

A. 100 B. 500 C. 1000 D. 23 D. 2500 E. 334. E. 10000.

4. What was the precise date exactly sixty days ago today? No calendars!

A. Friday 25th February B. Saturday 26th February C. Friday 26th February D. Saturday 27th February E. Tuesday 26th February.

5.

You have to nd a route from A to B moving horizontally and vertically only, from one square to an adjacent square. Each time you enter a square you add the number in that square to your total. What is the lowest possible total score for a route from A to B ?

A. 28 B. 29 C. 30 D. 31

3 9 B 8 5 6 9 11 7 A 8 10

E. 34.

26

6. On a clock face, how big is the angle between the lines joining the centre

to the 2 O'clock and the 7 O'clock marks? A. 160 B. 150 C. 140

D. 130 E. 120 .

7. Gill is just six and boasts that she can count up to 100. However, she

often mixes up nineteen and ninety, and so jumps straight from nineteen to ninety one. How many numbers does she miss out when she does this? A. 70 B. 71 C. 72 D. 78 E. 89. In how many ways can you join the two shapes shown here to make a gure with a line of symmetry?

A. 0 B. 1 C. 2 D. 3 E. 4.

8.

your answer? A. 2 B. 4

C. 6 D. 8 E. 9.

10. How many numbers between 20 and 30 inclusive cannot be written 11. Four children are arguing over a broken toy. Alex says Barbara broke 12.

as a multiple of 5, or as a multiple of 7, or as the sum of a multiple of 5 and a multiple of 7? A. 1 B. 2 C. 3 D. 5 E. 6. it. Barbara says Claire broke it. Claire and David say they do not know who broke it. Only the guilty child was lying. Who broke the toy? A. Alex B. Barbara C. Claire D. David E. can't be sure. The diagram is made up of one circle and two semicircles. Which of the three regions | the black region, the white region and the large circle | has the longest perimeter?

27

A. the black region B. the circle C. the white region D. black and white are equal and longest E. all three perimeters are equal.

13. From my house the church spire is in the direction NNE. If I face in this 14. Samantha bought seven super strawberry swizzles and ten tongue twist-

direction and then turn anticlockwise through 135 I can see the Town Hall clock. In which direction am I then facing? A. WSW B. due West C. SW D. due South E. SSE. ing to ees for $1.43. Sharanpal bought ve super strawberry swizzles and ten tongue twisting to ees for $1.25. How much is one tongue twisting to ee? A. 7p B. 8p C. 9p D. 10p E. 18p. days and forty eight hours old. How old am I? A. 48 B. 50 C. 51 D. 52 The numbers 1 to 12 are to be placed so that the sum of the four numbers in each of the six rows is the same. Where must the 7 go?

15. I am forty eight years, forty eight months, forty eight weeks, forty eight

E. 53.

4 3 8

16.

B

5

C

A. at A B. at B C. at C

6 9

D

E. at E

D. at D

17. Three hedgehogs | Roland, Spike and Percival | have a leaf collecting

race. Roland collects twice as many as Percival, who collects one and a half times as many as Spike. Spike is moulting, and so has fewer prickles for her to stick the leaves onto. Between them they collect 198 leaves. How many did Spike manage to collect? A. 18 B. 22 C. 36 D. 44 E. 66.

28

18. The four digits 1, 2, 3, 4 are writtin in increasing order. You must insert

one plus sign and one minus sign between the 1 and the 2, or between the 2 and the 3, or between the 3 and the 4, to produce expressions with di erent answers. For example, 1 , 23 + 4 gives the answer , 18: How many di erent positive answers can be obtained in this way? A. 2 B. 3 C. 4 D. 5 E. 6. notices that 2=5 of her brothers and sisters are boys. How many Rabbit children are there in the family? A. 2 B. 4 C. 8 D. 16 E. 32. every year. If it kept on doubling every year for ten years, what would its population be in the year 2000? A. 100; 000 B. 200; 000 C. 1; 000; 000 D. 2; 000; 000 E. 10; 000; 000. an equilateral triangle. How big is the angle PMN ? A. 75 B. 70 C. 60 D. 45

19. Roger Rabbit has twice as many sisters as brothers. His sister Raquel

20. The population of a new town in 1990 was 10; 000. It has since doubled

21. LMNO is a square. P is a point inside the square such that NOP is

E. 30 .

is its length? A. 18x + 24 B. 7x + 6 C. 12x + 6 D. 6x + 3 E. 14x + 12.

23. In a group of

fty girls each one is either blonde or brunette and is either blue-eyed or brown-eyed. Fourteen are blue-eyed blondes, thirty one are brunettes and eighteen are brown-eyed. How many are brown-eyed brunettes? A. 5 B. 7 C. 9 D. 13 E. 18. ll sixty glasses when it is diluted in the ratio 1 part Crush to 4 parts water. How many glasses of drink would a bottle of JMC make if it is diluted in the ratio 1 part Crush to 5 parts water? A. 48 B. 60 C. 72 D. 75 E. 80.

29

25.

A 3 by 3 by 3 cube has three holes, each with a 1 by 1 cross section running from the centre of each face to the centre of the opposite face. What is the total surface area of the resulting solid?

PP

P

P P

P P P

P

P

PP P

P

PP

P

P

P P P P

P PP

PP

A. 24

B. 48

C. 72

D. 78

E. 84.

That completes the Skoliad Corner for this issue. Send me your contests, suggestions, and recommendations to improve this feature.

For those of you who do not know Clayton, here is a short pro le: Born: Haystack, Newfoundland Educated Haystack School School, Newfoundland Thornlea School, Newfoundland Memorial University of Newfoundland Queen's University, Kingston, Ontario Employment Random South School Board, Trinity Bay, Newfoundland Memorial University of Newfoundland Mathematical Mathematical Education Interests Commutative Algebra

1

You may have di culty nding Haystack on a map of Newfoundland | it is not lost | it no longer exists!

1

30

MATHEMATICAL MAYHEM

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, University of Toronto, Toronto, ON Canada M5S 1A1. The electronic address is

mayhem@math.toronto.edu

The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

Editorial

It gives me great pleasure to unveil the premiere issue of Crux Mathematicorum with Mathematical Mayhem". This merger has been in the works for quite some time, and it has nally been successfully realized. For the bene t of those who have not heard of Mayhem, I will provide a brief description. Mayhem was founded in 1988 by two high school students Ravi Vakil and Patrick Surry, who wished to establish a journal speci cally oriented towards students, and totally operated by students. Although the journal has been passed down through many hands, and though it has not always been easy, this mandate has always been resolutely upheld; it has made Mayhem a unique and exceptional journal. And rest assured, we will still be running our share of Crux with Mayhem". Our features include articles, olympiads, and a problems section. The material is generally focused towards contests and olympiads, and how to prepare for them, and the topics range from high school mathematics to undergraduate material. We cannot emphasize enough that we are a journal dedicated to mathematics students. I myself am a fourth-year student at the University of Toronto, and Cyrus Hsia the Mayhem Assistant Editor is a third-year student, also at the University of Toronto. Our fearless sta also consists of undergraduate and high school students. This brings me to my next point. After considerable discussion, Mayhem" has decided to restrict itself to publishingsolutions only from students. The rationale behind this move is that the Crux problems already draw many solutions, and if the same people were to respond to our problems, which are considerably easier, it would simply overwhelm the section. We know that

31 there are many non-students who have contributed to the problems sections over the years, who have our full gratitude, and hope they understand our position. We are, however, prepared to make exceptions in, well, exceptional cases. However, we warmly welcome submissions for articles and problems from all people. Back issues are available; the information is inside the back cover. Any correspondence about Mayhem should be sent to Mathematical Mayhem, c o Naoki Sato, Department of Mathematics, University of Toronto, M5S 1A1, or at the e-mail address mayhem@math.toronto.edu . Subscriptions, however, should be sent to the Canadian Mathematical Society o ces, as mentioned on the inside back cover. Well, I think that's about it. For people who have subscribed to Mayhem, welcome back, I know it's been a long wait. I look forward to working with Bruce Shawyer on our new project I think he will bring a certain discipline" to Mayhem, but we will resist it as much as possible. Don't tell him I said that. Here's to a new year and a new era for Mayhem. Naoki Sato Mayhem Editor

Positive Matrices and Positive Eigenvalues

Theorem. An n n matrix M with positive real entries has at least one positive eigenvalue. Proof. Let S = fx ; x ; : : : ; xn j x ; x ; : : : ; xn 0; x + x + + xn = 1g; that is, S is the portion of the unit sphere in Rn with all coordinates nonnegative. v De ne the map f : S ! S by f ~ = jM~j . Since M has all positive real v M~ v entries, for any ~ 2 S , M~ also has all non-negative coordinates, so f is v v well-de ned, and does indeed map S into S . Note that S is a closed, simply connected set. Then by Brouwer's Fixed Point Theorem, there is a xed point of f ; that is, for some ~ 2 S , f ~ = v v v v v ~ = jM~j M~ = ~, for some positive value since cannot be zero, v M~ v namely = jM~ j. This is a positive eigenvalue of M . v

1 2 1 2 2 1 2 2 2

32

Newton's Relations

Given n reals a , a , : : : , an , let Sk be the sum of the products of the ai taken k at a time, and let Pk = ak + ak + + ak . Consider the generating n

1 2

functions

0

and

1 2 2 1 2 1 2 1 3 1 1 2 1 2

Their product is

0 1 2 2 1 2 1 2 2 2 2 2 2 2 1 2

since P = n and S = 1. We claim the expression is equal to n + n , 1S x + n , 2S x + + Sn, xn, . To see this, consider the coe cient of xk . Since the expression is symmetric, the coe cient is some multiple of Sk . How many times does the term a a ak xk appear? It must have appeared in the product 1 + a x1 + a x 1 + anx as a a akal, where k l n, before having the term al divided out. There are n , k choices for l, and hence the coe cient is n , kSk . Hence,

0 0 1 1 1 2 2 1 2 1 2 1 2

1 2 2 1 2 2 1 2 1 2

1 2 2 1 2 2 1 2 2 1 1 1 1 2 3

nS , P = n , 1S nS , S P + P = n , 2S nS , S P + S P , P = n , 3S n, Pn, = Sn, ; nSn, , Sn, P + Sn, P , + ,1

2 1 1 1 1 2 3 2 1 2 1 3 2 1 1 1

1 2 3

33 or

1 2 2 1 2 1 1 3 1 1 1 2 2 3 1 1 1 2 2

1 2 3

= 0 = 0 = 0 = 0;

and

for m n: The last equation is the well-known recursion sequence for the Pi , and the previous equations known as Newton's relations can help pin down the values of P , P , : : : , Pn, , or vice-versa. Problem. If

1 2 1

2 3 2 3 2 3 4 4 4

1 2 3 1 1 1 1 1 2 2

1 2 2 1 3 1 2 3 1 2 3 4 1 2 3 4 1 2

Here is the last problem of the 1995 Japan Mathematical Olympiad, Final Round. Problem. Let 1 k n be positive integers. Let a , a , : : : , ak be complex numbers satisfying

a + a + + ak = n a + a + + ak = n ak + ak + + ak = n k , , , Show that x + a x + a x + an = xk + n xk, + n xk, + + n . k Solution. Given P = Pn = = Pk = n, we must nd S , S , : ,n, Sk . We :: , by induction. Clearly S = P = n = . will prove that S =

1 2 1 2 2 2 2 1 2 1 2 1 1 2 2

34 Now, for some m, assume S = n , S = n , : : : , Sm, = mn . Then , by the equations above, Pm , S Pm, + S Pm, , +,1m, Sm, P + m,1mSm = 0, or

1 1 2 2 1 1 1 2 2 1 1 1 1

,

,

so that

n
n
m, n n m n , n 1 + n 2 , + ,1 m , 1 + m,1 Sm = 0

1

So by induction, we are done.

The following shred slice appeared in the newsgroup rec.humor.funny. After applying some simple algebra to some trite phrases and cliches, a new understanding can be reached of the secret to wealth and success. Here it goes. Knowledge is Power, Time is Money, and as everyone knows, Power is Work divided by Time. So, substituting algebraic equations for these time worn bits of wisdom, we get: K = P 1 T = M 2 P = W=T 3 Now, do a few simple substitutions. Put W=T in for P in equation 1, which yields: K = W=T 4 Put M in for T into equation 4, which yields: K = W=M 5 Now we've got something. Expanding back into English, we get: Knowledge equals Work divided by Money. What this MEANS is that:

35 1. The More You Know, the More Work You Do, and 2. The More You Know, the Less Money You Make. Solving for Money, we get:

Money equals Work divided by Knowledge. From equation 6 we see that Money approaches in nity as Knowledge approaches 0, regardless of the Work done. What THIS MEANS is: The More you Make, the Less you Know. Solving for Work, we get W =M K 7 Work equals Money times Knowledge From equation 7 we see that Work approaches 0 as Knowledge approaches 0. What THIS MEANS is: The stupid rich do little or no work. Working out the socioeconomic implications of this breakthrough is left as an exercise for the reader.

M = W=K

6

Contest Dates

Here are some upcoming or in some cases, already past contest dates to mark on your calendar. Contest Grade Date Gauss Grades 7 & 8 Wednesday, May 14, 1997 Pascal Grade 9 Wednesday, February 19, 1997 Cayley Grade 10 Wednesday, February 19, 1997 Fermat Grade 11 Wednesday, February 19, 1997 Euclid Grade 12 Tuesday, April 15, 1997 Descartes Grades 12 & 13 Wednesday, April 16, 1997 CIMC Grades 10 & 11 Wednesday, April 16, 1997 AJHSME Grades 7 & 8 Thursday, November 21, 1996 AHSME High School Thursday, February 13, 1997 AIME High School Thursday, March 20, 1997 USAMO High School Thursday, May 1, 1997 AJHSME Grades 7 & 8 Thursday, November 20, 1997 COMC High School Wednesday, November 27, 1996 CMO High School Wednesday, March 26, 1997 APMO High School March, 1997 IMO High School July 18 31, 1997

36

student, Universidad Complutense de Madrid Madrid, Spain For those of us who can not seem to get a strong grip on synthetic geometry, analytic geometry comes in handy. Even though polar coordinates can be superior to rectangular coordinates in some situations, they are systematically ignored by instructors and students alike. The purpose of this series is to introduce their uses with the idea that, as is always happening in mathematics, with a little ingenuity, the concepts central to polar coordinates can be applied elsewhere. This rst article uses polar coordinates in elementary geometry. De nition In polar coordinates, the position of a point P is determined by the distance r from a point O called the pole and the angle between OP and a semi-in nite line called the polar axis. By convention, the polar axis is taken to be the positive x-axis, and the P transformation from polar to cartesian coordinates is given by x = r cos , y = r sin . The inverse change of coordinates is not r so straightforward; p obvious exThe pressions are r = x + y , = arctan y , but the equation for x is not single-valued, even if is re Polar axis stricted to 0; 2 , and is undeO ned at the origin. Fortunately, we need not worry about this: when handling curves in polar coordinates, the change from rectangular to polar coordinates is of little use, and it is convenient to allow r and to take on all real values. With this provision, a point can be referred to by an in nite set of coordinate pairs: r; = ,1nr; + n . Unless you want to do multiple integrals, this is not a problem, but rather something to exploit! Polar Curves Polar curves are usually written in the form r = r, and unlike curves of the form y = y x, they can be closed and need not be simple they can intersect themselves. Implicit curves of the form f r; = 0 can be even more general. From a cartesian equation, the substitution x = r cos , y = r sin yields a polar expression. Throughout this article, I have tried to avoid this whenever possible, and it turns out that it is always possible.

2 2

37 Some symmetries of the curves can be detected by checking the functions r or f r; above for the following simple properties this is not a complete list: The curve is symmetric about the pole if r = r + or

f ,r; = f r;

2

The curve is symmetric about the polar axis if r = r, The curve is symmetric about a line at an angle to the polar axis if

r = r2 ,

The following transformations are also useful: Any curve can be rotated through by substituting , for The x- and y -axes can be permuted by substituting , for

2

r = a.

Example 2. The equation of a line passing through the origin at an angle to the polar axis is = . Exercise 1. Find the equation of a line at an angle to the polar axis passing at a distance d to the pole. Exercise 2. Identify the curve r = 2a cos . The Cosine Law More often than not, when working in polar coordinates, one uses nothing but trigonometry, and the cosine law is the starting point of many derivations. If you think about it, it comes closest to being a `vector addition rule' to use if you need to translate a curve, although this is best done in rectangular coordinates. I will not give a translation rule, because it is cumbersome and is of little use. Instead, I will use the cosine law to derive the equation of a circle of radius centered at R; see gure. Applying the cosine law to side of 4OCP , we have

2

2 2 2 2 2 2 2 2 2 2

38 From this equation, it is evident that if R , then the curve is deP ned for a limited range of given by r , R sin , R , as we would C expect when the origin lies outside R the circle. The squared length of the tangent from O, when sin , = O R2, is P = R cos , = R 1 , R2 = R , ; this is called the potence of the origin w.r.t. the circle. Note that this formula is correct, even when R and sin = R has no solution. Incidentally, the solution to Exercise 2 can be obtained easily by noting that if the origin is on the circle, then R = , and

2 2 2 2 2

Example 3. Polar equation of the ellipse with one focus at the origin and the main axis at an angle to the polar axis. The cosine law applied to side F 0P of triangle FF 0P gives

r F

P 2a , r F

2c

2a , r

= = = =

2 2 2 2 2 2 2

The following curves are all important in their own right, but since their polar expressions are particularly simple, they make good examples of the use of polar coordinates.

39

Conic sections We already have the equation for the ellipse. The polar equation of the parabola is even easier to derive. In the gure, we have the focus at the origin, the axis at an angle to the polar axis and a distance d from the focus to the directrix. From the gure on the previous page, we have

d + r cos P & r V F

q q

d r = d + r cos , = r = 1 , cos , :

Exercise 3. In a similar way, derive the equation for the hyperbola, noting how both branches are handled. Hence, deduce that the general equation of the conic is r = ,e de , , where e is the eccentricity. This equation can be obtained immediately from the de nition of a conic as the locus of the points whose distances to a line called the directrix and a point called the focus are at a constant ratio e. The Cardioid P The cardioid is the trajectory of a point on a circle that rolls on another r circle of the same radius. So deC R 2 P ned, it is a special case of the epicyO " C " cloid, which is the curve described 2 by a point on a circle rolling on another circle with no restriction on the radii; the general equation of the epicycloid is best expressed in parametric form.

1 cos

0 0

In the gure, the two circles have radius R. The condition that the one centered at C 0 rolls on the one centered at C implies that triangles OCP 0 and PC 0P 0 must be congruent. In triangles OCP 0 and PC 0P 0, = 2R cos=2. Similarly, in triangle OP 0 P , r = 2 cos=2. Putting all together, we have

2

r = b + a cos . The cusp at O becomes a loop if b a, and a smooth indentation if b a. The lima on can be de ned as the locus of the feet c

The cardioid is also a special case of Pascal's Lima on, of the equation c

40 of perpendiculars dropped from the origin to tangent lines to a circle. The radius of the circle is b and the distance from O to its centre is a. The Lemniscate P The lemniscate is the locus of the at r a=t points such that the product of their distances to two points 2a apart a O is a . In the gure, the cosine law gives

2

at

2 2

= = = =

r a r r

2 4

4 2

2 2 2 2 2 2 2 2 2 2 2 2 2 2 2

The lemniscate is a special case of Cassini's ovals, which are de ned in the same way, but with no restriction on the product of the distances. The Rose Loosely related to the lemniscate are the roses, of equation P a r = a cos n , O with integer n. For odd n, the curve has n `leaves' and it is traced completely when varies from 0 to . For even n, the curve has 2n `leaves', and it is traced completely only when varies from 0 to 2 see the gure. More general curves can be obtained if n is rational or irrational. In the rst case there is an integer number of overlapping lobes and the curve is closed, but in the latter case the curve never closes, and in fact it is dense in the disc r a. The Spirals Polar coordinates are particularly suited to spirals. The two most famous are the Archimedean Spiral r = a, which is the trajectory of a point whose angular and radial velocities are proportional, and the Logarithmic Spiral r = ea . In fact, any continuous monotonic function that goes to innity as goes to in nity de ned in a semi-in nite interval will give rise to a spiral, like r = a ln . A related feature of polar curves is the limit cycle, occurring when r has a nite limit r at in nity. In that case, the curve winds around the origin in nitely many times, approaching the circle r = r . Recognizing a limit cycle makes it easier to sketch a polar curve.

0 0

41

Straight Lines We nish by deriving the equation of a straight line not passing through the origin. From the gure, we have d = r cos , , where d is the distance from the line to the origin and is the direction of the closest point. An alternative form is d = r sin , , where is the direction of the line and 0 , see the gure.

r O

Additional Problems Problem 1. Considering r + and r , , derive an expression for a secant line to a conic. Passing to the limit ! 0, write an equation for the tangent line at . Problem 2. PQ is a chord through the focus F of a conic, and the tangents at P , Q meet at T . Prove that T lies on the directrix corresponding to F and that FT ? PQ. Problem 3. Let s be the tangent line at the vertex of a parabola and t be the tangent at P . If r and s meet at Q, prove that FQ bisects the angle between FP and the axis of the parabola, and that FQ ? s.

0 0 0

IMO Report

student, University of Waterloo Waterloo, Ontario. After ten days of intensive training at the Fields Institute in Toronto, the 1996 Canadian IMO team travelled to Mumbai, India to participate in the 37th International Mathematical Olympiad. For the rst time in our team's history, every team member brought home a medal, with three silver and three bronze. This year's team members were: Sabin Get me a donut" Cautis, Adrian Da Chef" Chan, Byung Kyu Spring Roll" Chun, Richard YES! WE'VE GOT BAGELS!" Hoshino, Derek Leggo my Eggo" Kisman, and Soroosh Mr. Bean" Yazdani. Our team leaders were J.P. Radishes" Grossman and Ravi Oli" Vakil no, he's not Italian. Special thanks go out to our coaches, Naoki Dr. Cow" Sato and Georg Where's my Ethanol" Gunther.

Richard Hoshino

42 This year's paper was one of the most di cult ever, and thus, the cuto s for medals were among the lowest in history, 28 for gold, 20 for silver and 12 for bronze. Only one student, a Romanian, received a perfect score of 42. Our team's scores were as follows: CAN 1 Sabin Cautis 13 Bronze Medal CAN 2 Adrian Chan 14 Bronze Medal CAN 3 Byung Kyu Chun 18 Bronze Medal CAN 4 Richard Hoshino 22 Silver Medal CAN 5 Derek Kisman 22 Silver Medal CAN 6 Soroosh Yazdani 22 Silver Medal Some weird coincidences: all the silver medallists got the exact same score, are graduating and are headed to the University of Waterloo in September, and all the bronze medallists are eligible to return to Argentina for next year's IMO. Overall, Canada nished sixteenth out of seventy- ve countries, one of our highest rankings ever. A main reason for our success was our combined team score of 36 out of 42 on question 6, a problem that many countries answered very poorly in fact, only two countries had more points on that problem than we did, and they both got 37 out of 42. Unfortunately, question 2 was answered very poorly by Canada, with only one 7, even though the problem was created by our own team leader, J.P. Grossman. We all owe special thanks to Dr. Graham Wright of the Canadian Mathematical Society, Dr. Bruce Shawyer of Memorial University and Dr. Richard Nowakowski of Dalhousie University for their hard work and organization in making our trip possible and Dr. Ed Barbeau of the University of Toronto for all his commitment and dedication to training all the IMO team hopefuls with his year-long correspondence program. Overall, the experience was memorable for all of us, although we could have done without the cockroaches in our rooms. Best of luck to all the students who will be working hard to make the 1997 IMO team, which will be held in Chapadmalal, Argentina near Mar del Plata.

Mayhem Problems

A new year brings new changes and new problem editors. Cyrus Hsia now takes over the helm as Mayhem Advanced Problems Editor, with Richard Hoshino lling his spot as the Mayhem High School Problems Editor, and veteran Ravi Vakil maintains his post as Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only problems | the next issue will feature only solutions. We intend to have problems and solutions in alternate issues.

43 We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions be submitted by 1 June 1997, for publication in the issue 5 months ahead; that is, issue 6. We also request that only students submit solutions see editorial, but we will consider particularly elegant or insightful solutions for others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca H217. Let a , a , a , a , a be a ve-term geometric sequence satisfying the inequality 0 a a a a a 100, where each term is an integer. How many of these ve-term geometric sequences are there? For example, the sequence 3, 6, 12, 24, 48 is a sequence of this type. H218. A Star Trek logo is inscribed inside a A circle with centre O and radius 1, as shown. Points B A, B, and C are selected on the circle so that AB = AC and arc BC is minor that is ABOC is not a BB O B convex quadrilateral. The area of gure ABOC is equal to sin m , where 0 m 90 and m is an in- SSBB SB teger. Furthermore, the length of arc AB shaded as S B shown is equal to a=b, where a and b are relatively B C prime integers. Let p = a + b + m.

1 2 3 4 5 1 2 3 4 5

i If p = 360, and m is composite, determine all possible values for m. ii If m and p are both prime, determine the value of p.

be expressed in the form pb , where a and b are relatively prime positive integers, determine the ordered pair a; b.

1 2

H219. Consider the in nite sum a a a a S = 10 + 10 + 10 + 10 + ; where the sequence fan g is de ned by a = a = 1, and the recurrence p relation an = 20an, + 12an, for all positive integers n 2. If S can a

0 1 2 3 0 2 4 6 0 1

44

Let T be the sum of the elements of this set whose representation in base 2p consists only of digits from 0 to p , 1. Prove that 2n T = p , 1=2p , 1. S

H220. Let S be the sum of the elements of the set f1; 2; 3; : : : ; 2pn , 1g:

Advanced Problems

Editor: Cyrus Hsia, 21 Van Allen Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu A193. If f x;y is a convex function in x for each xed y, and a convex function in y for each xed x, is f x;y necessarily a convex function in x and y ? A194. Let H be the orthocentre point where the altitudes meet of a triangle ABC . Show that if AH : BH : CH = BC : CA : AB , then the triangle is equilateral. A195. Compute tan 20 tan 40 tan 60 tan 80 . A196. Show that r + ra + rb + rc 4K , where r, ra, rb, rc, and K are the inradius, exradii, and area respectively of a triangle ABC .

2 2 2 2

Editor: Ravi Vakil, Department of Mathematics, One Oxford Street, Cambridge, MA, USA. 02138-2901 ravi@math.harvard.edu C70. Prove that the group of automorphisms of the dodecahedron is S , the symmetric group on ve letters, and that the rotation group of the dodecahedron the subgroup of automorphisms preserving orientation is A . C71. Let L , L , L , L be four general lines in the plane. Let pij be the intersection of lines Li and Lj . Prove that the circumcircles of the four triangles p p p , p p p , p p p , p p p are concurrent. C72. A nite group G acts on a nite set X transitively. In other words, for any x; y 2 X , there is a g 2 G with g x = y . Prove that there is an element of G whose action on X has no xed points.

5 5 1 2 3 4 12 23 31 23 34 42 34 41 13 41 12 24

45

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 "11" or A4 sheets of paper. These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 September 1997. They may also be sent by email to cruxeditor@cms.math.ca. It would be appreciated A if email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

1 2

ABCD is a convex quadrilateral, and O is the intersection of its diagonals. Let L; M; N be the midpoints of DB; BC; CA respectively. Suppose that AL; OM; DN are concurrent. Show that

where F denotes the area of gure F . 2202. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Suppose than n 3. Let A ; : : : ; An be a convex n-gon as usual with interior angles A ; : : : ; An . Determine the greatest constant Cn such that

1 1

either AD k BC or

ABCD = 2 OBC ;

n n X 1 X 1 Cn , A : k k k Ak

=1 =1

46

2203. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let ABCD be a quadrilateral with incircle I . Denote by P , Q, R and S , the points of tangency of sides AB , BC , CD and DA, respectively with I . Determine all possible values of PR;QS such that ABCD is cyclic. 2204. Proposed by Sefket Arslanagi
c, Berlin, Germany. p For triangle ABC such that Ra + b = c ab, prove that

Here, a, b, c, R, and r are the three sides, the circumradius and the inradius of 4ABC . 2205. Proposed by V
aclav Konecn
y, Ferris State University, Big Rapids, Michigan, USA. Find the least positive integer n such that the expression has a maximum which is a rational number where A, B , C are the angles of a variable triangle. 2206. Proposed by Heinz-Jurgen Sei ert, Berlin, Germany. Let a and b denote distinct positive real numbers. a Show that if 0 p 1, p 6= , then

3 r 10 a:

+2 +1

1 1

1 2

1 2pab + a + b : 3 2

Note: log" is, of course, the natural logarithm. 2207. Proposed by Bill Sands, University of Calgary, Calgary, Alberta. Let p be a prime. Find all solutions in positive integers of the equation:

a b

2 + 3 = 5:

47

2208. Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. 1. Find a set of positive integers fx; y;z; a; b; c; kg such that

y z = a +k z x = b +k x y = c +k

2 2 2 2 2 2 2 2 2 2 2 2

2. Show how to obtain an in nite number of distinct sets of positive integers satisfying these equations.

2209. Proposed by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain. Let ABCD be a cyclic quadrilateral having perpendicular diagonals crossing at P . Project P onto the sides of the quadrilateral. 1. Prove that the quadrilateral obtained by joining these four projections is inscribable and circumscribable. 2. Prove that the circle which passes through these four projections also passes through the mid-points of the sides of the given quadrilateral.

Madrid, Spain. Given a = 1, the sequence fan g n = 1; 2; : : : is given recursively by

0 1 2 2

n Gomez Rey, IES Luis Bu~ uel, Alcorc n on,

Which terms have value 0? 2211. Proposed by Bill Sands, University of Calgary, Calgary, Alberta. Several people go to a pizza restaurant. Each person who is hungry" wants to eat either 6 or 7 slices of pizza. Everyone else wants to eat only 2 or 3 slices of pizza each. Each pizza in the restaurant has 12 slices. It turns out that four pizzas are not su cient to satisfy everyone, but that with ve pizzas, there would be some pizza left over. How many people went to the restaurant, and how many of these were hungry"?

48

2212. Proposed by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. Let S = f1; 2; : : : ; ng where n 3. a In how many ways can three integers x, y , z not necessarily distinct be chosen from S such that x + y = z ? Note that x + y = z and y + x = z are considered to be the same solution. b What is the answer to a if x, y , z must be distinct?

A generalization of problem 2095 1995: 344, 1996: 373 . Suppose that the function f u has a second derivative in the interval a; b, and that f u 0 for all u 2 a; b. Prove that 1. y , z f x + z , xf y + x , y f z 0 for all x; y;z 2 a; b,

0 for all u 2 a; b; 2. y , z f x + z , xf y + x , y f z = 0 for all x; y;z 2 a; b,

if and only if f 00 u

z y x z y x

Correction

2137. 1996: 124, 317 Proposed by Aram A. Yagubyants, Rostov na Donu, Russia. Three circles of equal radius t pass through a point T , and are each inside triangle ABC and tangent to two of its sides. Prove that: rR , ii T lies on the line segment joining the i t = R+r NB: r instead of 2 centres of the circumcircle and the incircle of 4ABC .

49

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 1996: 33 Proposed by Ji Chen, Ningbo University, China. Let a; b; c be the sides and A; B; C the angles of a triangle. Prove that for any k 1, of Mitrinovi
, Pe ari
, Volenec, Recent Advances in Geometric Inequalities. c c c I. Solution by Hoe Teck Wee, Singapore. sink x for 0 x . Then, for 0 k 1, we have Let f x =

2101.

X ak 3 X k A a; where the sums are cyclic. The case k = 1 is known; see item 4.11, page 170

x

k, sin f 0x = kx cos x , x x sin x : For x =2, we have cos x 0, so that kx cos x , sin x 0. For x =2, we have cos x 0 and tan x x kx, so that kx cos x , sin x 0. kx cos x , sin x sink, x 0. Therefore f 0x = x Without loss of generality, we may assume that A B C . For 0 k 1, we have that f x is a non-increasing function, so that f A f B f C . Thus, by Tchebyshev's inequality, we have k ! sin A + sink B + sink C A+B +C 3

sink A + sink B + sink C : A B C By the Sine Rule, we have a = 2R sin A, b = 2R sin B and c = 2R sin C , where R is the circumradius of 4ABC . Multiply the inequality by 2Rk and substitute A + B + C = to get X ak 3 X k 1 A a: For k 0, we have k k k a b c = ak bk ck = a b c : A B C Thus, by using Tchebyshev's inequality again, ?? holds for k 0.

1 2 1 2

50 In conclusion, ?? holds for any k 1. II. Solution by Kee-Wai Lau, Hong Kong. Edited We let, without loss of generality, a b c, so A B C: that , , Next, put f k = ak =A + bk =B + ck =C ak + bk + ck , , then

1

X k, a 0; AB where the sums are cyclic. Since we are given that f 1 3=n, it follows that f k 3=n for k 1.

f 0k = ,

2

Also solved by FLORIAN HERZIG, student, Perchtoldsdorf, Austria; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV Y, Ferris State University, Big Rapids, Michigan, USA; HEINZ KONECN JURGEN SEIFFERT, Berlin, Germany; and the proposer. One incorrect solution was received. Janous establishes the following generalization. Let k and ` be real numbers. Then: 1. k ` for the cases

Xa 3 X ak ; A`

0 k ` 1, k 0 `, k 0 and ` ,1:

2. where

X ak 3
` X k a; A`

k 0 and , 1 ` 0:

1996: 33 Proposed by Toshio Seimiya, Kawasaki, Japan.

ABC is a triangle with incentre I . Let P and Q be the feet of the perpendiculars from A to BI and CI respectively. Prove that AP + AQ = cot A : BI CI 2

ers! Solution by Panos E. Tsaoussoglou, Athens, Greece, and by eight oth-

2102.

AP AB , AQ , in 4AQC , we have sinC=2 = AC BI = AB , in 4ABI , we have sinA=2 cos C=2 CI = AC , in 4ACI . we have sinA=2 cos B=2

so that

AP + AQ = sinB=2 cosC=2 + sin C=2 cos B=2 BI CI sinA=2 sin A=2 + C= A=2 = sinB=2A=2 2 = cosA=2 = cotA=2: sin sin

AIB = , A=2 , B=2 = =2 + C=2, so that sin AIB = cosC=2. Other solvers used the equally e cient relations: BI = r= sinB=2, or BI = 4R sinA=2 sinC=2.

Also solved by MIGUEL AMENGUAL COVAS, Cala Figuera, Mallorca, Spain two solutions; FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CARL BOSLEY, student, Washburn Rural High School, Topeka, Kansas, USA; CARL BOSLEY, student, Washburn Rural High School, Topeka, Kansas, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; THEODORE CHRONIS, student, Aristotle University of Thesn saloniki, Greece; HAN PING DAVIN CHOR, Student, Cambridge, MA, USA; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; JOHN G. HEUVER, Grande Prairie Composite High School, Grande Prairie, Alberta; CYRUS HSIA, student, University of Toronto, Toronto, Ontario; WALTHER JANOUS, Ursul inengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; P. PENNING, Delft, the Netherlands; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; WALDEMAR POMPE, student, University of Warsaw, Poland; HEINZ-JURGEN SEIFFERT, Berlin, Germany; D.J. SMEENK, Zaltbommel, the Netherlands; GEORGE TSAPAKIDIS, Agrinio, Greece; MELITIS D. VASILIOU. Elefsis, Greece; CHRIS WILDHAGEN, Rotterdam, the Netherlands; and the proposer.

52

ABC is a triangle. Let D be the point on side BC produced beyond B such that BD = BA, and let M be the mid-point of AC . The bisector of ABC meets DM at P . Prove that BAP = ACB.

2103.

Solution by Hans Engelhaupt, Franz Ludwig Gymnasium, Bamberg, Germany. Let PX be parallel to AC with X lying on the line BC . Let Y be the intersection of PX with AD. P is the midpoint of XY because M is the mid-point of AC . Then B is the mid-point of DX PB is parallel to AD since 2 DAB =

DAB + BDA = ABC = 2 PBA : Hence BX = BD = AB: Triangle BPA is congruent to triangle BPX PB = PB; AB = XB; ABP = XBP . Therefore, BAP = BXP = BCA PX kAC . X P Y A M

=2

C

=2 =2

Also solved by FEDERICO ARDILA, student, MassachusettsInstitute of Technology, Cambridge, Massachusetts, USA; SEFKET ARSLANAGIC, Berlin, Germany; FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, and MARIA ASCENSION LOPEZ CHAMORRO, I.B. Leopoldo Cano, Valladolid, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; HAN PING DAVIN CHOR, Student, Cambridge, MA, USA; TIM CROSS, King Edward's School, Birmingham, England; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MITKO

53 CHRISTOV KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; KEE-WAI LAU, Hong Kong; VASILIOU MELETIS, Elelsis, Greece; P. PENNING, Delft, the Netherlands; WALDEMAR POMPE, student, University of Warsaw, Poland; D.J. SMEENK, Zaltbommel, the Netherlands; HOE TECK WEE, Singapore; and the proposer.

Case 2 If k = 3, then m + mn + n = 37 = m 37 = m 6. Quick checkings reveal that there are no solutions for m = 1, 2, 5, 6. When m = 3, a = 27 and from n + 3n = 28 we get n = 4, ,7. Thus r = ; , yielding the solutions: 111 = 27 + 36 + 48 = 27 , 63 + 147: 4

2 2 2 2 4 3 7 3

2104. 1996: 34 Proposed by K.R.S. Sastry, Dodballapur, India. In how many ways can 111 be written as a sum of three integers in geometric progression? Solution by Zun Shan, Nanjing Normal University, Nanjing, China. The answer is seventeen or sixteen depending on whether we allow the common ratio of the G.P. geometric progression to be zero or not. Suppose 111 = a + ar + ar where a is an integer and r is a rational number. If r = 0, then we get the trivial solution 111 = 111 + 0 + 0: 1 n 6= 0 where m and n are nonzero integers. Without loss Suppose r = m of generality, we may also assume that m 0 and m; n = 1. Since the reverse of the G.P. a; ar; ar is another G.P. ar ; ar; a, we may also assume that jrj 1 and so 0 m jnj. From a1 + r + r = 111 we get am + mn + n = 111m . Since clearly m + mn + n ; m = 1 we have m ja. Letting a = km where k is an integer we then get km + mn + n = 111 which implies kj111. Since m + mn + n 0 and 111 = 3 37, we have k = 1; 3; 37, or 111. Note that m + mn + n = m + jnjm + jnj m . Case 1 If k = 1, then m + mn + n = 111 = m 111 = m 10. When m = 1, a = 1 and from n + n = 110 we get n = 10; ,11. Thus r = 10, ,11 and we obtain the solutions: 111 = 1 + 10 + 100 = 1 , 11 + 121: 2 For 2 m 9 it is easily checked that the resulting quadratic equation in n has no integer solutions. When m = 10, a = 100 and from n + 10n = 11 we get n = 1, ,11. Since m jnj, n = ,11 and r = , yielding the solution: 111 = 100 , 110 + 121: 3

2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 11 10

54 When m = 4, a = 48 and from n + 4n = 21 we get n = 3, ,7. Since m jnj, n = ,7 and r = , yielding the solution:

2

111 = 48 , 84 + 147:

2

7 4

5

2

2

111 = 37 + 37 + 37 = 37 , 74 + 148:

2 2 2 2

6

and we get the solution

111 = 111 , 111 + 111: 7 Reversing the summand in 2 , 7 and noting that two of them are

symmetric", we obtain seventeen solutions in all:

111 = = = = = =

= = = = = =

= = = = =

Also solved by MIGUEL AMENGUAL COVAS, Cala Figuera, Mallorca, Spain, who assumed r 6= 0 and found sixteen solutions; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; both of them found all seventeen solutions. There were also two incomplete and twenty-three incorrect solutions submitted! Among these twenty-three, thirteen submissions claimed six solutions; six submissions claimed ve solutions; two submissions claimed six or nine solutions; one submission claimed two solutions, and one submission claimed one solution only. Most of the errors were the result of assuming by mistake that a1 + r + r = 111 = 1 + r + r must be an integer.

2 2

2105. 1996: 34 Proposed by Christopher J. Bradley, Clifton College, Bristol, UK Find all values of for which the inequality

holds for all positive real numbers x; y;z .

3 3 3

55 Solution by Murray S. Klamkin, University of Alberta, Edmonton, Alberta. On setting x = y = 1 and z = 0, we obtain 4 1 + 2 and thus nd that must be 1. We now show that the inequality holds for all 1. First, if = 1, the inequality reduces to

x + y + z + 6xyz x + y + zyz + zx + xy; which is equivalent to the special case n = 1 of the known Schur inequality xnx , yx , z + yny , zy , x + znz , xz , y 0; true for all real n, and which has come up many times in this journal. The rest will follow by showing that for all 1, 1 + x + y + zyz + zx + xy , 31 + 3xyz 1 + 1x + y + zyz + zx + xy , 31 + 3xyz: 1

3 3 3

2x + y + z 1 + x + y + z yz + zx + xy , 31 + 3xyz; then 1 says that the right hand side is largest when = 1, so doing the case = 1 would be enough. But 1 can be written 1 , x + y + z yz + zx + xy , 9xyz 0 which after cancelling the positive factor 1 , is a known elementary in3 3 3

1 1 1 x + y + z x + y + z 9:

Also solved by CARL BOSLEY, student, Washburn Rural High School, Topeka, Kansas, USA; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; HEINZJURGEN SEIFFERT, Berlin, Germany; PANOS E. TSAOUSSOGLOU, Athens, Greece; and HOE TECK WEE, Singapore. There were three incorrect solutions sent in.

2106. 1996: 34 Proposed by Yang Kechang, Yueyang University, Hunan, China. A quadrilateral has sides a; b;c; d in that order and area F . Prove that

2a + 5b + 8c , d 4F:

2 2 2 2

56 Solution by Federico Ardila, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA. Let ABCD be the quadrilateral with AB = a, BC = b, CD = c, and DA = d. We can assume, without loss of generality, that AC = 1. Therefore, we can locate the quadrilateral in a system of Cartesian coordinates where

A = 0; 0; B = p; q; C = 1; 0; D = r; s: We assume that ABCD is simple so that its area is well-de ned. If ABCD

is not convex we can make it convex and keep the side lengths the same while increasing the area. This means that we will be done if we can show that the result is true for convex quadrilaterals. It's also clear from this that if the result is true for convex quadrilaterals, then equality cannot hold for non-convex quadrilaterals. Therefore, assume q 0 and s 0. Now note that

and

2a + 5b = = = 2a + 5b

2 2 2 2 2 2

2 2 2 2 2 2 2 5 2 7 10 7 25 7 2 2 2 2 2 2 2

2

as we wished to prove where ABC and CDA refer to the areas of the two triangles ABC and CDA respectively. For equality to hold when A = 0; 0 and C = 1; 0, it must hold in steps ??, ??, and ??. Therefore p = , r = , q = , , and s = . Thus, in general, equality holds if and only if ABCD is directly similar to quadrilateral A B C D , where

5 7 8 7 1 7 1 7

,

, = 7 jqj , + 2jq j + 7 jsj , + 2jsj 2,jqj + jsj = 4ABC + 4CDA: 2a + 5b + 8c , d 4F;

2 2 2 8 7 8 7 2 64 7 2 2 2 2 2 2 2 2 7 2 1 7 2 1 7 1 7 2 1 7 2 2 2 2 2

3

4

0 0 5 7 1 7 0 0 8 7 1 7

57 Also solved by WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI LAU, Hong Kong; and the proposer. KONECNY makes the observation that the quadrilateral is cyclic and that ABD = 135 . The proposer makes the early observation that the maximum area for a quadrilateral with xed sides occurs when it is cyclic and uses properties of cyclic quadrilaterals in the proof. He also generalizes the result to an inequality which JANOUS uses in his proof and which appears in the Addenda to the Monograph Recent Advances in Geometric Inequalities" by D. S. Mitrinovi et al. in I. Journal of Ningbo University 4, No. 2 Dec. c 1991, 79 145.

1 1 2 2 1 1 2 2 1 1 1 2 2 2

2107. 1996: 34 Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. Triangle ABC is not isosceles nor equilateral, and has sides a; b; c. D and E are points of BA and CA or their productions so that BD = CE = a. D and E are points of CB and AB or their productions so that CD = AE = b. Show that D E k D E . Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let S be the intersection of AB and D E . Editor's comment by Chris Fisher. Even though there seem to be two choices for each Di and Ei , no solver had any trouble choosing the positions that make the result correct; furthermore, it must have been obvious" to eveyone but me that AB is not parallel to D E , so that S exists. Alas, perhaps I need stronger glasses. Then CS is the bisector of ACB , since CE = CB and CA = CD . Therefore

1 1 1 1 2 2 2 2 1 1 2 2 2 1 2 1 1 2

Also solved by FEDERICO ARDILA, student, MassachusettsInstitute of Technology, Cambridge, Massachusetts, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; JOHN G. HEUVER, Grande Prairie Composite High School, Grande Prairie, Alberta; CYRUS HSIA, student, University of Toronto, Toronto, Ontario; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Aus tria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; P. PENNING, Delft, the Netherlands; JOEL SCHLOSBERG, student, Hunter

58 College High School, New York NY, USA; GEORGE TSAPAKIDIS, Agrinio, Greece; MELITIS D. VASILIOU. Elefsis, Greece; and the proposer. Janous adds the observation that D E and D E are not only parallel, but their lengths are in the ratios a : b as is clear from the featured solution.

1 1 2 2

2 2 2

2108. 1996: 34 Proposed by Vedula N. Murty, Andhra University, Visakhapatnam, India. Prove that

Solution by Florian Herzig, student, Perchtoldsdorf, Austria, modi ed slightly by the editor. By the arithmetic-geometric mean inequality we have

p a b + ab + b c + bc + c a + ca 6 6 a b c = 6abc;

2 2 2 2 2 2 6 6 6

which implies

2 2 2 2 2 2 2 2 2 2 2 2

or

9a + bb + cc + a 8a + b + cab + bc + ca = 4a + b + cab + c + bc + a + ca + b:

Using the arithmetic-geometric mean inequality again, we then have

1

1 3 a + b b + c c + a a + b + c : 4 abc 3 Clearly, equality holds if a = b = c. Ed. In fact, if equality holds, then from 1 we have ab + c = bc + a = ca + b. The rst equality implies

2 2 2

59

a = b and the second one implies b = c. Thus, equality holds in the given inequality if and only if a = b = c. This was observed by about half of the

solvers. Also solved by FEDERICO ARDILA, student, MassachusettsInstitute of Technology, Cambridge, Massachusetts, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; HAN PING DAVIN CHOR, Student, Cambridge, MA, USA; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; TIM CROSS, King Edward's School, Birmingham, England; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; KEE-WAI LAU, Hong Kong; JUAN-BOSCO ROMERO MARQUEZ, Universidad de Valladolid, Valladolid, Spain; JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. Janous commented that upon the transformation the given inequality can be shown to be equivalent to

1 a ! a; b ! 1; c ! 1; b c

r ab + bc + ca

3

3 a + bb + cc + a 8

which is known in the literature as Carlson's inequality cf. eg. P.S. Bullen, D.S. Mitrinovic and P.M. Vasic, Means and Their Inequalities", Dordrechf, 1988. An anonymous reader commented that in this form, the inequality was problem 3 of the 1992 Austrian-Polish Mathematics Competition and has appeared in Crux before see 1994:97; 1995:336-337 . Several solvers showed that the given inequality is equivalent to various other trigonometric inequalities involving a triangle XY Z , for example or

etc. These inequalities can be found in Geometric Inequalities" by O. Bottema et al. 1996: 34 Proposed by Victor Oxman, Haifa, Israel. In the plane are given a triangle and a circle passing through two of the vertices of the triangle and also through the incentre of the triangle. The incentre and the centre of the circle are not given. Construct, using only an unmarked ruler, the incentre.

2109.

60 Solution by P. Penning, Delft, the Netherlands. Let the triangle be ABC , and , the circle passing through B; C and the incentre. The angles of the triangle are denoted by the symbol for the corresponding vertex A; B or C . A

B0 S

..

C0 C

,

ANALYSIS: Let point S be the intersection of the circumcircle and the angular bisector through A. The arcs SB and SC of the circumcircle are now equal and so are the chords SB and SC . Introduce X on AS such that SX = SB = SC:

Modern Geometry, 292 . Editor's note: If either AB or AC is tangent to ,, then they both are and AB = AC . Suppose AB is tangent to ,. Then SBA = , so BSA + SAB = . Since SC = SB; BCS = SBC = SAC = SAB. Therefore, ACS = ACB + BCS = BSA + SAB = and AC is tangent to ,. In addition, tangents to a circle from an exterior point are equal, so AB = AC: So if AB 6= AC , neither line is tangent to ,. Let B 0 and C 0 be the other intersections of AB , respectively AC , with ,. There is mirror-symmetry with respect to the line AS : , remains ,; AB re ects into AC and AC re ects into AB ; B and C 0 are mirror-images and so are C and B 0 . The side BC becomes B0C 0; as a consequence they must intersect on the mirror-line AS. CONSTRUCTION: Find the other two intersections, B 0 and C 0 , of AB and AC with the circle ,. The intersection of BC and B 0 C 0 is M . The incentre is the inter2 2 2

BSA = BCA = C ; 4XBS is isosceles with SX = SB, so XBS = 90 , C=2: CBS = CAS = A=2; XBC = 90 , C=2 , A=2 = B=2: So BX is the angular bisector at vertex B , and X must be the incentre. The circle , apparently has the point S as centre. It does, see Roger A. Johnson,

61 section of AM and ,. COMMENT: The construction fails if ABC is isosceles, with AB = AC . In that case , touches both AB and AC in B and C respectively. M is now the midpoint of BC , but that cannot be found with unmarked ruler. Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol,
UK; RICHARD I. HESS, Rancho Palos Verdes, California, USA; VACLAV Y, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI
KONECN LAU, Hong Kong; and the proposer. 1996: 35 Proposed by Jordi Dou, Barcelona, Spain. Let S be the curved Reuleaux triangle whose sides AB , BC and CA are arcs of unit circles centred at C , A and B respectively. Choose at random and uniformly a point M in the interior and let C M be a chord of S for which M is the midpoint. Find the length ` such that the probability that C M ` is 1=2. Solution by the proposer. Let be the locus of the mid-point M of segments of constant length , whose ends S and S move on the boundary of S . For the points M inside the chords bisected by M are greater than . ? The area contained between S and is . It is su cient to show that

1 2

2110.

!1 , p3 2 ' 0:67: `= Brief proof of the assertion ? Special Case of Holditch's Theorem The ends S , S of the chord of constant length move along the contour of the closed curve S . The mid-point M describes the curve . Let S = x ; y ; S = x ; y , and M = x1 x2 ; y1 y2 . Suppose that x , y , x , y are functions of t such that for t t t , we have S , S describing S. Z t1 Z t1 Z t1 S = y dx = y dx = 1 y dx + y dx t t0 2 Z0 t1 Zt0t1 1 = y dx = 4 y + y dx + dx :

1 2 1 1 1 2 2 2 + 2 + 2 1 1 1 2 2 0 1 2 1 1 2 2 1 1 2 2

Since S = ,

2

p3

4

, we will have

` = S : 4 2

2

Then

t0

1 Z t1 y , y dx , dx : S , =4 t0

2 1 2 1

t0

62 Substitute X = x , x , Y = y , y , giving

2 1

S , =4

1 Z t1

t0

Y dX = ; 4

2

2111. 1996: 35 Proposed by Hoe Teck Wee, student, Hwa Chong Junior College, Singapore. Does there exist a function f : N ,! N where N is the set of positive integers satisfying the three conditions: i f 1996 = 1; ii for all primes p, every prime occurs in the sequence f p, f 2p, f 3p; : : : ; f kp; : : : in nitely often; and iii f f n = 1 for all n 2 N ?

tario.

I. Solution by Shawn Godin, St. Joseph Scollard Hall, North Bay, On-

where condition is: if the prime factorization of x is x = pei , there exists i a power ei such that ei 2 and ei ej for all j 6= i. For example, 109850 has condition , since 109850 = 2 5 13 and the power of 13 is bigger than 2 and bigger than all other powers in the factorization; thus f 109850 = 13. Now f satis es condition i since f 1996 = f 2 499 = 1; f satis es condition ii because for any two primes p and q, f xi = q for every xi = q ip, i = 3; 4; : : : ; f satis es condition iii since for all n either f n = 1 or f n = pi for some prime pi, and in either case f f n = 1.

2 3 2

Yes, a function does exist that satis es the three conditions. It is: f x = pi if condition holds; 1 otherwise;

II. Solution by Chris Wildhagen, Rotterdam, the Netherlands. For each n 2 N let qn be the nth prime and bn be the number of 1's in the binary representation of n. De ne f : N ! N as follows: n f m = qb n if m: = p with p prime and n 2; 1 else

63 Clearly f satis es the three given conditions. Also solved by FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; MANSUR BOASE, student, St. Paul's School, London, England; CARL BOSLEY, student, Washburn Rural High School, Topeka, Kansas, USA; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; KEITH EKBLAW, Walla Walla, Washington, USA; RICHARD I. HESS, Rancho Palos Verdes, California, USA; CYRUS HSIA, student, University of Toronto, Toronto, Ontario; DAVID E. MANES, State University of New York, Oneonta, NY, USA; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; and the proposer. There were three incorrect solutions sent in. Most solvers gave a variation of Solution I.

2112. 1996: 35 Proposed by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario. Find a four-digit base-ten number abcd with a 6= 0 which is equal to aa + bb + cc + dd. Solution by Cyrus Hsia, student, University of Toronto, Toronto, Ontario modi ed slightly by the editor. We rst stipulate that 0 = 1. Let m = abcd, s = aa + bb + cc + dd and assume that m = s. Clearly, 10 m 10 . If x 6 for any x 2 fa; b; c; dg then s 6 10 which is a contradiction. So a; b;c; d 5. If x 5 for all x 2 fa; b; c; dg, then s 4 4 = 1024 and furthermore a = b = c = d = 4 is the only combination for which s 10 . However, in this case, s = 1024 6= 4444 = m. Hence x = 5 for some x 2 fa; b; c; dg. We cannot have more than one 5 or else s 2 5 = 6250 would imply that some digit of m is at least 6. Hence, we have exactly one 5. Since s 5 = 3125 and s 5 + 3 4 = 3893 4000, we must have a = 3. Thus, s = 5 +3 +xx +yy = 3152+xx+yy where x; y 2 fa; b; c; dg. Without loss of generality, we may assume that 0 y x 4. If x = 0, then y = 0 and s = 3154 which has no 0 among its digits. If x = 1, then y = 0; 1 and s = 3154 while m has no 4 among its digits. If x = 2, then s = 3156 + y y and it is easily veri ed that s has no 2 among its digits for y = 0; 1; 2. If x = 3, then s = 3179 + y y and it is easily veri ed that s has no 5 among its digits for y = 0; 1; 2; 3. If x = 4, then s = 3408 + y y and, again, it is readily checked that s has no 5 among its digits when y = 0; 1; 2; 4. However, when y = 3, s = 3435 which is clearly a solution. To summarize, m = 3435 is the only solution.

0 3 4 6 4 4 3 5 5 5 4 5 3

64 Also solved by MIGUEL AMENGUAL COVAS, Cala Figuera, Mallorca, Spain; FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; MANSUR BOASE, student, St. Paul's School, London, England; CHRISTOPHER J. BRADLEY, Clifton College,
Bristol, UK; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; n THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; TIM CROSS, King Edward's School, Birmingham, England; JEFFREY K. FLOYD, Newnan, Georgia, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S.
KLAMKIN, University of Alberta, Edmonton, Alberta; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; LUKE LAMOTHE, student, St. Joseph Scollard Hall S.S., North Bay, Ontario, KATHLEEN E. LEWIS, SUNY Oswego. Oswego, NY, USA; DAVID E. MANES, State University of New York, Oneonta, NY, USA; JOHN GRANT McLOUGHLIN, Okanagan University College, Kelowna British Columbia; P. PENNING, Delft, the Netherlands; CORY PYE, student, Memorial University of Newfoundland, St. John's, Newfoundland; JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH, Mount Royal College, Calgary, Alberta; CHRIS WILDHAGEN, Rotterdam, the Netherlands; and the proposer. Of the twenty-six solvers including the proposer, nine of them only gave the answer 3435. About half of all the solvers claimed, with or without proof, that 3435 is the only solution. Chronis, Hess, and Janous found the answer by computer search. Hess remarked that no other solutions were found for the present problem and the corresponding problem on 5 digit integers. Janous investigated the corresponding n digit problem of nding n, X all n digit integers an, an, : : :a a which equal aak . He showed that k k a necessary condition is n 10. For n 1, he conducted an extensive, but not exhaustive, computer search, which revealed no solutions other than the one found by all the solvers! He made a guess that 1 and 3435 are the only integers with the desired property. Can any reader prove or disprove this?

1 1 2 1 0 =0

Founding Editors R dacteurs-fondateurs: L opold Sauv & Frederick G.B. Maskell e e e Editors emeriti R dacteur-emeriti: G.W. Sands, R.E. Woodrow, Bruce L.R. Shawyer e Founding Editors R dacteurs-fondateurs: Patrick Surry & Ravi Vakil e Editors emeriti R dacteurs-emeriti: Philip Jong, Je Higham, e J.P. Grossman, Andre Chang, Naoki Sato, Cyrus Hsia

Crux Mathematicorum

Mathematical Mayhem

65

No. 9 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7 In this issue, we feature a university undergraduate mathematics competition. We invite your solutions, especially from university students. Please send me your nice solutions.

September 18, 1996

Answer as many questions as you can. Complete solutions carry more credit than scattered comments about many problems.

1. If n is any integer, show that n5 , n is divisible by 5. 2. A line l with slope m = 2 cuts the parabola y 2 = 8x to form a chord. Find the equation of l if the midpoint of the chord lies on x = 4. 3. Show that three tangents can be drawn from the origin to the curve given by y = x3 , 13x2 + 10x , 36. 4. Prove that 0 integers n. 5. Show that

If the sides opposite to the angles A; B; C have lengths a; b; c, respectively, prove that ac2 = b , a2 b + a.

66

No. 180 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. We begin this number of the Corner with the problems of the 3rd Mathematical Olympiad of the Republic of China Taiwan. The contest was written April 14 and 15, 1994. Many thanks go to Richard Nowakowski, Canadian Team Leader to the IMO in Hong Kong for collecting these problems and many others.

First Day | April 14, 1994

1. Let ABCD be a quadrilateral with AD = BC and A + B = 120 . Three equilateral triangles 4ACP , 4DCQ and 4DBR are drawn

on AC , DC and DB away from AB . Prove that the three new vertices P , Q and R are collinear. 2. Let a, b, c be positive real numbers, be a real number. Suppose that

+2

f = abca + b + c ; g = a b + c , a + b +2a , b + c + c +2a + b , c: Determine jf , g j. 3. Let a be a positive integer such that 51994 , 1 j a. Show that the expression of the number a in the base 5 contains at least 1994 digits

di erent from zero.

4. Prove that there are in nitely many positive integers n having the following property: for every arithmetic progression a1 ; a2 ; : : : ; an of integers with n terms, both the mean and standard deviation of the set fa1; a2; : : : ; ang are integers. Note: For any set fx1; x2; : : : ; xn g of real numbers, the mean of the set is de ned to be the number

x = x1 + x2 + + xn n

sP

xi , x2 :

5. Let X = f0; a; b; cg and M X = ff j f : X ! X g be the set of all functions from X into itself. Here, an addition table of X is given as follows:

0 a b c 0 0 a b c a a 0 c b b b c 0 a c c b a 0 1 If S = ff 2 M X j f x y x = f x f y f x; 8x;y 2 X g, determine the number of elements of S . 2 If I = ff 2 M X j f x x = f x f x; 8x 2 X g, determine the number of elements of I . 6. For ,1 x 1 de ne h

p n

p ni Tn x = 21n x + 1 , x2 + x , 1 , x2 1 Prove that, for ,1 x 1, Tn x is a monic polynomial of degree n in the x-variable and the maximum value of Tn x is 2n1,1 . 2 Suppose that px = xn +an,1 xn,1 + +a1 x+a0 is a monic polynomial with real coe cients such that for all x in ,1 x 1, px , 2n1,1 . Prove that there exists x in ,1 x 1 such that px 2n1,1 .

Last issue we gave Five Klamkin Quickies. Here we give his Quick" solutions plus another 5 problems. Many thanks to Murray S. Klamkin, the University of Alberta.

October 21, 1996

4

given regular n-gon is one whose vertices are the midpoints of the sides of the given regular n-gon. 8. If 311995 divides a2 + b2, prove that 311996 divides ab. 9. Determine the minimum value of

6. Determine the four roots of the equation x + 16x , 12 = 0. 7. Prove that the smallest regular n-gon which can be inscribed in a

p pbd

p pac

+ 12 + 2

+ 12 + 2

b, d,

22 +

22 +

c a

+ 32 +

+ 12 + 2

+ 32 +

+ 12 + 2

c, a,

22 +

22 +

+ 32 + + 32

68 where a, b, c, d are any real numbers. 10. A set of 500 real numbers is such that any number in the set is greater than one- fth the sum of all the other numbers in the set. Determine the least number of negative numbers in the set. We will give the solutions to these in the next issue so you can have some fun looking for the answers. Next we give his solutions to the ve Quickies we gave last issue.

October 21, 1996

0, prove thatx 1 1+ 1 i 1 + x + 1 x xx + 2 y , ii x + y x + z y + z y + x z + xz + y z 4xy x 4yz y 4zx z . + uavbwc aua+ bv+ ccw +b where a; b; c; u; v;w 0.

Solution. Both inequalities will follow by a judicious application of the weighted arithmetic-geometric mean inequality W A.M. G.M. which for three weights is

a+b+c

1. For x; y;z

1 x+1 ; 1 x 1+ x 1+ x+1

, 1 1 x 1 + x 1 + x x+1 = 1 + 1 x+1 : 1+ x 1+x x+1 2x z+x 2y x+y 2z y+z 1: z +x x+y y+z

1=

form

ii Also, the inequality here can be rewritten in the more attractive

2. If ABCD is a quadrilateral inscribed in a circle, prove that the four lines joining each vertex to the nine point centre of the triangle formed by the other three vertices are concurrent.

X z + x z 2xx z + x : +

69 Solution. The given result still holds if we replace the nine point centres by either the orthocentres or the centroids. A vector representation is particularly a propos here, since with the circumcentre O as an origin and F denoting the vector from O to any point F the orthocentre Ha, the nine point centre Na, the centroid Ga of 4BCD are given simply by Ha = B + C + D, Na = B + C + D=2, Ga = B + C + D=3, respectively, and similarly for the other three triangles. Since the proofs for each of the three cases are practically identical, we just give the one for the orthocentres. The vector equation of the line La joining A to Ha is given by La = A + a B + C + D , A where a is a real parameter. By letting a = 1=2, one point on the line is A + B + C + D =2 and similarly this point is on the other three lines. For the nine point centres, the point of concurrency will be 2 A + B + C + D =3, while for the centroids, the point of concurrency will be 3 A + B + C + D =4. 3. How many six digit perfect squares are there each having the property that if each digit is increased by one, the resulting number is also a perfect square? Solution. If the six digit square is given by

then

so that Hence,

n + m = di and n , m = 111; 111=di where di is one of the divisors of 111; 111. Since 111; 111 is a product of ve primes it has 32 di erent divisors. But since we must have di 111; 111=di, there are at most 16 solutions given by the form lm = 1 di , 111; 111=di. 2 Then since m2 is a six digit number, we must have p 632:46 200 10 2m 2; 000:

On checking the various divisors, there are four solutions. One of them corresponds to di = 3 13 37 = 1; 443 so that m = 1 1; 443 , 7 11 = 683 2 and m2 = 466; 489. Then, 466; 489 + 111; 111 = 577; 600 = 7602 . The others are given by the table

di

70

4. Let viwi, i = 1; 2; 3; 4, denote four cevians of a tetrahedron v1v2v3v4 which are concurrent at an interior point P of the tetrahedron. Prove that

pw1 + pw2 + pw3 + pw4 max viwi longest edge:

Solution. We choose an origin, o, outside of the space of the tetrahedron and use the set of 4 linearly independent vectors Vi = ovi as a basis. Also the vector from o to any point q will be denoted by Q. The interior point p is then given by P = x1 V1 + x2 V2 + x3 V3 + x4 V4 where xi 0 P ,xi and i xi = 1. It now follows that Wi = P1,xiVi for other properties of concurrent cevians via vectors, see 1987: 274 275 and then that

Summing

X

i

pwi =

X

i

xi

j i i

viwi

Finally,

pwi max viwi max jVr , Vsj: r;s i

Comment: In a similar fashion, it can be shown that the result generalizes to n-dimensional simplexes. The results for triangles are due to Paul Erdos, Amer. Math. Monthly, Problem 3746, 1937, p. 400; Problem 3848, 1940, p. 575. 5. Determine the radius r of a circle inscribed in a given quadrilateral if the lengths of successive tangents from the vertices of the quadrilateral to the circle are a; a; b; b; c; c; d; d, respectively. Solution. Let 2A, 2B , 2C , 2D denote the angles between successive pairs of radii vectors to the points of tangency and let r be the inradius. Then

Now we turn our attention to solutions by our readers to problems given in the September 1995 number of the Corner where we gave the 16th Austrian Polish Mathematics Competition 1995: 221 222 .

Time: 4.5 hours individual competition Solutions by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain; Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia and Herzegovina; c and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Amengual's solution. First of all we note that both numbers x and y must be even. Suppose to the contrary that one of the numbers is odd. If x is odd, the number 2x + 1 which we have from the factorization x + 1 = A + 1Ax,1 , Ax,2 + , A + 1 that 2x + 1 is a multiple A of 3. Consequently 2x , 3y ,1 mod 3, while 7 1 mod 3, and the given equation is invalid mod 3. If y is odd, we will use the modular technique as in the previous case, but this time modulo 8. We have 32 1 mod 8. It follows that 32k+1 3 mod 8 for k = 0; 1; 2; : : : . Consequently 3y + 7 0 mod 8 and since 2x 3y + 7 we must have x2 2.yIf x = 1, we have 2 , 3y = 7, which is impossible. If x = 2, we have 2 , 3 = 7, which is also impossible. Suppose that the numbers x and y are even. So x = 2l, y = 2m, with l and m natural numbers. The given equation can then be written in the form 2l + 3m 2l , 3m = 7, where 2l + 3m and 2l , 3m are natural numbers, which implies that 2l + 3m = 7 and 2l , 3m = 1. These two equations determine the values of l, m, namely l = 2, m = 1 for which we have x = 4, y = 2.

COMPETITION

72 The only two natural numbers x; y 1 such that 2x , 3y = 7 are therefore x = 4 and y = 2. 5. Determine all real solutions x, y, z of the system of equations:

Solutions by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain; and by Panos E. Tsaoussoglou, Athens, Greece. We give the solution of Tsaoussoglou. From x3 + y = 3x + 4, we have

x3 + y = 3x + 4; 2y3 + z = 6y + 6; 3z3 + x = 9z + 8:

x , 2x + 12 = 2 , y: From 2y 3 , 2 , 2 , 6y = 2 , z , we have 2y , 2y + 12 = 2 , z ; and 3z 3 , 3 , 3 , 9z = 2 , x gives 3z , 2z + 12 = 2 , x;

so that

or

x3 , 1 , 1 , 3x = 2 , y;

and

x , 2x + 12 = ,y , 2; 2y , 2y + 12 = ,z , 2; 3z , 2z + 12 = ,x , 2;

x , 2y , 2z , 2 = 0: This gives at least one of x = 2, y = 2, z = 2. In conjunction with 1, 2 and 3 this gives the unique solution x = y = z = 2. 6. Show: For all real numbers a; b 0 the following chain of inequalities is valid

p

a + pb

2

!2

3 2

73 Also, for all three inequalities determine the cases of equality. Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; and by Panos E. Tsaoussoglou, Athens, Greece. We give Tsaossoglou's solution. p p! p p p

which holds by the Cauchy inequality. p 6 Let pa = A, 6 b = B , A3 + B 3 2 A4 + B 4 A2 + B 2 . p 3 p p 2. 3a + b + 3 3 ab pa + 3 b 4a + ab + b; or equivalently or or

A2 + B2 3 A3 + B3 2 ; 2 2

3 2

A4 + B4 3 A6 + A3B3 + B6 2 , 0; 2 3

9A4 + B 43 , 8A6 + A3 B 3 + B 6 2 = A12 , 16A9 B 3 + 27A8B 4 , 24A6 B 6 + 27A4 B 8 , 16A3B9 + B 12 = A , B 4 A8 + 4A7B + 10A6B 2 + 4A5 B 3 , 2A4B 4 +4A3B 5 + 10A2 B 6 + 4AB 7 + B 8 A , B4A3B3A , B2 0:

74

9. Let 4ABC be equilateral. On side AB produced, we choose a point P such that A lies between P and B. We now denote a as the length of sides of 4ABC ; r1 as the radius of incircle of 4PAC ; and r2 as the exradius of 4PBC with respect to side BC . Determine the sum r1 + r2 as a function of a alone.

Solutions by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain; and by Sefket Arslanagi
, University of Sarajevo, Sarajevo, Bosnia and Herzec govina. We give Amengual's solution and comment. Looking at the gure, we see that T1 O1 R = 60 since it is the supplement of T1 AR = 120 as an exterior angle for 4ABC . Hence, AO1 R = 30 . Similarly, we obtain BO2 S = 30 .

T20 C T10 O1 r1 P T1 A R S B T2 r2 O2

have

and

Since common external tangents to two circles are equal, T1 T2 = T10 T20 . Hence,

r1p r2 + a = 2a , r1p r2 ; + +

3

whence we nd that

Comment. This problem is identical to problem 2.1.11, page 25, of H. Fukagawa and D. Pedoe, Japanese Temple Geometry Problems, The Charles Babbage Research Centre, 1989.

ap3 : r1 + r2 = 2

75 We next give the solution to one problem of the VII Nordic Mathematical Contest. 2. 1995: 223 VII Nordic Mathematical Contest A hexagon is inscribed in a circle with radius r. Two of its sides have length 1, two have length 2 and the last two have length 3. Prove that r is a root of the equation Solution by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain. Equal chords subtend equal angles at the centre of a circle; if each of sides of length i subtends an angle i i = 1; 2; 3 at the centre of the given circle, then whence and

2r3 , 7r , 3 = 0:

2 1 + 2 2 + 2 3 = 360 ;

1 2 3 2 + 2 = 90 , 2 ;

Next we apply the addition formula for the cosine: where see gures

cos 21 + 22 = cos 90 , 23 = sin 23 : cos 21 cos 22 , sin 21 sin 22 = sin 23 ; 1=2 ; cos 1 = p4r2 , 1 ; sin 2 = r 2 2r p2 sin 22 = 1 ; cos 22 = r r, 1 ; r sin 23 = 3=2 : r

1

1

1 2

2 2

3 2

1 2

3=2

B

4r2 , 1 r2 , 1 , 1 = 3r:

We substitute these expressions into 1 and obtain, after multiplying both sides by 2r2 , p p

4r2 , 1r2 , 1 = 3r + 1;

r2r3 , 7r , 3 = 0:

2r3 , 7r , 3 = 0;

32nd Ukrainian Mathematical Olympiad given in the October 1995 number of the Corner 1995 : 266 .

To nish this number of the Corner we turn to two problems from the

March 1992 | Selected Problems

that

a2 , b2 + c2 , b2 + a2 , c2 3a , 4b + c: c a b

0. Prove

Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; Panos E. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give the solution of Arslanagi . c From a b c 0 we have Now we get

and

77 that is,

a2 , b2 + c2 , b2 + a2 , c2 3a , 4b + c: c a b The equality holds if and only if a = b = c 0. 5. 10 Prove that there are no real numbers x, y, z, such that x2 + 4yz + 2z = 0; x + 2xy + 2z2 = 0; 2xz + y 2 + y + 1 = 0:

Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by D.J. Smeenk, Zaltbommel, the Netherlands; by Panos E. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Wang's solution. Label the three given equations 1, 2 and 3, in that order, respectively. If x = 0 or z = 0, then from 3, y 2 + y + 1 = 0, which has no real solutions. Hence we may assume that xz 6= 0. From 1 and 2, we get x2 2=2 ,2z2y + 1 and 2z2 = ,x2y + 1, which, when multiplied gives 2x z = 2xz2y + 12 or xz = 2y + 12. Substituting into 3 we get

That completes the Corner for this issue. Olympiad season is upon us. Send me your Olympiads, as well as your nice solutions.

78

BOOK REVIEWS

Edited by ANDY LIU

Leningrad Mathematical Olympiads 1987 1991, by Dmitry Fomin and Alexey Kirichenko, published by MathPro Press, Westford, MA, USA, 1994. Contests in Mathematics Series, vol. 1., paperbound, 202 + xxii pages, ISBN 0 9626401 4 X, US$24. Reviewed by Jozsef Pelikan, Eotvos Lor
nd University, Budapest, Hun
a gary. The regulations of the International Mathematical Olympiad IMO stipulate that a country can send a team to the IMO consisting of at most six students. Still, there was a city in the 1965 IMO which participated with nine students: ve in the Russian team, two in the Israeli team, and one in each of the USA and German teams. This city was Leningrad, now known by its old name St. Petersburg again. If a city has such an output of talented young mathematicians, you can imagine that the city olympiad organized there should be of an exceptionally high quality. And so it is. Let me brie y describe the system of the Leningrad Olympiads. Until 1989 Soviet schools comprised grades 1 10, and the competition was held for 5 10 graders. Since that time the Russian schools comprise grades 1 11, and the competition is held for 6 11 graders. The competition is organized in four rounds. The rst round is at the school level in December and January and the second round held at the regional level that is, in the 22 regions of Leningrad in February, some 10,000 to 12,000 students taking part in the second round. Both of these rounds are written examinations. It is important to emphasize this, because the last two rounds | quite unusually for a mathematics competition | are oral examinations. This requires of course a huge number of able and devoted jurors, and few countries | let alone cities | can produce the number of mathematicians necessary for this task. In the third round called main round" about 90 130 students participate in each grade. In the nal round called somewhat misleadingly elimination round" | this term normally means the initial phase of a competition, not the nal one which is held only for 9 11 earlier 8 10 graders some 100 students take part altogether, although in 1991 there were only 34. The main round is held in February or March, and the elimination round in March. In the period 1962 1983 and also in 1991 the elimination round was used only to pick the city team at the All-Union Olympiad this might explain the strange name, while in the period 1984 1990 the result of the competition was decided by the elimination round not by the main round. A few words about the earlier history of the Leningrad and other Olympiads in the Soviet Union. The Leningrad Olympiad started in 1934 the Moscow Olympiad one year later. The All-Russia Olympiad started

79 in 1961 and the All-Union i.e. Soviet Union Olympiad in 1967. These are respectable ages, although there are a few national mathematics contests which are much older notably the Hungarian Eotvos | later Kursch k | a competitions which started in 1894. But I fully agree with the authors that the Leningrad competition is quite unique in being an oral one. On the other hand I must contest another statement of the authors, namely that the Leningrad competition would be quite unique in having only new and original problems. In fact the majority of the competitions I know of have new and original problems. Besides the main part containing the problems and solutions the book contains useful appendices: statistical data about the number of participants, the names of each year's winners, a glossary and the names of the authors of each problem. Also, there are valuable comments on the book by the publisher, Stanley Rabinowitz, and a very good evaluation of the reasons of the excellence of Soviet mathematics by Mark Saul. To give a sample of the problems and solutions I give you two examples from the book. Both come from the 1991 Olympiad and were given to grade 11 students. Problem A black pawn is placed in the top right square of an 8 8 chess-board. One may place a white pawn on any empty square of the board, having repainted all pawns in adjacent squares so that black pawns become white, and vice versa. Two squares are called adjacent if they have a common vertex. Can one place pawns in this manner so that all 64 squares of the board would be lled with white pawns? Solution Connect the centres of each pair of adjacent free squares by a segment. Then, when we place the next white pawn on some square of the board, we erase all segments from the centre of this square. Thus, the number of erased segments coincides each time with the number of free adjacent squares for the square on which each white pawn is placed. To make a certain pawn be white at the end, it must be placed on a square having an even number of free adjacent squares because the number of repaintings for each pawn is equal to the number of pawns that will be placed on adjacent squares after this one. So, we conclude that each time we have to erase an even number of segments. But this is impossible because the initial number of segments is odd we have lost at the beginning three segments caused by the black pawn in the corner and the nal number is even | it is equal to zero. Thus, we see that in the nal position there is at least one black pawn. The next problem has a rather unusual solution. Problem One may perform the following two operations on a natural number: a multiply it by any natural number; b delete zeros in its decimal representation.

80 Prove that for any natural number n, one can perform a sequence of these operations that will transform n to a one-digit number. Solution We use the following fact: Lemma For any integer n that is not divisible by 2 or 5 one can nd a number consisting of digits 1 only that is a multiple of n: Proof Consider n numbers 1; 11; : : : ; 11 : : : 1 : If one of these numbers is a multiple of n, we are done. Otherwise, their remainders modulo n can have n , 1 possible values 1; : : : ; n , 1 ; and therefore by the pigeonhole principle at least two of those numbers have the same remainders modulo n: Then their di erence is divisible by n and looks like 11 : : : 1 10k : But n is coprime with 10, and we conclude that the rst factor is divisible by n: Now let n be an arbitrary natural number. Multiplying n by 2 and 5 and deleting zeros, we can transform n to a number that is coprime with 10. Then multiplying the result by the appropriate number, we can obtain a number containing only digits 1 in its decimal representation we use the assertion of the lemma. Now the chain of the following operations leads to the desired result: a Multiplying by 82, we obtain the number 911 : : : 102 : b Delete zero in the last obtained number and multiply it by 9. This gives the number 8200 : : : 08 ; which is transformed into 828. c 828 25 = 20700 : d 27 4 = 108 : e 18 5 = 90 ; and we can obtain the single-digit number 9. All in all this book is very well written, full of interesting problems and I warmly recommend it to anyone interested in mathematical competitions, or just in nice problems.

81

Robert Geretschlager, Bundesrealgymnasium, Graz, Austria

Introduction

Ever since Greek antiquity, mathematicians have been considering constructions that can be done with straight-edge and compass only, the so-called Euclidean constructions. A number of famous problems, such as squaring the circle, trisecting angles and doubling the cube, were unsolvable for the Greeks, and later shown to be theoretically unsolvable by Euclidean methods. The reason for this is that only such problems that can be reduced algebraically to combinations of linear and quadratic equations are solvable in this sense. We now know that these three problems, as well as many others, cannot be represented by combinations of such equations. One speci c problem the Greeks attempted to solve in this way was the construction of regular n gons for small n. They were successful in nding constructions for n = 3, 4, 5, 6, 8, 10 and 12, but not for n = 7, 9 or 11. Since 7 is the smallest n for which no construction could be found, it was of special interest why this particular problem should prove so stubborn. As it turned out, the construction of the regular heptagon by Euclidean methods is impossible for the same reason that angle trisection and doubling the cube are, in that each of these problems requires the graphic solution of an irreducible cubic equation in its algebraic representation. As shown in Euclidean Constructions and the Geometry of Origami" 1 , all cubic equations can be solved graphically using elementary methods of origami1 . This is especially interesting in light of the fact that regular n gons are commonly used in the development of origami folding bases. A heptagon could conceivably nd use in developing models of insects for instance, since six legs + one head = seven corners. In this article, I present a theoretically precise method of folding the regular heptagon from a square, derived from the results established in the above-mentioned article. The folding method is presented in standard origami notation, and the mathematical section is cross-referenced to the appropriate diagrams.

The seven corners of a regular heptagon can be thought of as the seven solutions of the equation z7 , 1 = 0 1

1 Origami is, of course, the art of paper folding. For readers not yet familiar with this ancient art, but interested in becoming so, there is a large amount of introductory literature easily available. I was personally introduced to origami by the books of Robert Harbin 2 . A ne introduction to the geometry of origami is the classic Geometric Exercises in Paper Folding" by T. Sundara Row 3 .

82 in the complex plane. This implies that the unit circle is the circumcircle of the heptagon, and that one corner of the heptagon is the point z1 = 1 on the real axis Fig. 1.1.. Since one solution of 1 is known, the other six are the roots of z7 , 1 = z6 + z5 + z4 + z3 + z2 + z1 + 1 = 0: 2

z,1 For any speci c z satisfying this equation, the conjugate z is also a solution,

we have z = z . Therefore we can de ne

1

since the real axis is an axis of symmetry of the regular heptagon. Also, since

jzj = jzj = 1;

= z + 1 = z + z = 2 Re z: z

z z z

4

r r

3

iy

c

5

r

a z

z =1 x

1

3

z1 = 1 + i 0 z2 = cos 27 + i sin 27 z3 = cos 47 + i sin 47 6 z4 = cos 7 + i sin 67 10 z5 = z4 = cos 87+ i sin 87 10 z7 = z2 4 cos 12 + i sin 12 = z6 = z3 = cos 7 + i sin 7 7 7 2 a = cos 7 = Re z2 = Re z7 b = cos 7 = Re z3 = Re z6 c = cos 67 = Re z4 = Re z5 Dividing by z 3 , we see that equation 2 is equivalent to 1 z3 + z2 + z + 1 + z + z12 + z13 = 0

1
3 = z 3 + 3z + 3 + 1

= z+ z 3 1
z z 1 = z3 + z13 + 3 z + z = z 3 + z 3 + 3

3 , 3

= z3 + z13

z Fig. 1.1.

r

83 and

substituting yields

1
2 = z 2 + 2 + 1

= z+ z z2

2 , 2 = z2 + z12 ;

2

1
+ z 2 + 1
+ z + 1
+ 1 = 0 3 z + z3 z2 z 3 2

, 3

+

, 2 +

+ 1 = 0

3 +

2 , 2

, 1 = 0:

3 +

2 , 2

, 1 = 0

4 is real, and is equal to twice the common real component of two conjugate complex solutions of 1. It is therefore possible to nd the six complex roots of 1 in the complex plane by nding the roots of 4, taking half their values, nding the straight lines parallel to the imaginary axis and at precisely these distances from it, and nally nding the points of intersection of these parallel lines with the unit circle. We shall now proceed to utilize these steps in folding the regular heptagon.

As is usually the case in origami, we assume a square of paper to be given. We consider the edge-to-edge folds in step 1 as the x and y axes of a system of cartesian coordinates, and the edge-length of the given square as four units. The mid-point of the square is then the origin M 0; 0, and the end-points of the folds have the coordinates ,2; 0 and 2; 0, and 0; ,2 and 0; 2 respectively. For readers not familiar with origami notation, it should be mentioned that dashed lines represent so-called valley" folds folding up, and dot-dashed lines represent so-called mountain" folds folding down. Thin lines represent visible creases in the paper generated by previous folds. As shown in 1 , the solutions of the cubic equation are the slopes of the common tangents of the parabolas p1 and p2 de ned by the foci and directrices

x3 + px2 + qx + r = 0

and

r F1 , p + 2 ; q 2 2

F2 0; 1 2

l1 : x = , p , r 2 2

and

1 l2 : y = , 2

84 respectively. The solutions of 4 can therefore be obtained by nding the common tangents of the parabolas with foci

F1,1; ,1

and directrices

and and

1 F2 0; 2

l1 : x = 0

respectively. Since the slope of the common tangents is not altered by translating the parabolas parallel to the y axis we can, for convenience, use and

l2 : y = , 1 2

1
F1 ,1; , 2

l1 : x = 0

and and

F20; 1

l2 : y = 0: This is precisely what is done in steps 2 to 5. F1 is the point A, and F2 is the point B . The fold in step 4 is then the only common tangent of the parabolas

with positive slope, and thus twice the real component of the solutions of 1 which lie to the right of the imaginary axis and are not equal to 1. In other words, the slope of this fold is 2 cos 27 . Step 4, by the way, is the only step that cannot be replaced by a straight-edge and compass construction. In steps 6 to 8, the unit-length is then transferred in such a way that point E in step 8 has y coordinate ,2 cos 27 . Since the distance from M to point 1 in step 9 is 2 units, the distances from M to points 2 and 7 are also 2 units, and so points 7, 1 and 2 are three consecutive corners of the regular heptagon. We assume that point 1 with coordinates 0; ,2 is the rst corner, and continue from there. Step 10 thus yields two sides of the heptagon, and steps 11 to 13 yield the remaining sides of the heptagon by making use of its radial symmetry, until nally step 14 shows us the completed regular heptagon. The folding process is shown at the end of the article.

Conclusion

Unlike other regular n gons with small n, the regular heptagon is not very common in popular culture or graphics. Apart from the seven-sided star one comes across in astrology, the heptagon does not seem to show up much in public, unlike its close relatives. We come across the octagon at many a street corner, and the pentagon and hexagon can be seen on most soccer balls, just to name a few. I do not know if this relatively easy generation of the regular heptagon will lead to its mass popularization, but an ardent Heptagonist can certainly dream. It should be mentioned that a similar folding method for the regular heptagon is described in the article Draw of a Regular Heptagon by the

85 Folding" by Benedetto Scimemi 4 in the relatively hard to nd Proceedings of the First International Meeting of Origami Science and Technology. I have only recently gained access to a copy myself. This volume o ers a great many ideas for further research for anyone interested in the geometry of origami, and is certainly worth searching for.

References

1 R. Geretschlager, Euclidean Constructionsand the Geometry of Origami, Mathematics Magazine, 68 No. 5 December 1995, pp. 357-371 2 R. Harbin, Origami, The Art of Paper-Folding, Vols. 1-4, Hodder Paperbacks, Norwich 1968 3 T. Sundara Row, Geometric Exercises in Paper Folding, Dover Publications, Inc., Mineola, NY 1966 reprint of 1905 edition 4 B. Scimemi, Draw of a Regular Heptagon by the Folding, Proceedings of the First International Meeting of Origami Science and Technology, Ferarra, Italy 1989

1.

2.

86

3.

4.

B

Fold and unfold, making a crease mark at point A bisecting the side.

5.

6.

A

Fold C to D.

Unfold everything.

87

7.

8.

9.

10.

1

q

Fold through M , such that 1 lies on crease, resulting in 2 and 7 M is the mid-point of the heptagon, 1, 2 and 7 are corners.

Fold back twice, so that the marked points come to lie on one another; resulting folds are rst two sides of the heptagon.

88

11.

12.

2

q

Fold back lower layers using edges of upper layer as guidelines; resulting folds are two more sides of the heptagon; open up fold from step 12 and repeat 11 and 12 on left side.

13.

5

q q

14.

4

89

No. 20 R.E. Woodrow

This issue we give the problems of the Mathematical Association National Mathematics contest, written November 18, 1994. The contest was written by about 30,000 students in the United Kingdom. My thanks go to Tony Gardiner, School of Mathematics, University of Birmingham for sending me the contest.

A. 1

1 2

B. 2 C. 4 D. 4 1 2

E. 9.

A. g 2a

B. g 2b

C. g 2c

D. g 2d

E. g 2e.

3. I write out the numbers from 1 up to 30 in words. If N denotes the number of times I write the letter n", M denotes the number of times I write the letter m", and C denotes the number of times I write the letter c", then N + M + C equals A. 27 B. 28 C. 29 D. 30 E. 31. 4. Which of the following ve numbers has a prime factor in common with exactly one of the other four numbers? A. 91 B. 52 C. 39 D. 35 E. 24. 5. ABCD is a quadrilateral with AB = AD = 25 cm, CB = CD = 52 cm and DB = 40 cm. How long in AC in cm? A. 32:5 B. 48 C. 52 D. 60 E. 63.

90

6. The number of pounds of pickled peppers that Peter Piper purchased for $59 is equal to the number of pounds Peter would pay for two hundred and thirty six pounds of peppers. How much would he pay for twenty pounds of pickled peppers? A. $5 B. $10 C. $20 D. $40 E. $80.

A. 2 =x

1

B. x1 C. x12 D. 2x

1 E. p,x .

8. Over an average lifetime in the UK, roughly how many times does a person's heart beat? A. 4 107 B. 5 107 C. 2 108 D. 3 109 E. 2 1010.

1, 3, 6, 10, etc.? A. 10 B. 12 7

C. 56

3 D. 2

E. 49 . 21

10. A rope 15 m long and 5 cm in diameter is coiled in a at spiral as shown. What is the best estimate for the diameter of the circle" in cm?

A. 10 A. 95 B. 100

C. 150 C. 208

D. 200

E. 300. E. 1994.

11. If a b =

B. 100

ab+a+b+1 , then 19 a

94 equals D. 1882

12. The diagram shows a semicircle with radius 1 cm and with centre O. If C is an arbitrary point on the semicircle, which of the following statements may be false?

A

O B A. ACB is a right angle. B. 4OAC is isosceles. C. the area of 4ABC is 1 cm2 D. 4AOC is equal in area to 4OBC E. AO2 + OB 2 = AC 2 + BC 2.

91

13. A giant marrow in my garden weighed 50 pounds and was 98 water. Suppose that during a rainy day it absorbed water so that it became 99 water. What would its new weight be in pounds? A. 50:01 B. 50:5 C. 98 D. 99 E. 100. 14. A solid cuboid has edges of lengths a, b, c. What is its surface area? A. a + b + c2 , a2 + b2 + c2 B. abc C. 2a2 + b2 + c2 2 D. a + b + c E. ab + bc + ca. 15. Given two copies of an isosceles right-angled triangle ABC , squares BDEF and PQRS are inscribed in different ways as shown. What is the ratio area PQRS ? area BDEF A. 8 B. 2 C. 1 9 3

A. 0

@ @ @E F @ @ @C B

D.

q2

3

@ @R @ ,@ S , @Q @ ,@ B @, @ C

E. 9 . 8 E. 8.

B. 2 C. 4

1995+1996+1997+1998+1999+2000

D. 6

17. When two dice are thrown the probability that the total score is 1 a multiple of 2 is 2 . For how many other values of n is it true that, when two dice are thrown, the probability that the total score is a multiple of n is 1 equal to n ? A. 1 B. 2 C. 3 D. 4 E. 5. 18. How many digits are there in the smallest number which is composed entirely of ves eg. 5555 and which is divisibly by 99? A. 9 B. 10 C. 18 D. 36 E. 45. 19. The price of a secondhand car is displayed in pounds on four cards on the windscreen. Each card shows one digit. If the card with the thousands digit blew o in the wind, the apparent price of the car would drop to one forty-ninth of the intended value. What number is on that card? A. 5 B. 6 C. 7 D. 8 E. 9.

92

y,x 6 O

y+x

The same scale has been used on each axis. Which of the following shows the graph of y against x?

y

6 -

y6 O

6 -

6 -

A A OAA

A. g 20a A. 5 + 6 7

B. g 20b B. 7 + 6 5

C. g 20c C. 6 + 5 7

D. g 20d D. 7 + 5 6

E. g 20e. E. 6 + 7 5.

21.pWhich is smallest? p

22. A train leaves London at 0600 and arrives in Newcastle at 0930. Another train leaves Newcastle at 0700 and arrives in London at 0930. If both used the same route and each travelled at a constant speed, at what time would they meet? 1 1 1 1 A. 0757 2 B. 0802 2 C. 0807 2 D. 0827 2 E. more information required. 23. The triangle ABC has a right-angle at A. The hypotenuse BC is trisected at M and at N so that BM = MN = NC . If AM = x and AN = y, thenp is equal to MN p q x+y B. y2,x2 C. py 2 , x2 D. x2 +y2 E. x2 +y2 . A. 2 2 3 5 24. If Susan drives to work at x mph she will be one minute late; if she drives at y mph she will be one minute early. How far does she drive to work in miles? 2yx x+y x+y A. 30yx x B. y,x C. y,x D. x+y E. 60y,x . y, 2

93

25. The octagonal gure is obtained by tting eight congruent isosceles trapezia together. If the three shorter sides of each trapezium have length 1, how long is each outer edge?

A. 1 + 2

,L , L , , a , a ! ! @ @ @ @ @

@ @ @ @! @ ! a , a , , L , L,

B.

1+ 2 2

E. 1 + 2 , 2.

C. 2

D. 2

Last number we gave the 1994 Nat West U.K. Junior Mathematical Challenge. It was written Tuesday, April 26, 1994. Here are the answers. 1. 455 2. B 3. E 4. A 5. A 6. B 7. B 8. D 9. D 10. A 11. B 12. E 13. A 14. B 15. E 16. E 17. C 18. C 19. D 20. E 21. A 22. D 23. D 24. C 25. C That completes the Skoliad Corner for this issue. Send me your suitable contests and solutions. Also send me any suggestionsfor improvement of this feature.

94

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, University of Toronto, Toronto, ON Canada M5S 1A1. The electronic address is mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

MATHEMATICAL MAYHEM

student, University of Waterloo Waterloo, Ontario.

1 3 4 2 X k ex = 1 + x + x + x + x + = x ! ; 2! 3! 4! k=0 k which works for all x 2 C . Likewise, we will de ne the exponential function

Donny Cheung

tion,

Let us start with the well-known power series for the exponential func-

First of all, we must show that this sum actually converges. Otherwise, the answer we get would be meaningless, and that would be bad. To start us o , we will de ne the norm of an n n matrix, which we will denote jAj, as follows: 0 1

n X jAj = 1maxn @ jaij jA : i j =1

That is, for each row, take the sum of the absolute values of the components in that row, and the norm will be the largest of these row sums.

95

Lemma 1 For n n matrices A and B ,

jABj jAjjBj: Proof We label the entries of A and B in the standard way, aij and bij , respectively. n X For any row in A, de ne the row sum as jaij j. Since AB ij = j =1 n X aik bkj , the row sum of row i in AB is

k=1 n n XX j =1 k=1

aik bkj

=

jaikbkj j =

n j =1

n n XX

@jaikj X jbkj jA

k 1 =1 j=1n X

jaikj jbkj j

jaikj jB j

k=1

= jB j

jaikj jAjjBj:

Now, jAB j, the maximum row sum, is still a row sum, thus jAB j jAjjB j.

Lemma 2 For n n matrices A and B ,

jA + Bj jAj + jBj:

Theorem 1 The sum eM converges for all n n matrices M . Proof Using the two lemmas, we get

2 3 4 eM = I + M + M + M + M + ; 2! 3! 4!

so that

2 3 4 eM = jI + M + M + M + M + j 2! 3! 4! jM j2 + jM j3 + jM j4 + 1 + jM j +

Since jM j is a real number, ejM j is nite, and jeM j is bounded. Thus, eM converges.

= ejM j:

2!

3!

4!

96

Exercises

1. Prove Lemma 2.

Some Linear Algebra Lingo B = C ,1AC for some invertible n n matrix C . It is usually easier, when verifying that two matrices are similar, to show that CB = AC instead. Recall also

that a diagonal matrix is a matrix with all its non-zero entries along the main diagonal. But entries along the main diagonal are not necessarily non-zero. For example: 0 1 Recall that two n n matrices A and B are similar if

B B @

5 0 0 0

0 0 0

0 0 0 0

0 0 0

C: C A

=

0 B B D B B @ n

1

0 0 . . .

0 . . .

. . .

..

1 C C; C C A

Dk

0 k B k B B B @ k

1

0 0 . . .

0 . . .

. . .

..

1 C C; C C A

and

eD

=

2

2!

1+

1 + 2! +

0 . . .

1+

2 + 2! +

2 2

..

0 0 . . .

. . .

0 0 . . .

0 . . .

. . .

..

1 C C: C C A

. 1+

n

+ 2! +

2 n

1 C C C C C A

97

with 's all down the main diagonal and 1's directly above them except for the rst column, and 0's everywhere else. Examples include 0, 1 B C: , B C @ A , ,

0 0 0 0 0 0 1 0 3 1 0 0 0 1 0 0 0 1 5, 5 0 1 5 , and 0 0 0 3 3 3

0 B B B B B B @

1 0 . . . . . .

0 1 . . .

..

0 0 . . .

0 0 . . .

1 C C C C C C A

A Jordan matrix is an n n matrix with Jordan blocks down the diagonal. An example containing our three examples above:

0 B B B B B B B B @

5 0 0 0 0 0 0

0 3 0 0 0 0 0

0 0

0 0 0

0 0 0 0 0 5 0

0 0 0 0 0 1 5

1 3 0 0 0 0

1 3 0 0 0

1 3 0 0

1 C C C C: C C C C A

Notice that all diagonal matrices are also Jordan matrices. Exercises 1. 0 Verify that 1k B C B C B C B C B C B C @ A 0 k ,kk, ,kk, : : : , k k,n n, B k k ,kk, : : : ,n, k,n B B B B B B @ ::: k :::

1 0 1 . . . 0 0 . . . 0 0 . . . 0 . . . . . . .. . 0 0 0 0 0 0 1 0

1 2 1 1 2 1 1 2

+1 +2

0 . . .

,kk,n , knk,n n,

1

+1

. . .

. . .

..

. . .

0 0

0 0

0 0

,kk, k

1

. . .

1 C C C C: C C C A

98

Here's the reason: Theorem 2 For any n n matrix A, there exists a Jordan matrix J which is similar, that is, C ,1 AC = J for some C . J is known as a Jordan canonical form of A. Some matrices have more than one Jordan canonical form. The proof is beyond the scope of this article, but can be found in any good advanced linear algebra textbook. But we will prove the following: Theorem 3 If J is a Jordan canonical form of n n matrix A, with A = CJC ,1, then eA = C eJ C ,1. Proof

Ak = CJC ,1k = CJC ,1CJC ,1 CJC ,1 | z k = CJ C ,1 C J C ,1C J C ,1C C ,1 C JC ,1 = CJ kC ,1: A2 Now, eA = I + A + + 2! 2 = CIC ,1 + CJC ,1 + C J C ,1 + 2! J 2 +
C ,1 = C I + J + 2! = C eJ C ,1: Thus, eA = C eJ C ,1 . The process of nding a Jordan canonical form J of a matrix A is also beyond the scope of this article. Once again, I refer you to a good textbook. However, we have shown that it is possible to calculate eA for any n n matrix A. And now for something less theoretical... x01t = a11x1t + a12x2t + + a1nxnt; x02t = a21x1t + a22x2t + + a2nxnt;

. . .

Here, we discuss an interesting application of matrix exponentials: rstorder systems of linear di erential equations. By that, we mean systems of the form:

99 Letting

0 B B xt = B B @ 0 B 0 t = B B x B @

We will also let A be the matrix of coe cients for the system. Now we can rewrite the system of equations as x0 t = Axt. Exercises 1. Verify that xt = eAt c is a solution to x0 t = Axt for every constant vector c.

Further Exploration

This is where I become too lazy to show you all the neat stu you can do with matrix exponentials, and where I encourage you, the reader, to explore on your own. Exercises 1. We don't have to stop at matrix exponentials. We can de ne matrix equivalents for functions like sinx and cosx in a very similar fashion. What other types of functions can we extend to the matrices. 2. Prove that sinA sinA + cosA cosA = I for any arbitrary n n matrix A. 3. When is eA+B = eA eB ? The fact that matrix multiplication isn't commutative causes some problems. 4. As a corollary to the above problem, show that e2A = eA eA . 5. Prove or disprove: there exist a 2 2 matrix A with real entries such that
1996 Putnam, B4

sin A = 1 1996 : 0 1

100

Open problems

1. As we have de ned eA , it is very easy to de ne xA for x 2 R. Can we de ne B A for n n matrices A and B ? What would their properties , be? Would ABC = AB C ? 2. Can we de ne a log function? Would it have the similar properties to the real log function? 3. Can we solve other types of vector di erential equations with matrix exponentials or more generally matrix functions like sin and cos?

Mayhem Problems

A new year brings new changes and new problem editors. Cyrus Hsia now takes over the helm as Mayhem Advanced Problems Editor, with Richard Hoshino lling his spot as the Mayhem High School Problems Editor, and veteran Ravi Vakil maintains his post as Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only solutions | the next issue will feature only problems. We intend to have problems and solutions in alternate issues. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions from the previous issue be submitted by 1 June 1997, for publication in the issue 5 months ahead; that is, issue 6. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions for others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

101

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca H205. A circular billiard table is given with a cue ball at the circumference. It is shot at an angle of to the line from the ball to the centre of the table. For what angles will the ball come back to this point, assuming the ball keeps going inde nitely? Solution by Samuel Wong, Mary Ward Catholic Secondary School, Toronto.

A A

k180 , 2 = 360 c = k90 , = 180 c; for some positive integers c and k. Since must be real, 90 , must be either a rational or irrational number. Case I: If 90 , is rational, it can be expressed in the form m , where m and n are positive, relatively prime integers. Thus k m = 180c.nWe may n take k = 180n and then m = c, so for all rational, the cue ball will return to A1 . Case II: If 90 , is irrational, let x = 90 , . Then kx = 180 c = x = 180 c . But x is irrational, so we have a contradiction. k

Also solved by MIGUEL CARRION ALVAREZ, Universidad Complutense de Madrid, Spain.

We let the ball start at A1 as shown. Then OA1 A2 = A1 A2 O = equal radii and A1 OA2 = 180 , 2 angles sum to 180 . Since the angle of incidence equals the angle of re ection, we have A3 A2 O = A1 A2 O = = A2A3O by equal radii so A3OA2 = A2 OA1 = 180 , 2 . Thus, the angles at the centre are always equal. The cue ball returns to A1 i

102

H206. For what values of n is an n-digit natural number uniquely determined from the sum and product of its digits? Solutionby Miguel Carrion Alvarez, Universidad Complutense de Mad
rid, Spain. The sum and product of the digits are two conditions, and so only two digits can be determined in general. This means n = 1 or 2, but when n = 2, the order cannot be determined for example, consider 12 and 21, so the answer is n = 1. H207. Is there a natural number n, such that n = p, where p is an odd prime number? Solution by Bob Prielipp, University of Wisconsin-Oshkosh, WI. We shall show that there is NO positive integer n such that n is an odd prime number. This is an immediate consequence of the fact that 1 = 1 = 2 and the result established below. Theorem: If n is a positive integer, n 3, then 2 divides n. Proof: Let n be a positive integer, n 3. Case I: n = 2a , where a is an integer, a 2. Then n = 2a,1 , where a , 1 is a positive integer, so 2 divides n. Case II: n has an odd prime factor p. If the prime factorization of n is pa1 pa2 pak , where pk is odd, then 1 2 k

n = pa1,1pa2,1 pak ,1p1 , 1p2 , 1 pk , 1: 1 2 k Because pk is odd, pk , 1 is even so, 2 divides n

Also solved by MIGUEL CARRION ALVAREZ, Universidad Complutense de Madrid, Spain, SAMUEL WONG, Mary Ward Catholic Secondary School, Toronto.

Editor: Cyrus Hsia, 21 Van Allan Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu

k A185. Let bn be the highest power of 3 dividing 3 , 0 n 3k. n 3k X 1 Calculate . n=0 bn t t t 3 + 32 + 33 + :

Solution by Wai Ling Yee, student, University of Waterloo, Waterloo, Ontario. The exponent of the highest power of 3 dividing t! is

103

3k , n = 3k,j , an integer, 3j $ k $ $ k 3 , n , 3 ,n 3j 3j 3j can only take two possible values: 0 and 1. When 3j j n, the value is 0. Otherwise, it is 1. Therefore, the value of bn is 3k divided by the highest power of 3 dividing n. Consider the numbers divisible by 3j ; 0 j k , 1. Ignoring 0, we see that 3k,j of the numbers are divisible by 3j . These numbers can be written as 3j 3m; 3j 3m + 1, or 3j 3m + 2. Therefore, there are 2 3k,j,1 numbers in f1; 2; : : : ; 3k g for which 3j is the highest power of 3

Since j + 3

j =1

3j

3j

3j

dividing them.

for a Each of the 2 3k,j ,1 numbers contributes k,j to the sum 3 n=0 bn total of 2 . Therefore, 3

k, 3k X 1 3X1 1 = + 2 = 2 k + 2: 3 n=0 bn n=1 bn

3k X 1

tario.

A186. Let an be the sequence de ned by a1 = 1, and 2 2 an+1 = 1 + a1 + + an ; n 1: n Prove that every an is an integer.

Solution An April Fool's joke. It turns out that a1 , a2 , : : : , a43 are all integers, but a44 is not an integer. Ed: can you prove this?

104

n X A187. Let Skn be the polynomial in n, such that Skn = ik for i=1 all positive integers n, e.g. S0 n = n, S1 n = n2 + n=2. Prove that for k 1, nn + 1 j Sk n. Furthermore, prove that for k odd, k 3, n2n + 12 j Sk n.

Solution by Wai Ling Yee, student, University of Waterloo, Waterloo, Ontario. nn + 1 . Assume that nn +1 divides Note that nn +1 j S1n = 2 all Sk n up to k = t. Consider:

t+2 n + 1 t+2 n , 1 + 1

=

nt+2 +

+2 1

t+2 + n , 1

+

nt+1 +

+ 2

+2 2

nt + +

t t

+2 +1

t+1 + n , 1

1 + 1

+2 2

t t

+2 +1

n

t

+1

n,

1

n,

t+2 n , 2 + 1

t+2 + n , 2

. . .

t t

+2 +1

t !

+2 1

t+1 + n , 2

+2 2

!

n,

2

t+

n,

2 + 1

t+2 2 + 1 t+2 1 + 1

t+2 + 2 t+2 + 1

t t

+ 2 1 + 2 1

! !

t+1 + 2 t+1 + 1

t t

+2 2 +2 2

! !

t 2 ++ t 1 +

+

t t t t

+2 +1 +2 +1

! !

2+1 1+1

; :

n+1 X

if and only if

t X t+2 n + 1t+2 , n , 1 = t + 2 St+1 n + Sin: 1 i=1 t + 2 , i By the induction hypothesis, we need only to prove that nn + 1 divides n + 1t+2 , n , 1 = nn + 1t+1 , which is true.

2 2

Now, S3 n = n n4+1 ; therefore n2 n + 12 divides S3n. Assume that n2 n +12 divides Sk n for all odd k up to k = t , 1, t even. Consider:

t+2 n , 1

nt+2 ,

+2 1

n, ,

1

1

t+2

n,

1

t+2 ,

nt+1 +

+ 2

+2 2

nt , ,

, , t t

+2 +1

n,

1

t+1 +

+2 2

t t

+2 +1

n

t

+1

n,

1

n,

1 + 1

t+2 n , 2 , 1

t+2 , n , 2

+2

, , t t

t t

+ 2 + 1

t+1 + n , 2

2 + 1

+2 2

!

n,

2

n,

;

t ,,

. . . 2

1

t+2

t+2 ,

+ 2 1 + 2 1

! !

2

t+1 +

t t

+2 2 +2 2

t+2 1 , 1

t+2 , 1

t+1 + 1

t t ! t ,, t t

2 1

+2 +1 +2 +1

! !

2+1 1+1

; :

Subtracting the sum of all the equations in the above group from the sum of all the equations in the rst group, we have:

n + 1t+2 + nt+2 , 1 = 2 t + 2 St+1 n + t + 2 St,1 n 1
3
t + 2 S n + t + 2 S n : + + t , 1 3 t+1 1

By the induction hypothesis, we have to prove only that n2n + 12 divides

n + 1t+2 + nt+2 ,

t + 2 2 t + 1 n + n , 1:

106

t + 2
2 t+2 , t + 2 n2 + n , 1 t + 1 n + n , 1 = n + 1 , 1 t
+ 1
t+2 , + t + 2 n + 12 , t + 2 n + 11 + 1 = n + 1 t t+1 t + 2
, t + 1 n2 + n , 1
t+2 , + t + 2 n + 12 , t + 2 n2 + 2n + 1 = n + 1 t t + 2
t + 1
= n + 1t+2 , + t n + 12 , t + 2 n + 12: t+1 t + 2
2 Therefore n + 12 divides n + 1t+2 + nt+2 , t + 1 n + n , 1.
t+2 , t + 2 n , 1 n + 1 t+1
t+2 + + t + 2 n2 + t + 2 n + 1 , t + 2 n , 1 = n t t+1 t+1 t + 2
= nt+2 + + t n2: , Therefore n2 divides n + 1t+2 + nt+2 , t+2 n2 + n , 1.

nt+2 ,

Therefore n n + 1 divides St+1 n. By induction, n2n + 12 divides Sk n for odd k 3.

2 2

t+1

Editor: Ravi Vakil, Department of Mathematics, One Oxford Street, Cambridge, MA, USA. 02138-2901 ravi@math.harvard.edu We begin by dredging up an old favourite of ours. Well, maybe not so old a solution appeared in Mayhem 8: 4, 25: 1996 . We have since received a new solution that is worth printing. C64. The numbers x1, x2 , : : : , xn are such that x1 + x2 + + xn = 0 and x2 + x2 + + x2 = 1. Prove that there are two numbers among them 1 2 n whose product is no greater than ,1=n. 1991 Tournament of Towns

107 tario. Solution by Naoki Sato, student, University of Toronto, Toronto, OnChoose i such that x1 x2 xi 0 xi+1 xn . Then

Similarly,

As always, please send us new solutions to old problems. C68. Proposed by Vin de Silva, student, Oxford University, Oxford, England. Let M be an n n orthogonal matrix. In other words, the rows are n vectors in n-space that are of length 1 and mutually perpendicular. Let A be the k k matrix in the upper-left corner of M , and let B be the n , k n , k matrix in the lower-right corner of M . Prove that det A = det B . Solution by Eric Wepsic, D.E.Shaw and Co., New York, NY, USA. Let ci be the ith column of the orthogonal matrix Q, and let ri be the th row. Let x be the ith basis vector. Let M be the top k k submatrix i i 1 of Q, and let M2 be the bottom n , k n , k submatrix. Then

det M1 = c1 ^ c2 ^ ^ ck ^ xk+1 ^ ^ xn = Qx1 ^ Qx2 ^ ^ Qxk ^ xk+1 ^ ^ xn : As Qt has determinant 1, this is equal to:

Solution by Sam Vandervelde, University of Chicago, Illinois, USA. Let Q1 be the matrix whose rst k columns are the rst k columns of Q, and whose remaining n , k columns are the last n , k columns of the identity matrix. Let Q2 be the same sort of thing with the rst k columns identical to I , and the last n , k columns those of Qt . Then an easy calculation using Qt Q = I , QtI = Qt shows that QtQ1 = Q2. Taking determinants of both sides yields the desired result. The two solutions presented were in some sense identical, although the perspectives were di erent.

108

C69. Let Q be a polyhedron in R3. Let ~ 1, : : : , ~ k and A1, : : : , Ak n n be the normal vectors and areas of the faces of Q respectively. Prove that k X Ai~ i = 0: n

i=1

Solutionby Miguel Carri on Alvarez, student, Universidad Complutense de Madrid, Spain. P We have k=1 Ai~ i = d~, where d~ is the element of area pointing n H s s i outwards and the integral is over the faces of the polyhedron. Then

I I
I I I dsx ; dsy ; dsz = ~ x d~; uy d~; ~ z d~ ; u s ~ s u s H~ s for constant elds ~ x , ~ y , ~ z . We recall the divergence theorem: A d~ = u R r AdV . But ~ u, ~u, ~ are constant elds, so r ~ = 0. Thus ~ ~ ui HVd~~= 0; 0; 0. ux uy uz s I

d~ = s F =, ~ d~ = , r dV: s

Comments. 1. If is the pressure eld in a uid, the total force on a three-dimensional object is I Z

Prove this! In this case, we have constant pressure. What this result says is that a polyhedron sitting in a uid with constant pressure from all sides and no other forces will not move.

2. This is true in all dimensions. 3. Many other interesting results follow from this one, including the following variant of the Pythagorean theorem. Consider a tetrahedron ABCD with AB, AC , AD mutually perpendicular. Then

where the brackets denote the area of the triangle. This is also true in other dimensions. If you can think of any other interesting consequences including other variants of Pythagoras, please send them in!

109

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 1 "11" or A4 sheets of paper. 2 These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 October 1997. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

2214. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let n 2 be a natural number. Show that there exists a constant C = C n such that for all real x1 ; : : : ; xn 0 we have

k=1 n Xp

vn uY u xk t xk + C :

k=1

Determine the minimum C n for some values of n. For example, C 2 = 1. 2215?. Proposed by Theodore Chronis, student, Aristotle University of Thessaloniki, Greece. Let P be a point inside a triangle ABC . It is known how to determine P such that PA + PB + PC is a minimum known as Fermat's Problem for Torricelli. Determine P such that PA + PB + PC is a maximum.

110

2216. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Suppose that 1 is a natural number. 1. Determine the set of all 's such that the diophantine equation x + y2 = z2 has in nitely many solutions. 2.? For any such , determine all solutions of this equation. 2217. Proposed by Bill Sands, University of Calgary, Calgary, Alberta. a Prove that for every su ciently large positive integer n, there are arithmetic progressions a1 ; a2 ; a3 and b1; b2; b3 of positive integers such that n = a1 b1 + a2 b2 + a3 b3. b What happens if we require a1 = b1 = 1? This is a variation of problem 3 of the 1995 96 Alberta High School Mathematics Competition, Part II, which will appear in a future Skoliad Corner. 2218. Proposed by Victor Oxman, University of Haifa, Haifa, Israel. Suppose that a, b, c are positive real numbers and that

abc = a + b , cb + c , ac + a , b:

Clearly a = b = c is a solution. Determine all others. 2219. Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. Show that there are an in nite number of solutions of the simultaneous equations:

n Gomez Rey, IES Luis Bu~ uel, Alcorc n on, Madrid, Spain. Let V be the set of an icosahedron's twelve vertices, which can be partitioned into four classes of three vertices, each one in such a way that the three selected vertices of each class belong to the same face. How many ways can this be done?

111 2221. Proposed by Sefket Arslanagi c, University of Sarajevo, Sarajevo, Bosnia and Herzegovina. Find all members of the sequence an = 32n,1 + 2n,1 ; n 2 N which are the squares of any positive integer. 2222. Proposed by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario. Find the value of the continued root:

v s u r u t4 + 27 4 + 29 4 + 31q4 + 33p: : ::

NOTE: This was inspired by the problems in chapter 26 Ramanujan, In nity and the Majesty of the Quattuordecillion", pp 193 195, in Keys to In nity" by Cli ord A. Pickover, John Wiley and Sons, 1995. 2223. Proposed by Joaqu

n Gomez Rey, IES Luis Bu~ uel, Alcorc
n on, Madrid, Spain. We are given a bag with n identical bolts and n identical nuts, which are to be used to secure the n holes of a gadget. The 2n pieces are drawn from the bag at random one by one. Throughout the draw, bolts and nuts are screwed together in the holes, but if the number of bolts exceeds the number of available nuts, the bolt is put into a hole until one obtains a nut, whereas if the number of nuts exceed the number of bolts, the nuts are piled up, one on top of the other, until one obtains a bolt. Let L denote the discrete random variable which measures the height of the pile of nuts. Find E L + E L 2 . 2224. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. Point P lies inside triangle ABC . Triangle BCD is erected outwardly on side BC such that BCD = ACP and CBD = ABC . Prove that if the area of quadrilateral PBDC is equal to the area of triangle ABC , then triangles ACP and BCD are similar. 2225. Proposed by Kenneth Kam Chiu Ko, Mississauga, Ontario. a For any positive integer n, prove that there exists a unique n-digit number N such that: i N is formed with only digits 1 and 2; and ii N is divisible by 2n . b Can digits 1" and 2" in a be replaced by any other digits?

112

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. We have identi ed anonymous" in the solutions of problems 2064,
2065, 2067, 2068, 2069, 2071 and 2077 as MARIA MERCEDES SANCHEZ BENITO, I.B. Luis Bu~ uel, Madrid, Spain. n The name of VICTOR OXMAN, University of Haifa, Haifa, Israel, should be added to the list of solvers of problem 2091. The name of ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick, should be added to the list of solvers to problem 2104.

2113.

X ! X ! X ! X n n n n ai bi ! ai bi ai + bi a +b

i=1 i=1 i=1 i=1 i i

for any positive numbers a1 ; : : : ; an ; b1; : : : ; bn . I. Solution by Vedula N. Murty, Andhra University, Visakhapatnam, India. The given inequality follows from the easily veri ed identity:

X ! X ! X !X n n n n ai bi ! ai bi , ai + bi i=1 i=1 i=1 i=1 ai + bi X aibj , aj bi2 = ai + biaj + bj : 1i j n

II. Solution by Federico Ardila, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA. We know from Cauchy's inequality that

X n

i=1

ai , bi

!2

X n

i=1

ai + bi

!X n

113 Therefore

which completes the proof. III. Solution by Kee-Wai Lau, Hong Kong. For n = 1, the result is clear. Suppose that the inequality holds for n = k. Then for n = k + 1, we have

0 n 1 X ! X ! n n n ! n n ! 1 @ X a + X b 2 , X a , X b 2A ai bi = 4 i i i i i=1 i=1 i=1 i=1 i=1 i=1 0 n ! n !1 1 @ Xa + b 2 , Xa , b 2 A = 4 i i i i i=1 i=1 0 n ! 1 @ Xa + b 2 4 i i i=1 X ! X n n ai , bi2 !! , ai + bi a +b X i=1 !X i=1 i 2 i n n ai + bi , ai , bi2 ! = ai + bi 4ai + bi i=1 =1 X !iX n n aibi ! = ai + bi ; i=1 i=1 ai + bi

k+1 ! k+1 ! k+1 ! k+1 X X X X aibi ! ai bi , ai + bi i=1 i=1 i=1 i=1 ai + bi ! X ! X !X k k k k ai bi ! X = ai bi , ai + bi ai + bi i=1 i=1 ! i=1 X ! i=1 k k X +ak+1 bi + bk+1 ai i=1 i=1 k k X ib X ,ak+1 + bk+1 a a+ ib , a ak+1bkb+1 ai + bi k+1 + k+1 i=1 i=1 i i k X ib ak+1 bi + bk+1ai , ak+1 + bk+1 a a+ ib i i i=1
, a ak+1 bkb+1 ai + bi by the induction hypothesis k+1 + k+1 k X ak+1bi , bk+1ai2 1 = a +b 0; a +b

k+1 k+1 i=1 i i

114 Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; HAN PING DAVIN CHOR, Student, Cambridge, MA, USA; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; DAVID E. MANES, State University of New York, Oneonta, NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; PANOS E. TSAOUSSOGLOU, Athens, Greece; CHRIS WILDHAGEN, Rotterdam, the Netherlands; and the proposer. There were also one anonymous solution and one incorrect submission. Klamkin remarked that this is a known inequality due to E.A. Milne 1 , that came up in establishing an integral inequality. It also appeared as problem 67 in 2 . This was also noticed by Janous and Tsaoussoglou. Arslanagi , Herzig, Hess, Manes and Tsaoussoglou all pointed out that equality c holds in the proposed inequality if and only if the vectors a1 ; a2 ; : : : ; an and b1; b2 ; : : : ; bn are linearly dependent. This is obvious from proof I above. References 1. E.A. Milne, Note on Rosseland's Integral for the Stellar Absorption Coe cient, Monthly Notices Royal Astronomical Soc. 85 1925 979 984. 2. G.H. Hardy, J.E. Littlewood, G. Polya, Inequalities, Cambridge University Press, London, 1934, pp. 61 62.

ABCD is a square with incircle ,. A tangent ` to , meets the sides AB and AD and the diagonal AC at P , Q and R respectively. Prove that AP + AR + AQ = 1: PB RC QD

Solution by Francisco Bellot Rosado, I.B. Emilio Ferrari, and Maria Ascension Lopez Chamorro, I.B. Leopoldo Cano, Valladolid, Spain.
We suppose that the equation of , is x2 + y 2 = 1, and the coordinates of A and C are 1; 1 and ,1; ,1 respectively. Let T cos t; sin t be the coordinates of the point of tangency of line ` with ,, with 0 t : 2 Then the equation of PQ is and the coordinates of the involved points are

2114.

y sin t + x cos t = 1;

115 and so

AP = sin t + cos t , 1 ; PB sin t , cos t + 1 AR = sin t + cos t , 1 ; RC sin t + cos t + 1 AQ = cos t + sin t , 1 ; QD cos t , sin t + 1 AP AQ AR PB + QD + RC = 1:

Also solved by MIGUEL AMENGUAL COVAS, Cala Figuera, Mallorca,
Spain; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; CLAUDIO n ARCONCHER, Jundia

, Brazil; FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; SEFKET
ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; SAM BAETHGE, Science Academy, Austin, Texas, USA; CARL BOSLEY, student, Washburn Rural High School, Topeka, Kansas, USA; CHRISTOPHER
J. BRADLEY, Clifton College, Bristol, UK; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; TIM CROSS, King Edward's School, Birmingham, England; n JORDI DOU, Barcelona, Spain; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; DAVID HANKIN, Hunter College Campus Schools, New York, NY, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium,
Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; P. PENNING, Delft, the Netherlands; WALDEMAR POMPE, student, University of Warsaw, Poland; D.J. SMEENK, Zaltbommel, the Netherlands; MELETIS VASILIOU, Elefsis, Greece; and the proposer.

2115. 1996: 75 Proposed by Toby Gee, student, the John of Gaunt School, Trowbridge, England. Find all polynomials f such that f p is a prime for every prime p. Solution by Luis V. Dieulefait, IMPA, Rio de Janeiro, Brazil. Let f be a polynomial such that f p is prime for every prime value of p. We will prove that f is a constant polynomial the constant being, of course, a prime number or f is the identity; that is f x = x, for every integer x. Suppose that f is not the identity. Then f x = x possesses only a nite number of solutions. Therefore, there exist p, q primes, p 6= q such that f p = q . Applying Dirichlet's Theorem, we know that the arithmetical progression p + kq , k = 0; 1; 2; : : : , contains in nitely many primes. Besides, for every k 0,

116

f p + kq f p 0 mod q, and so for the in nitely many primes ri of the form p + kq we must have f ri = q . But f being a polynomial that takes the value q in nitely many times means that f x = q for all x.

Also solved by FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; MANSUR BOASE, student, St. Paul's School, London, England; CARL BOSLEY, student, Washburn Rural High School, Topeka, Kansas, USA; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MICHAEL JOSEPHY, Universidad de Costa Rica, San Jos , Costa Rica; e JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; and the proposer. There were 3 incorrect submissions.

2116. 1996: 75 Proposed by Yang Kechang, Yueyang University, Hunan, China. A triangle has sides a; b; c and area F . Prove that

When does equality hold? Several solvers pointed out that this proposal is just a special case of 1984: 19 , proposed by M.S. Klamkin, which asks for the maximum value of P sin A: sin B: sin C , where A; B; C are the angles of a triangle and ; ; are given positive numbers. The featured solution by Walther Janous 1985: 908 establishes the maximum to be

6 a b c 25 52F : 27 3 4 5

Pmax

+

+

+ +

=2

+

+

+ +

=2

+

+

+ +

=2

In the humble opinion of the editor, nothing in the submissions added anything substantive to 1985: 908 . Solved by PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI LAU, Hong Kong; DIGBY SMITH, Mount Royal College, Calgary, Alberta; and PANOS E. TSAOUSSOGLOU, Athens, Greece.

ABC is a triangle with AB AC , and the bisector of A meets BC at D. Let P be an interior point of the side AC . Prove that BPD DPC .

Two solutions by Shailesh Shirali, Rishi Valley School, India. Editor's comment: Shirali strengthens the result by replacing the condition AB AC by the less stringent condition ABC 90 . That seems

2117.

117 to be su cient for the inequality in his rst proof: 90 ABC PBC implies sin ABC sin PBC . Neither he nor the other solvers explicitly stated that they had stronger results. Solution I. Let E be the point where the internal bisector of P of 4PBC meets side BC . Then

BE = PB = sin PCB sin ACB = AB = BD ; EC PC sin PBC sin ABC AC DC so that E lies between D and C . It follows that BPD DPC .

Editor's further comment: The above argument clearly continues to work for some positions of P on the side AC even when ABC 90 . A set of conditions on P and 4ABC under which BPD DPC is implicit in Shirali's second argument. Solution II. The set of points X in the plane of the triangle for which BXD = DXC is , the circle of Apollonius through A with respect to B XB = BD ; it is and C . Equivalently, is the locus of points X for which XC DC the circle through A and D whose centre lies on BC ; inversion in this circle xes A and D, and interchanges B with C ; see, for example, H.S.M. Coxeter, Introduction to Geometry, x6.6 pages 88-89. When AB AC so that BD DC , the set of points X for which BXD DXC is the set of points interior to . In this case the centre of lies on the extension of BC beyond C , so the segment AC lies entirely within . It follows that for all points P on AC , we have BPD DPC . When AB AC , the centre of lies on the part of BC beyond B , so that now we seek points P outside ; when B 90 , the entire line segment AC lies outside , which agrees with the rst proof. When B is obtuse, then some points of AC lie inside for those points, the desired inequality no longer holds. Also solved by FEDERICO ARDILA, student, MassachusettsInstitute of Technology, Cambridge, Massachusetts, USA; SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; JORDI DOU, Barcelona, Spain; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI LAU, Hong Kong; WALDEMAR POMPE, student, University of Warsaw, Poland; D.J. SMEENK, Zaltbommel, the Netherlands; PANOS E. TSAOUSSOGLOU, Athens, Greece; GEORGE TSAPAKIDIS, Agrino, Greece; MELETIS VASILIOU, Elefsis, Greece; and the proposer.

2118. 1996: 76 Proposed by Paul Yiu, Florida Atlantic University, Boca Raton, Florida, USA. The primitive Pythagorean triangle with sides 2547 and 40004 and hypotenuse 40085 has area 50945094, which is an 8 digit number of the form abcdabcd. Find another primitive Pythagorean triangle whose area is of this form.

118 Solution by the proposer. There are three such primitive Pythagorean triangles: i 146 137 ii 146 9 iii 105 32

n m2 , n2 2mn m2 + n2

2547 21235 10001 40004 2628 6720 40085 21397 12049

Area

8 digit numbers of the form abcdabcd can be factored as 10001 N = 73 137 N for an integer N in the range 1000 N 10000. The sides of a primitive Pythagorean triangle are given by m2 , n2 , 2mn, m2 + n2, with relatively prime integers m and n of di erent parity. The area of the triangle is 4 = mnm , nm + n. Note that the factors m, n, m + n,

and m , n are pairwise relatively prime, and exactly one of them is even. These numbers are in the order i m + n m n m , n, or ii m + n m m , n n. Clearly, none of m; n or m , n can be 10001r. Also m + n 6= 10001; otherwise, mn 100001 and 4 108 . Each of 137 and 73 divides exactly one of the four numbers m; n;m n. We list the twelve di erent types in the table below, in which h and k are positive integers.

Type 1 2 3 4 5 6 7 8 9 10 11 12

In Types 1 and 2, 4 137h73k2 = hk2100012 108. In each of Types 3, 4, 5, 6, note that 137h 100. This cannot be the smallest of the four numbers m; n; m n, and must therefore be the 3 third in order. The area of the triangle is greater than 137h8 1. We need therefore consider only h satisfying 137h3 108; h 10 3 3:388; in 137 other words, h = 1, 2, 3. In each of these types, the smallest number is a linear function ,p 137h + q 73k, where each of p and q is 1, 2 or 1 . 2

m+n 2137h + 73k 137h + 273k 137h + 73k ,137h + 273k 73k 73k 137h + 73k 2137h , 73k 137h 137h 137h 73k

m 137h + 73k 137h + 73k 73k 73k ,137h + 73k 1 137h + 73k 2 137h 137h 137h , 73k 1 137h + 73k 2 73k 137h

h k 137h ,137h + 73k 137h 1 ,137h + 73k 2 73k 137h , 73k 73k 1 137h , 73k 2 137h , 73k ,137h + 73k

137 73

m,n conditions 73k k odd 137h h odd 73k , 137h h + k odd 137h h odd 73k , 2137h k odd 137h h k odd 173h , 73k h + k odd 73k k odd 137h , 273k h odd 73k h k odd ,137h + 273k h odd 2137h , 73k k odd

119

1 Note that ,p 137h + q 73k h 73 since the product of the two smallest measurements cannot exceed 10001. 1 It follows that 0 ,p 137h + q 73k h 73: From this,

p 137 h k p 137 h + 1 : q 73 q 73 qh In each of Types 7, 8, 9, 10, either n or m , n is 73k, so 1 4 73k3. In other words, k 6. Also, from 0 p 137h , q 73k k 137, we have q 73 k h q 73 k + 1 : p 137 p 137 pk

Type 3 4 5 6 7 8 9

p q

1 1 2

1 2

possible

1 1 1

1 2

1 1 1

1 2

1 1 2

1 2

; ; ; ; ; m n Type 11. We consider h; k in either of the parallelograms 137h , 73k = 0; 137h , 73k = 100; , 137h + 273k = 0; ,137h + 273k = 464; 137h , 73k = 0; 137h , 73k = 464; , 137h + 273k = 0; ,137h + 273k = 100: p108 . These are the points 3 Note: 464 = h; k = 1; 1; 2; 3; t; t for t = 2; : : : ; 8; and we need only consider h;k = 1; 1 since h is odd and gcd h;k = 1. But this triangle, with m = 73, n = 64, is too small; it has area 5760576. Type 12. We consider h; k in either of the parallelograms ,137h + 73k = 0; ,137h + 73k = 100; 2137h , 73k = 0; 2137h , 73k = 464;

10 1 1, 2 1, 2 2, 2 3, 3 5 1 1 3 5 iii = 388, = 23

; ; ; ; ; ; ; ; ;

h; k ; ; ; ; ;

relevant

; ; ; ;

h; k

m m

= 178,

n n

= 41

= 137,

= 64

120

,137h + 73k = 0; ,137h + 73k = 464; 2137h , 73k = 0; 2137h , 73k = 100:

h;k = 1; 2; 1; 3; 2; 7; 3; 11; 2; 4; 3; 6; and we need only consider h;k = 1; 3; 2; 7 and 3,11. But the corre-

sponding triangles are all too big. Remark Enlarging the primitive triangle with m = 73; n = 64 by the factors 2, 3, 4, we obtain non-primitive Pythagorean triangles of areas 23042304, 51845184, and 92169216 respectively. Enlargements of the primitive triangles i, ii, iii all have areas exceeding 108: The non-primitive triangle from m = 137, n = 73 has area 13441344. Both the additional triangles were also found by TIM CROSS, King Edward's School, Birmingham, England; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; and RICHARD I. HESS, Rancho Palos Verdes, California, USA. The following readers each found one of the triangles: CHARLES ASHBACHER, Cedar Rapids, Iowa, USA; SAM BAETHGE, Science Academy, Austin, Texas, USA; MANSUR BOASE, student, St. Paul's School, London, England; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; DAVID HANKIN, Hunter College Campus Schools, New York, NY, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; DAVID E. MANES, State University of New York, Oneonta, NY, USA; P. PENNING, Delft, the Netherlands; CORY PYE, student, Memorial University of Newfoundland, St. John's, Newfoundland; JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH, Mount Royal College, Calgary, Alberta; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece. There was one incorrect submission.

2119. 1996: 76 Proposed by Hoe Teck Wee, student, Hwa Chong Junior College, Singapore.

a Show that for any positive integer m 3, there is a permutation of m 1's, m 2's and m 3's such that i no block of consecutive terms of the permutation other than the entire permutation contains equal numbers of 1's, 2's and 3's; and

121 ii there is no block of m consecutive terms of the permutation which are all equal. b For m = 3, how many such permutations are there? Solution by P. Penning, Delft, the Netherlands. b I found two: aabbcbcca and abbcbccaa; where a; b; c is any permutation of 1; 2; 3. In fact these are mirror-images of one another. Thus there are 3! 2 = 12 such permutations of 1's, 2's and 3's. a To generate a solution for m 3, start with three blocks of m equal terms, and to make it satisfy condition ii let the last term of each block change places with the rst term of the next block and do the same with the rst and last block: Note that for m = 3 this permutation violates condition i. It is easy to check that it works whenever m 3.|Ed. Also note that if the permutation is considered as a cycle then there are solutions only if m 3. Also solved by FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; MANSUR BOASE, student, St. Paul's School, London, England; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; DAVID E. MANES, State University of New York, Oneonta, NY, USA; JOEL SCHLOSBERG, student, Hunter College High School, New York, NY, USA; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; and the proposer. Part b only was solved by CHARLES ASHBACHER, Cedar Rapids, Iowa, USA. Note that Penning's solution shows that for m 3, condition ii can be strengthened just a teensy bit to: ii0 there is no block of m , 1 consecutive terms of the permutation which are all equal. However, there is an even better result. For any m 3 there is a permutation of m 1's, m 2's and m 3's which satis es condition i and also ii? there is no block of three consecutive terms of the permutation which are all equal. Thanks to expert colleague James Currie for suggesting examples of such permutations, which readers might enjoy nding for themselves!

122

2120.

For

1996: 76 Proposed by Marcin E. Kuczma, Warszawa, Poland. Let A1 A3 A5 and A2 A4 A6 be non-degenerate triangles in the plane.

i = 1; : : : ; 6 let `i be the perpendicular from Ai to line Ai,1Ai+1 where of course A0 = A6 and A7 = A1 . If `1 ; `3; `5 concur, prove that `2; `4; `6 also concur. Solution by Christopher J. Bradley, Clifton College, Bristol, UK. Let the vector position of the vertex Ai relative to the point of concurrency of `1; `3 ; `5 be ai . Then a1 a2 , a6 = a3 a4 , a2 = a5 a6 , a4 = ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ 0. In particular, the sum is also zero, so a2 a1 , a3 + a4 a3 , a5 + a6 a5 , a1 = 0: ~ ~ ~ ~ ~ ~ ~ ~ ~ 1 Now suppose that the perpendicular from A2 to A1 A3 meets the perpendicular from A4 to A3 A5 at B , with position vector ~ . These perpendiculars b cannot be parallel. Then ~ , a2 a1 , a3 = 0 and ~ , a4 a3 , a5 = 0: b ~ ~ ~ b ~ ~ ~

Adding gives ~ a1 , a5 = a2 a1 , a3 + a4 a3 , a5 , which, by 1, is b ~ ~ ~ ~ ~ ~ ~ ~ equal to ,a6 a5 , a1 . ~ ~ ~ Hence ~ , a6 a1 , a5 = 0, which means that BA6 ? A1 A5 . b ~ ~ ~ Also solved by CLAUDIO ARCONCHER, Jundia

, Brazil; FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; JOHN G. HEUVER, Grande Prairie Composite High School, Grande Prairie, Alberta; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; P. PENNING, Delft, the Netherlands; TOSHIO SEIMIYA, Kawasaki, Japan; D.J. SMEENK, Zaltbommel, the Netherlands; MELETIS VASILIOU, Elefsis, Greece; and the proposer. Problem 2120 can be found in many reference texts. Dan Pedoe provides two proofs in his Geometry, A comprehensive Course Dover, 1998. Clerk Maxwell's remarkable treatment of the problem, reducing it to an observation about the radical axes of appropriate circle, appears in x28.4, page 115. Earlier, in x6.1, pages 35-37, Pedoe uses barycentric coordinates for a proof of a closely related problem involving reciprocal triangles. He comments that whole books have been written on the subject of reciprocal gures. Seimiya uses Steiner's theorem in his solutions Jacob Steiner, Gesammelte Werke I, p. 189: A necessary and su cient condition in order for `1; `3; `5 to be concurrent is Since by permuting the subscripts this is also a necessary and sufcient condition for `2 ; `4 ; `6 to concur, our problem follows immediately. Arconcher refers to this condition as Carnot's Theorem, but he provides no

123 reference. Ardila discovered the theorem for himself and showed that it follows fairly quickly from Pythagoras' Theorem, so maybe we should refer to it as the Pythagoras-Ardila-Steiner-Carnot Theorem. Seimiya added that the problem may also be found in Aref and Wernick, Problems and Solutions in Euclidean Geometry Dover, p. 55 problems 2.32, He includes two of his interesting generalizations that have appeared in Japanese, one in 1928 and one in 1967. Finally, Heuver found the problem as Ex. 7 of x54 of George Salmon's A Treatise on Conic Sections, 6th ed. His solution exploits Salmon's imaginative use of pencils of lines in Cartesian coordinates.

2121. 1996: 76 Proposed by Krzysztof Chelminski, Technische
Hochschule Darmstadt, Germany; and Waldemar Pompe, student, University of Warsaw, Poland. Let k 2 be an integer. The sequence xn is de ned by x0 = x1 = 1 and k xn+1 = xn + 1 for n 1:

a Prove that for each positive integer k 2 the sequence xn is a sequence of integers. b If k = 2, show that xn+1 = 3xn , xn,1 for n 1. c? Note that for k = 2, part a follows immediately from b. Is there an analogous recurrence relation to the one in b, not necessarily linear, which would give an immediate proof of a for k 3?

I Solution a and b only by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. a We immediately get x2 = 2 and x3 = 2k + 1. Now we use mathematical induction for the proof. Assume that x0 ; x1 ; : : : ; xn are all natural numbers. We must show that xn+1 2 N. First we note that since xn,2 xn = xk ,1 +1 n it follows that xn,2 and xn,1 are relatively prime. Using xn = xk ,1 + n 1=xn,2 we infer that

n,2 n,1 Thus obviously xk ,2 divides N = xk ,1 + 1k + xk ,2 since xn is a natural n n n number. Furthermore, modulo xn,1 we have: N 1 + xk ,2 = xn,3 xn,1 0: n k + k k k n xn+1 = xx + 1 = xn,1 k 1 + xn,2 : x x n,1

xn,1

124

n xn+1 = xx + 1 xn,1 xn+1 , x2 = 1: n n,1 That is, the sequence fyng = fxn,1 xn+1 , x2 g is constant. Setting n yn+1 = yn we have xn xn+2 , x2 +1 = xn,1 xn+1 , x2 n n xn xn + xn+2 = xn+1xn,1 + xn+1 xn + xn+2 = xn,1 + xn+1 : xn+1 xn That is, the sequence fzn g = fxn,1 + xn+1 =xn g is constant. From z1 = 3 we get xn,1 + xn+1 =xn = 3; that is, xn+1 = 3xn , xn,1 for all n 1,

2

b Now,

as claimed. II Solution by Christopher J. Bradley, Clifton College, Bristol, UK. We rst establish the following lemma: Lemma. Suppose a and b have highest common factor 1 and ak + bk +1=ab is an integer where k is an integer, k 2, then i c = bk + 1=a is an integer; ii bk + ck + 1=bc is an integer; iii b and c have highest common factor 1. Proof. Let ak + bk + 1 = a; bab where a; b is an integer. Then since a divides a; bab , ak it also divides bk + 1; that is, bk + 1=a = c is an integer, which proves i. Also

bk + ck + 1 = ac + ck = a + ck,1 = ak + bk + 1k,1 : bc bc b ak,1 b Now bk + 1 = ac has a as a factor, so ak + bk + 1k,1 is divisible by ak,1 and hence the numerator is divisible by ak,1 . Also ak + 1 is divisible by b from part i, so multiplying out the numerator by the Binomial Theorem we see that the numerator is divisible by b. But a and b have highest common factor 1, so the numerator is divisible by ak,1 b. Hence k ck b;c = b +bc + 1 is an integer, which proves ii. Since bk + ck + 1 = b;cbc, if b and c have a common factor h, then h divides bk + ck , b; cbc; that is, h divides 1. Hence b and c have highest common factor 1, which proves iii, and the

lemma is proved. We claim that the recurrence relation sought is

125 with xn,1 ; xn = xk + xk ,1 +1=xnxn,1 , which is but one step away n n from xn+1 = xk + 1=xn,1 . That xn,1 ; xn is always an integer follows n by induction, using the lemma, with the start of induction satis ed since x0 = x1 = 1 have highest common factor 1 and x0; x1 = 3 is an integer. Relation then establishes that fxn g is a sequence of integers. This gives us parts c and a. The term x2 + x2 ,1 +1=xnxn,1 is known from work n n on alternate terms of the Fibonacci sequence to be equal to 3 for all n 2 and is also 3 for n = 1, which proves b. Parts a and b together were also solved by FEDERICO ARDILA, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA; FLORIAN HERZIG, student, Perchtoldsdorf,Austria; and the proposers. Part b alone was solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; and TIM CROSS, King Edward's School, Birmingham, England. There was one incorrect solution. JANOUS comments that this was posed as a problem of the nal round of the third Austrian Mathematical Olympiad held in 1972, and refers the interested reader to the book Osterreichische Matematik-Olympiaden" 19701989, G. Baron & E. Windischbacher, Innsbruck 1990, problem 42.

2122. 1996: 77 Proposed by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario. Little Sam is a unique child and his math marks show it. On four tests this year his scores out of 100 were all two-digit numbers made up of eight di erent non-zero digits. What's more, the average of these scores is the same as the average if each score is reversed so 94 becomes 49, for example, and this average is an integer none of whose digits is equal to any of the digits in the scores. What is Sam's average? I. Solution by Mansur Boase, student, St. Paul's School, London, England. Let the four marks be 10a + b, 10c + d, 10e + f and 10g + h. Then 10a + b + 10c + d + 10e + f + 10g + h = 10b + a + 10d + c + 10f + e + 10h + g; so

and

9a + c + e + g = 9b + d + f + h

a + c + e + g = b + d + f + h:

1

The average of the four marks is therefore 10a + b + 10b + a + 10c + d + 10d + c + 10e + f + 10f + e + 10g + h + 10h + g 4 2

= 11a + b + c + d8+ e + f + g + h :

2

126 The average must consist only of k's and 0's, the digits not equal to a, b, c, d, e, f , g or h. Thus 2 is

111 + 2 + + 9 , k = 1145 , k ; 8 8 and so 8 j 45 , k. Since k 9, the only solution for k is k = 5, and therefore Sam's average is 1140=8 = 55. An example of four such marks is 98; 76; 34; 12.

II. Solution by Tara McCabe, student, Mount Allison University, Sackville, New Brunswick. Editor's note: McCabe rst obtained equation 1 as above, using the same notation. Since a; : : : ; h are all di erent and non-zero, their total must lie between 1 + + 8 = 36 and 2 + + 9 = 44 inclusively. From 1,

Letting the average be the two digit number xy , which by 1 means

36 = 18 a + c + e + g 22 = 44 : 2 2

3

11a + c + e + g = 410x + y : Consequently, a + c + e + g must be divisible by 4, and from 3, a + c + e + g = 20. Therefore 1120 = 410x + y, and so 55 = 10x + y . Little Sam has an average of 55.

A natural addition to this problem is to try to nd Little Sam's four test scores ab; cd; ef and gh. We know that a + c + e + g = 20, and the problem becomes: how many sets of test scores are possible? First, choose four digits from f1; 2; 3; 4; 6; 7; 8; 9g to be a; c; e and g 0 and 5 are not allowed. Notice that for a sum of 20 to be possible, two4 , digits must be chosen from f1; 2; 3; 4g and two from f6; 7; 8; 9g. There are 2 = 6 ways to choose two digits from f1; 2; 3; 4g. The sum S1 of these two digits is such that 3 S1 7, and the only sum that can occur twice is 5. Similarly, there are 6 ways to choose two digits from f6; 7; 8; 9g, the sum S2 of these two digits is such that 13 S2 17, and the only sum that can occur twice is 15. There are 2 2 = 4 combinations when S1 = 5 and S2 = 15 and one combination for each other sum S1 . Therefore, there are eight ways to choose four digits from f1; 2; 3; 4; 6; 7; 8; 9g such that the sum is 20. Once a; c; e and g are chosen, b;d; f and h are simply the four remaining digits. There are 4! = 24 di erent ways to assign these four digits to be b; d; f and h. Therefore there are 8 24 = 192 di erent sets of four test scores possible for Little Sam. He's not such a unique child after all!

127 Also solved by SAM BAETHGE, Nordheim, Texas, USA; CHRISTOPHER J. BRADLEY, CliftonCollege, Bristol, UK; TIM CROSS, King Edward's School, Birmingham, UK; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; NOEL EVANS and CHARLES DIMINNIE, Angelo State University, San Angelo, Texas, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; KATHLEEN E. LEWIS, SUNY Oswego, Oswego, New York, USA; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; JOHN GRANT MCLOUGHLIN, Okanagan University College, Kelowna, B.C.; P. PENNING, Delft, the Netherlands; CORY PYE, student, Memorial University of Newfoundland, St. John's, Newfoundland; JOEL SCHLOSBERG, student, Hunter College High School, New York, NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. Three other solvers did not prove that 55 is the only possible answer. There was also one incorrect answer sent in. At the end of his solution, the proposer asks for the number of sets of test scores satisfying the problem, but only McCabe was able to read his mind and answer this too!

2123. 1996: 77 Proposed by Sydney Bulman Fleming and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. It is known e.g., exercise 23, page 78 of Kenneth H. Rosen's Elementary Number Theory and its Applications, Third Edition that every natural number greater than 6 is the sum of two relatively prime integers, each greater than 1. Find all natural numbers which can be expressed as the sum of three pairwise relatively prime integers, each greater than 1. Solution by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario. Since every number greater than 6 is the sum of two relatively prime integers, then each even number greater than 6 can be expressed as the sum of of two relatively prime odd numbers. If we add 2 to each of these expressions we see that every even number greater than 8 can be expressed as the sum of three pairwise relatively prime integers two relatively prime odd integers and 2. All odd numbers can be expressed in the form 18N + k, where N is a nonnegative integer and k is an odd number less than 18. Note that:

18N + 1 = 6N , 3 + 6N , 1 + 6N + 5 for N 1 18N + 3 = 6N , 1 + 6N + 1 + 6N + 3 for N 1 18N + 5 = 6N , 1 + 6N + 1 + 6N + 5 for N 1

128 for N 1 for N 1 for N 1 for N 1 for N 0 for N 1 Clearly each of the pairs of terms in each expression is relatively prime, since if there is a number which divides each term in a pair it must divide the di erence. The restriction on N ensures that each term is greater than 1. Putting all this together shows that the numbers which can be so written are 10, 12, 14, 15, 16, and all the natural numbers greater than 17. Ed: it is easily veri ed that all other integers do not have the desired property. Also solved by RICHARD I. HESS, Rancho Palos Verdes, California, USA; PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MICHAEL JOSEPHY, Universidad de Costa Rica, San Jos , Costa Rica; KEE-WAI LAU, Hong Kong; DAVID e E. MANES, State University of New York, Oneonta, NY, USA; MICHAEL PARMENTER, Memorial University of Newfoundland, St. John's, Newfoundland; P. PENNING, Delft, the Netherlands; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; and the proposers. There was 1 incorrect submission. Most solvers used mod 18 or mod 12 arithmetic to handle the odd values of n. MANES pointed out that both this problem and the problem in Rosen's book can be found in Sierpi nski's book, 250 Problems in Elementary Number Theory", American Elsevier, New York, 1970, problems 47 and 48 where they are both solved.

= = = = = =

6N , 1 + 6N + 3 + 6N + 5 6N + 1 + 6N + 3 + 6N + 5 6N + 1 + 6N + 3 + 6N + 7 6N + 1 + 6N + 5 + 6N + 7 6N + 3 + 6N + 5 + 6N + 7 6N + 1 + 6N + 7 + 6N + 9

Founding Editors R dacteurs-fondateurs: L opold Sauv & Frederick G.B. Maskell e e e Editors emeriti R dacteur-emeriti: G.W. Sands, R.E. Woodrow, Bruce L.R. Shawyer e Founding Editors R dacteurs-fondateurs: Patrick Surry & Ravi Vakil e Editors emeriti R dacteurs-emeriti: Philip Jong, Je Higham, e J.P. Grossman, Andre Chang, Naoki Sato, Cyrus Hsia

Crux Mathematicorum

Mathematical Mayhem

129

No. 10 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7 This month, we present a university entrance scholarship examination paper from the 1940's. Thanks to Georg Gunther, Sir Wilfred Grenfell College, Corner Brook, Newfoundland, for providing this. We challenge today's university students to solve these problems | send me your nice solutions! 1. Find all the square roots of

1 , x + 22x , 15 , 8x2:

2. Find all the solutions of the system of equations:

= 14; xyz = ,6: 3. Suppose that n is a positive integer and that Ck is the coe cient of xk in the expansion of 1 + xn . Show that n X , 2 k + 1Ck = n +!2n2n1! 1! : n , k=0

4. a Suppose that a 6= 0 and c 6= 0, and that ax3 + bx + c has a factor of the form x2 + px + 1. Show that a2 , c2 = ab. b In this case, prove that ax3 + bx + c and cx3 + bx2 + a have a common quadratic factor. 5. Prove that all the circles in the family de ned by the equation a xed, t variable touch a xed straight line. 6. Find the equation of the locus of a point P which moves so that the tangents from P to the circle x2 + y 2 = r2 cut o a line segment of length 2r on the line x = r.

x2 + y2 + z2

x + y + z = 2;

130 7. If the tangents at A, B and C to the circumcircle of triangle 4ABC meet the opposite sides at D, E and F , respectively, prove that D, E and F are collinear. 8. Find the locus of P which moves so that the polars of P , with respect to three non-intersecting circles, are concurrent. 9. Suppose that P is a point within the tetrahedron OABC . Prove that AOB + BOC + COA is less than APB + BPC + CPA. 10. Two unequal circles of radii R and r touch externally, and P and Q are the points of contact of a common tangent to the circles, respectively. Find the volume of the frustum of a cone generated by rotating PQ about the line joining the centres of the circle. 11. Prove that

sin2 + +sin2 + , 2 cos

, :

12. Three points A, B and C are on level ground. B is east of A, C is N. 49 E. of A, and C is N. 11 300 W. of B . Find the direction of C as seen from the mid-point of AB . 13. With each corner of a square of side r as a centre, four circles of radius r are drawn. Show that the area of the central curvilinear quadrilateral formed inside the square by the intersection of the four circles is

r2

p3 +
: 1,

3

14. An observer on a boat is vertically beneath the centre of a bridge, which crosses a straight canal at right angles. Looking upwards, the observer sees that the angle subtended by the length of the bridge is 2 . The observer then rows a distance along the middle of the canal, and then nds that the length of the bridge now subtends an angle of 2 . Show that the length of the bridge is

cot2 , cot2

131

No. 181 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. We begin this number with two contests. Thanks go to Richard Nowakowski, Canadian Team Leader to the 35th IMO in Hong Kong, for collecting them and forwarding them to us.

numbers and attains only positive values, such that f xf y = x y . Prove that q = p2 . 2. The sides of a polygon with 1994 sides are ai = p4 + i2, i = 1; 2; : : : ; 1994. Prove that its vertices are not all on integer mesh points. 3. A standard triangle" in the plane is a lled isosceles right triangle whose sides are parallel to the x and y axes. A nite family of standard triangles, containing at least three, is given. Every three of this family have a common point. Prove that there is a point common to all triangles in that family. 4. A shape c0 is called a copy of the planar shape c" if the following conditions hold: i There are two planes and 0 and a point P that does not belong to either of them. ii c 2 and c0 2 0 . iii A point X 0 satis es X 0 2 c0 i X 0 is the intersection of 0 with the line passing through X and P . Given a planar trapezoid, prove that there is a square which is a copy of this trapezoid. 5. Find all polynomials px, with real coe cients, satisfying for all x.

SELECTED PROBLEMS FROM THE ISRAEL MATHEMATICAL OLYMPIADS, 1994 1. p and q are positive integers. f is a function de ned for qpositive p

x , 12px = x , 32px + 2

132

PROBLEMS FROM THE BI-NATIONAL ISRAEL-HUNGARY COMPETITION, 1994 1. a1; : : : ; ak ; ak+1 ; : : : ; an are positive numbers k n. Suppose that the values of ak+1 ; : : : ; an are Pxed. How should one choose the values a of a1 ; : : : ; ak in order to minimize i;j;i6=j aji ? 2. Three given circles pass through a common point P and have the same radius. Their other points of pairwise intersections are A, B , C . The 3 circles are contained in the triangle A0 B 0 C 0 in such a way that each side of 4A0 B0 C 0 is tangent to two of the circles. Prove that the area of 4A0 B0 C 0 is at least 9 times the area of 4ABC . 3. m, n are two di erent natural numbers. Show that there exists a real number x, such that 1 fxng 2 and 1 fxmg 2 , where fag is 3 3 3 3 the fractional part of a. 4. An n-m society" is a group of n girls and m boys. Show that there exist numbers n0 and m0 such that every n0 -m0 society contains a subgroup of ve boys and ve girls in which all of the boys know all of the girls or none of the boys knows none of the girls.

Last issue we gave ve more Klamkin Quickies. Next we give his Quicky" solutions to these problems. Many thanks to Murray S. Klamkin, the University of Alberta, for creating the problems and solutions.

October 21, 1996

x4 + 16x , 12 = x2 + 22 , 4x , 22 = x2 + 2x , 2x2 , 2x + 6 = 0; p p the four roots are ,1 3 and 1 i 5. 7. Prove that the smallest regular n-gon which can be inscribed in a given regular n-gon is one whose vertices are the midpoints of the sides of the given regular n-gon. Solution. The circumcircle of the inscribed regular n-gon must intersect each side of the given regular n-gon. The smallest that such a circle can be is the inscribed circle of the given n-gon, and it touches each of its sides at

its midpoints. Solution. Since

133 Solution. If one calculates 12 ; 22 ; : : : ; 302 mod 31 one nds that the sum of no two of these equals 0 mod 31. Hence, a = 31a1 and b = 31b1 so that 311993 divides a2 + b2. Then, a1 = 31a2 and b1 = 31b2. Continuing in 1 1 this fashion with p = 31, we must have a = p998m and b = p998 n so that ab is divisible by p1996. More generally, if a prime p = 4k + 3 divides a2 + b2 , then both a and b must be divisible by p. This follows from the result that a natural n is the sum of squares of two relatively prime natural numbers if and only if n is divisible neither by 4 nor by a natural number of the form 4k + 3" see J.W. Sierpi Elementary Theory of Numbers, Hafner, NY, 1964, p. 170. nski,

p p S 4 + s2 + 2s , 82 + s + 122 = 4s2 + 288 p where s = a + b + c + d. Consequently, min S = 12 2 and is taken on for a = b = c = d = 0.

S = pa + 12 + 2b , 22 + c + 32 + p + 12 + 2c , 22 + d + 32 b 2 + 2d , 22 + a + 32 + + c + 1 d + 12 + 2a , 22 + b + 32

p

10. A set of 500 real numbers is such that any number in the set is greater than one- fth the sum of all the other numbers in the set. Determine the least number of negative numbers in the set. Solution. Letting a1 ; a2 ; a3 ; : : : denote the numbers of the set and S the sum of all the numbers in the set, we have

negative numbers in the set, the right hand side of the inequality could be positive. Hence, there must be at least seven negative numbers. Comment. This problem where the 5" is replaced by 1" is due to Mark Kantrowitz, Carnegie Mellon University.

2.

1995: 269 36th IMO Let a, b, and c be positive real numbers such that abc = 1. Prove that

a3b + c

3 + b3 c1+ a + c3a1+ b 2 :

or

ac + ab +abc2 bc ;

2

or

3

ab + ac + bc ; 2

1 1 1 3

135 Now we turn to some of the readers' solutions to problems proposed to the jury but not used at the 35th IMO in Hong Kong 1995: 299 300 .

PROBLEMS PROPOSED BUT NOT USED AT THE 35th IMO IN HONG KONG

Selected Problems

3. A semicircle , is drawn on one side of a straight line `. C and D are points on ,. The tangents to , at C and D meet ` at B and A respectively, with the center of the semicircle between them. Let E be the point of intersection of AC and BD, and F be the point on ` such that EF is perpendicular to `. Prove that EF bisects CFD. Solutions by Toshio Seimiya, Kawasaki, Japan; and by D.J. Smeenk, Zaltbommel, the Netherlands. We give Seimiya's write-up.

P D C B E T FQ O `

A Let P be the intersection of AD and BC . Then PCO = PDO = 90 , CPO = DPO and PC = PD. Let Q be the intersection of PE with AB . Then by Ceva's Theorem, we get BQ AD PC = BQ AD = 1: QA DP CB QA CB

Thus we get Since BPO = APO we get

BQ = BC : QA AD PB = BO : PA AO

1 2

136 Let T be the foot of the perpendicular from P to AB . Then from 1 and 2 we have

From 1 and 3 we have

3

BQ = PT : QA TA

Hence Q coincides with T so that P , E , F are collinear. See page 136. Because PCO = PDO = PFO = 90 , P , C , F , O, D are concyclic. Hence CFE = CFP = CDP = DCP = DFP = DFE . Thus EF bisects CFD.

D C B F E O ` A

4. A circle ! is tangent to two parallel lines `1 and `2. A second circle !1 is tangent to `1 at A and to ! externally at C . A third circle !2 is tangent to `2 at B , to ! externally at D and to !1 externally at E . AD intersects BC at Q. Prove that Q is the circumcentre of triangle CDE.

Solutions by Toshio Seimiya, Kawasaki, Japan; and by D.J. Smeenk, Zaltbommel, the Netherlands. We give Smeenk's solution. We denote the three circles as ! O;R, !1 O1; R1 , !2 O2; R2 . Now let ! touch `1 at F and `2 at F 0 . Let the line through O2 parallel to `1 intersect FF 0 at G and the production of AO1 at H .

137

`1

F

R

A

R1

O K G

C Q E D R 2 O2 N M B

R2 R1

O1

`2

F0

Let the line through D parallel to `1 intersect FF 0 at K . Let the line through D parallel to FF 0 intersect `1 at L, `2 at M and GO2 at N . Now AF is a common tangent of ! and !1, so

p AF = 2 RR1

1 2

p BF 0 = 2 RR2 = GO2:

p p HO2 = j2 RR2 , 2 RR1 j; HO1 = 2R , R1 , R2: In right triangle O1 HO2 , p p 2 RR2 , 2 RR1 2 + 2R , R1 , R2 2 = R1 + R22 : p After some reduction R = 2 R1 R2 . Next consider triangle GOO2 . p GO = R , R2; GO2 = 2 RR2; DO2 = R2; DO = R; KDkGO2: R GO = 2RpRR2 . We nd that GN = FL = 2 R + R2 R + R2

With 1 we have

2RpRR2 : AL = 2 RR1 , R + R 2

3

138 Furthermore DN =

2 2

Now AD2 = AL2 + DL2 . With 3 and 4,

4

1 2 1 2

So AD = AF . That means that AD touches ! at D and AD is a common tangent and the radical axis of ! and !2. In the same way BC is the radical axis of ! and !1 and Q is the radical point of ! , !1 and !2. So QC = QD = QE , as required.

5. A line ` does not meet a circle ! with center O. E is the point on ` such that OE is perpendicular to `. M is any point on ` other than E. The tangents from M to ! touch it at A and B . C is the point on MA such that EC is perpendicular to MA. D is the point on MB such that ED is perpendicular to MB . The line CD cuts OE at F . Prove that the location of F is independent of that of M .

Solution by Toshio Seimiya, Kawasaki, Japan. As MA, MB are tangent to ! at A, B respectively, we get OAM = OBM = 90 and OM ? AB. Let N , P be the intersections of AB with OM and OE respectively. Since M , E , P , N lie on the circle with diameter MP we get ON OM = OB2 = r2 where r is the radius of !. Hence P is a xed point. P is the pole of `. Let G be the foot of the perpendicular from E to AB . As OBM = OAM = OEM = 90 , O, B, M , E, A are concyclic, so that by Simson's Theorem C , D, G are collinear.

139

! B r N O P A D C F E G

`

1 2 3

EGF = EGC = EAC = EAM: As O, M , E , A are concyclic and OM is parallel to EG we have EAM = EDM = DEG = FEG:

From 1 and 2 we get Since EGP = 90 we get

EGF = FEG:

FGP = FPG: 4 From 3 and 4 we have EF = FG = FP . Thus F is the midpoint of EP . Hence F is a xed point.

140 Next, we give a counterexample to the rst problem of the set of problems proposed to the jury, but not used at the 35th IMO in Hong Kong given in the December 1995 number of the corner. 1. 1995: 334 Problems proposed but not used at the 35th IMO in Hong Kong. ABCD is a quadrilateral with BC parallel to AD. M is the midpoint of CD, P that of MA and Q that of MB . The lines DP and CQ meet at N . Prove that N is not outside triangle ABM . Counterexamples by Joanna Jaszunska, student, Warsaw, Poland; and by Toshio Seimiya, Kawasaki, Japan. We give Jaszunska's example.

B Q X P N A

t

D We draw a triangle ADM and denote the midpoint of MA by P . Let C be a point on the half-line DM such that M is the midpoint of CD. Let N be any point of the segment PD, inside triangle ADM . We construct a parallelogram MCBX such that MX and BC are parallel to AD and X lies on the segment CN . Let us denote the point where the diagonal MB of this quadrilateral meets CN by Q. Q is then the midpoint of MB . Connect points A and B . We have thus constructed a quadrilateral ABCD with BC parallel to AD, M is the midpoint of CD, P that of MA and Q that of MB . Lines DP and CQ meet at N . N is inside triangle ADM ; hence it is outside triangle ABM .

141 Next we look back to some further solutions to problems of the Sixth Irish Mathematical Olympiad given in 1995: 151 152 and for which some solutions were given in 1997: 9 13 . An envelope from Michael Selby arrived which I mis led. It contains solutions to problems 1, 2, and 4 of Day 1, and problems 1, 2, 3 and 4 of Day 2. 1995: 152 Second Paper, Sixth Irish Mathematical Olympiad. Given ve points P1 , P2 , P3 , P4 , P5 in the plane having integer coordinates, prove that there is at least one pair Pi; Pj with i 6= j such that the line Pi Pj contains a point Q having integer coordinates and lying strictly between Pi and Pj . Solution by Michael Selby, University of Windsor, Windsor, Ontario. The points can be characterized according to the parity of their x and y coordinates. There are only four such classes: even, even, even, odd, odd, even, odd, odd. Since we are given ve such points, at least two must have the same parity of coordinates by the Pigeonhole Principle. Suppose they are Pi and Pj , Pi = xi; yi, Pj = xj ; yj . Then xi + xj is even and yi + yj is even, since the xi , xj have the same parity and yi, yj have the same parity. Hence the midpoint has integral coordinates.

1.

Q = xi + xj ; yi + yj 2 2

1995: 152 Second Paper, Sixth Irish Mathematical Olympiad. Let a1 ; a2 ; : : : an , b1; b2 ; : : : bn be 2n real numbers, where a1 ; a2; : : : ; an are distinct, and suppose that there exists a real number such that the product

2.

ai + b1 ai + b2 : : : ai + bn has the value for all i i = 1; 2; : : : ; n. Prove that there exists a real

number such that the product

Pnx = x + b1x + b2 x + bn , : 1 Then Pn ai = 0 for i = 1; 2; : : : ; n. Therefore Pn x = x , a1 x , a2 x , an by the Factor Theorem.

,1n Pn ,bi = bi + a1 bi + a2 bi + an = ,1n+1 by 1: Hence bi + a1 bi + a2 bi + an = ,1n+1 for i = 1; 2; : : : ; n. Thus, the result is true with = ,1n+1 .

That completes the Corner for this number. We are in high Olympiad season. Send me your nice solutions and contests.

The last sentence of the quoted passage, taken from The Daughters of Cain by Colin Dexter Macmillan, 1994, contains two factual erors. What are they? `Have you heard of Pythagorean Triplets"?' `We did Pythagoras Theorem at school.' `Exactly. The most famous of all the triplets, that is | 3, 4, 5" 32 + 42 = 52. Agreed?' `Agreed.' `But there are more spectacular examples than that. The Egyptians, for example, knew all about 5961, 6480, 8161".' Contributed by J.A. McCallum, Medicine Hat, Alberta.

143

BOOK REVIEWS

Edited by ANDY LIU

The Lighter Side of Mathematics, edited by Richard K. Guy and Robert E. Woodrow, Mathematical Association of America, Washington DC, 1994, ISBN 0-88385-516-X, 376+ pages, softcover, US $38.50, reviewed by Murray S. Klamkin, University of Alberta. This book is the proceedings of the Eugene Strens Memorial Conference on Recreational Mathematics and its History held at the University of Calgary in August 1986 to celebrate the founding of the Strens Collection which is now the most complete library of recreational mathematics in the world. I had been invited to attend this conferences but unfortunately had a previous committment. To make up for missing this conference, the next best thing was reviewing this proceedings book which on doing so made me realize what I had missed, for example, some very interesting talks plus getting together with the leading practitioners of recreational mathematics, some of whom were long time colleagues. One does not normally include a list of contents in a book review, but by doing so, it will give the reader a good indication of the wealth of recreational material here . So if you have any interest in recreational mathematics, this is a book for you. And even if you do not have such an interest, reading this book may give you one.

Contents

Part 1: Tiling & Coloring

Frieze Patterns, Triangulated Polygons and Dichromatic Symmetry, H. S. M. Coxeter & J. F Rigby Is Engel's Enigma a Cubelike Puzzle? J. A. Eidswick Metamorphoses of Polygons, Branko Grunbaum SquaRecurves, E-Tours, Eddies, and Frenzies: Basic Families of Peano Curves on the Square Grid, Douglas M. McKenna Fun with Tessellations, John F. Rigby Escher: A Mathematician in Spite of Himself, D. Schattschneider Escheresch, Athelstan Spilhaus The Road Coloring Problem, Daniel Ullman Fourteen Proofs of a Result About Tiling a Rectangle, Stan Wagon Tiling R3 with Circles and Disks, J. B. Wilker

144

Part 2: Games & Puzzles

Introduction to Blockbusting and Domineering, Elwyn Berlekamp 137 A Generating Function for the Distribution of the Scores of all Possible Bowling Games, Curtis N. Cooper & Robert E. Kennedy 149 Is the Mean Bowling Score Awful? Curtis N. Cooper & Robert E. Kennedy 155 Recreation and Depth in Combinatorial Games, Aviezri Fraenkel 159 Recreational Games Displays Combinatorial Games, Aviezri S. Fraenkel 176 Combinatorial Toys, Kathy Jones 195 Rubik's Cube | application or illumination of group theory? Mogens Esrom Larsen 202 Golomb's Twelve Pentomino Problems, Andy Liu 206 A New Take-Away Game, Jim Propp 212 Confessions of a Puzzlesmith, Michael Stueben 222 Puzzles Old & New: Some Historical Notes, Jerry Slocum 229

Part 3: People & Pursuits

The Marvelous Arbelos, Leon Banko Cluster Pairs of an n-Dimensional Cube of Edge Length Two, I. Z. Bouwer & W. W. Cherno The Ancient English Art of Change Ringing, Kenneth J. Falconer The Strong Law of Small Numbers, Richard K. Guy Match Sticks in the Plane, Heiko Harborth Misunderstanding My Mazy Mazes May Make Me Miserable, Mogens Esrom Larsen Henry Ernest Dudeney: Britain's Greatest Puzzlist, Angela Newing From Recreational to Foundational Mathematics, Victor Pambuccian Alphamagic Squares, Lee C. F. Sallows Alphamagic Squares: Part II, Lee C. F. Sallows The Utility of Recreational Mathematics, David Singmaster The Development of Recreational Mathematics in Bulgaria, Jordan Stoyanov V , E + F = 2, Herbert Taylor Tracking Titanics, Samuel Yates List of Conference Participants

247 254 261 265 281 289 294 302 305 326 340 346 353 355 363

Postscript: There is a typographical error in Andy Liu's article on page 206. The number of tetrominoes is ve and not four. This is corrected in the reprint of this article as Appendix C in the new edition of Golomb's Polyominoes".

145

We were saddened to learn of the recent death of Dr. Leon Banko , who has been a contributor to CRUX over many years. Sadly, he was not able to contribute recently, and some of our more recent readers may not know so much about him. We refer you to an excellent article in the March 1992 issue of the College Mathematics Journal, entitled A Conversation with Leon Banko , written by G.L. Alexanderson. One of Leon's long time friends, Dr. Clayton Dodge, has written the appreciation printed below. Leon Banko practiced dentistry for sixty years in Beverly Hills, California, until his retirement just a few years ago. His patients included many Hollywood personalities whose names are household words. Among his several other interests, such as piano, guitar, calculators, and computers, he lectured and wrote papers both on dentistry and mathematics. His specialty was geometry, and the gure he loved best was the arbelos, or shoemaker's knife, which consists of three semicircles having a common diameter line. The two smaller semicircles are externally tangent to each other and internally tangent to the largest semicircle. It is said that the test of a mathematician is not what he himself has discovered, but what he inspired others to do. Leon discovered a third circle congruent to the twin circles of Archimedes and published that result in the September 1974 issue of Mathematics Magazine Are the Twin Circles of Archimedes Really Twins?", pp. 214-218. This revelation motivated the discovery by Leon and by others of several other members of that family of circles. An article on those circles is in progress. Dr. Banko edited the Problem Department of the Pi Mu Epsilon Journal from 1968 to 1981, setting and maintaining a high standard of excellence in the more than 300 problems he included in its pages. Although the Journal has a relatively small circulation, its Problem Department grew to have a large number of regular contributors. He became acquainted with Crux Mathematicorum early in its history, when it was called Eureka, and made many contributions to its pages over the years, maintaining a close friendship with its founder and rst editor Leo Sauv . Like Leo, who started e Crux to add some spice to his mathematical life of teaching basic post high school courses, Leon worked in mathematics for mental exercise and recreation, making friends with and earning the respect of many well known mathematicians. Leon and I became good friends, rst through correspondence regarding the Pi Mu Epsilon Journal Problem Department, and later through many personal meetings, including the August 1979 meeting of problemists in Ottawa, sponsored by Leo Sauv and Fred Maskell of Crux. Following the e

146 formal sessions in Ottawa, seven of us drove to Quebec City for an enjoyable weekend of sightseeing and fellowship: Leo and Carmen Sauv , Leon and e Francine Banko , Charles and Avetta Trigg, and I. Since his retirement from his dentistry, Leon has worked on the manuscript for a proposed book on the properties of the arbelos, carrying on a monumental task started by him and the late Victor Th bault. Much material has been collected for this project e and much remains to be done on it. Indeed, he asked me to nish the job. At one time some years ago a schoolgirl wrote to Albert Einstein about a mathematical question she had. Apparently Einstein misinterpreted her question and gave an incorrect answer. Banko pointed out this error and in his mathematical museum he now has a copy of the Los Angeles Times with the front page headline Local Dentist Proves Einstein Wrong." Leon developed many physical problems in his later years. He was a ghter and he won several physical battles. When I last visited him at his home in Los Angeles in October 1996, he was ghting liver cancer, but still working on the Th bault material, in spite of failing eyesight. On Sunday e afternoon, February 16, 1997, the cancer overtook him and he died at his home at the age of 88. He was a gentleman, a scholar, and a true friend. Clayton W. Dodge University of Maine Orono, ME 04469-5752

Department of Mathematics, Florida Atlantic University

Paul Yiu

1. The area of a triangle is given in terms of its sides a, b, c by the Heron formula p 4 = ss , as , bs , c; where s := 1 a + b + c is the semiperimeter. A triangle a; b;c; 4 is 2 called Heronian if its sides and area are all integers. L. Banko 1 has made an interesting observation about the Heronian triangle 13; 14; 15; 84. The

147 height on the side 14 being 12, this triangle can be decomposed into two Pythagorean components, namely, 5; 12; 13 and 9; 12; 15. The inradii of these Pythagorean triangles, and that of the Heronian triangle, are respectively 2, 3, 4, three consecutive integers! See Figure 1. Noting that the sides of the Heronian triangle are themselves three consecutive integers, Banko remarked that no other Heronian triangle can claim that distinction". Actually, apart from this, there are exactly two other Heronian triangles with three consecutive integers for the associated inradii. Each of these two Heronian triangles is decomposable into two Pythagorean components, namely,

15; 20; 25; 150 = 9; 12; 15 16; 12; 20; 2 25; 39; 56; 420 = 20; 15; 25 36; 15; 39: 3 The three inradii in these two cases are 3, 4, 5, and 5, 6, 7 respectively. The Heronian triangle 15; 20; 25; 150 in 2 has an interesting property that no other Heronian triangle shares. Here, if the smaller Pythagorean component 9; 12; 15 is excised from the larger one 16; 12; 20, another Heronian triangle results, namely,

15; 20; 7; 42 = 16; 12; 20 n 9; 12; 15: 4 This has inradius 2. See Figure 2. Note that the four inradii are consecutive integers! The same construction applied to Banko 's example 13; 14; 15; 84 gives 13; 15; 4; 24, with inradius 3 , not an integer. For the Heronian tri2 angle 25; 39; 56; 420 in 3, this fourth inradius is 3, albeit not consecutive with the other three inradii 5, 6, and 7. In x 4 below, we shall show that,

up to similarity, the con guration in Figure 2 is the only one with the four associated inradii in arithmetic progression.

13 2 5

q q

12

q

15

q

15

q

12

q

20

q

4 3

q q

Figure 1.

5

q

4 9

q q

Figure 2.

with legs a, b, and hypotenuse c, this is also given by the simpler formula

2. Consider two right triangles with a common side y and opposite acute angles and juxtaposed to form a triangle ,+. We shall assume , so that ,1 can be excised from ,2 to form another triangle ,, . See Figures 3 and 4. The inradius of a triangle with area 4 and semiperimeter s is given by r = 4 . See, for example, Coxeter 2, p. 12 . For a right triangle s

148 for which the inradii of the triangle and its two Pythagorean components are in arithmetic progression. The calculations can be made simple by making use of the fact that in a right triangle with an acute angle , the sides are in the ratio 2t : 1 , t2 : 1 + t2 , where t = tan 2 . Let t1 := tan and 2 t2 := tan 2 .

a1

,1

1

,2

a2

,1

x1

a1

,,

a2

,+ = ,1 ,2

Figure 3.

x2

a0 3 ,, = ,2n,1

Figure 4.

a2 = t1 1 + t2 ; 2 x02 = t1 1 , t2 ; 2 a3 = x2 , x1 = t1 , t2 1 + t1 t2 : From these, we determine the inradii of the four triangles ,1 , ,2, ,+ and ,, :

a1 = t2 1 + t2 ; 1 x1 = t2 1 , t2 ; 1 a3 = x1 + x2 = t1 + t2 1 , t1 t2 ;

r+, there are only three cases in which three of these inradii can be in arithmetic progression: i r1, r2 , r+ are in A.P. if and only if t1 , t2 , t1 t2 are in A.P., that is, t t1 + t1t2 = 2t2. From this, t2 = 2,1t1 , and r1 : r2 : r+ = 2 , t1 : 2 : 2 + t1: 6 t2 ii r, , r1 , r2 are in A.P. if and only if t1 , t1 , t2 are in A.P., that is, t2 + t2 = 2t1 . From this, t2 = 2t2 , and 1 t1 1+t1 r, : r1 : r2 = 1 : 1 + t1 : 1 + 2t1: 7 iii r1 , r, , r2 are in A.P. if and only if t1 , t2 , t2 are in A.P., that is, t1 2t2 . From this, t2 = t2 , and 1 t1 + t2 = t1 2,t1 r1 : r, : r2 = 2 , t1 : 2 : 2 + t1: 8

5

149 In each of these cases, with t := t1 , the proportions of the sides of , are as follows. These triangles are all genuine for 0 t 1.

a1 : a2 : a3 or a03 i r1 ; r2 ; r+ 2 , t1 + t2 : 22 , 2t + t2 : 3 , t1 , t2 + t ii r, ; r1 ; r2 2t1 + t1 + t2 : 1 + 2t + t2 + 4t4 : 1 , t1 + t + 2t3 iii r1 ; r, ; r2 t2 , t1 + t2 : 4 , 4t + t2 + t4 : 21 , t2 , t + t3

A.P.

3.

Among the triangles constructed above with three associated inradii in A.P., the only cases in which the three sides also are in A.P. are tabulated below. In each case, we give the smallest Heronian triangle with three associated inradii in integers.

; 1 13; 15; 14;84 = 5; 12; 13 9; 12; 15 r1; r2 ; r+ = 2; 3; 4 2 ; 1 15; 20; 25;150 = 9; 12; 15 16; 12; 20 r1; r2 ; r+ = 3; 4; 5 3 ; 11 15; 37; 26;156 = 35; 12; 37 n 9; 12; 15 r1; r,; r2 = 3; 4; 5 6 ; 15 39; 113; 76;570 = 112; 15; 113 n 36; 15; 39 r,; r1; r2 = 5; 6; 7 Banko 's observation 1 on the Heronian triangle 13; 14; 15; 84 is case 1 in this table. 4. Finally, we consider the possibility for the four inradii r, , r1, r2, r+, to be in A.P. First, assume r1 ; r, ; r2 in A.P. By 8, r1 : r, : r2 = 2 , t1 : t2 2 : 2 + t1; indeed, t2 = 2,1t1 . From 5, we have, after simpli cation,

1 2 3 4

2 3 1 2 1 2 1 5

t1 ; t2

inradii

r1 : r, : r2 : r+ = 2 , t1 : 2 : 2 + t1 : 2 + t1 + t2: 1 2 = 2 + 2t1 . This Now, these four inradii are in A.P. if and only if 2 + t1 + t1 is clearly impossible for 0 t1 1. It remains, therefore, to consider the possibility that r, , r1, r2 , r+ be in A.P. This requires, by 7, r1 : r2 = 1 + t1 : 1 + 2t1 , and also by 6, r1 : r2 = 21, t1 : 2. It follows that 1 + t1 : 1 + 2t1 = 2 , t1 : 2, from which t1 = 2 . Consequently, r1 : r2 = 3 : 4. Also, r1 : r+ = 3 : 5 from 6, and r, : r1 = 2 : 3 from 7. Thus, we have the con guration in Figure 2, in

which the four inradii are in the ratio

r, : r1 : r2 : r+ = 2 : 3 : 4 : 5:

References

The author thanks the referee for valuable comments and suggestions.

1. L. Banko , An Heronian oddity, Crux Math. 8 1982 p.206. 2. H.S.M. Coxeter, Introduction to Geometry, Wiley, New York, 1961.

150

No. 21 R.E. Woodrow

This number we give the problems of the Manitoba Mathematical Contest for 1995. This is a two hour contest aimed primarily at grade 12 students, and sponsored by the Actuaries Club of Winnipeg, The Manitoba Association of Mathematics Teachers, The Canadian Mathematical Society and The University of Manitoba. My thanks go to Diane and Roy Dowling, organizers of the contest for supplying us with it.

nd the value of a. b Noriko's average score on three tests was 84. Her score on the rst test was 90. Her score on the third test was 4 marks higher than her score on the second test. What was her score on the second test? 2. a Find two numbers which di er by 3 and whose squares di er by 63. b Find the real number which is a root of the equation

27x , 13 + 8 = 0:

3. a Two circles lying in the same plane have the same centre. The radius of the larger circle is twice the radius of the smaller circle. The area of the region between the two circles is 7. What is the area of the smaller circle? b The area of a right triangle is 5. Also, the length of the hypotenuse of this triangle is 5. What are the lengths of the other two sides? 4. a The parabola whose equation is 8y = x2 meets the parabola whose equation is x = y 2 at two points. What is the distance between these two points? b Solve the equation 3x3 + x2 , 12x , 4 = 0. 5. a Find the real number a such that a4 , 15a2 , 16 = 0 and 3 + 4a2 , 25a , 100 = 0. a p b Find all positive numbers x such that xx x = xpxx .

151

7. x and y are integers between 10 and 100. y is the number obtained by reversing the digits of x. If x2 , y 2 = 495 nd x and y . 8. Three points P , Q and R lie on a circle. If PQ = 4 and PRQ = 60 what is the radius of the circle? 9. Three points are located in the nite region between the x-axis and the graph of the equation 2x2 + 5y = 10. Prove that at least two of these points are within a distance 3 of each other. 10. Three circles pass through the origin. The centre of the rst circle lies in the rst quadrant, the centre of the second circle lies in the second quadrant, and the centre of the third circle lies in the third quadrant. If P is any point that is inside all three circles, show that P lies in the second quadrant.

Last number we gave the problems of the Mathematical Association National Mathematics Contest 1994 from the United Kingdom. Here are the answers. 1. C 2. E 3. C 4. D 5. E 6. B 7. A 8. D 9. B 10. B 11. B 12. E 13. E 14. A 15. A 16. C 17. D 18. C 19. B 20. B 21. C 22. B 23. E 24. B 25. E That completes the Skoliad Corner for this issue. I need suitable contest materials and welcome your suggestions for the evolution of this feature.

152

MATHEMATICAL MAYHEM

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, University of Toronto, Toronto, ON Canada M5S 1A1. The electronic address is mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

student, Universidad Complutense de Madrid Madrid, Spain In this second and last, for your relief article, we look at some advanced topics like inversion or the applications of calculus to the theory of curves. Inversion Inversion is a transformation determined by a point called the centre of inversion O and an inversion ratio k2 . The image of a point P is a point P 0 such that P 0 is on line OP and jOP 0 j = k2 jOP j. It is evident k2 . Inversion is that a curve r = f can be inverted by letting r = f a conformal transformation, meaning that the angles between intersecting curves are preserved. We will prove this in a later section. Exercise 1. Prove that the inverse curve of a straight line is itself if it passes through the origin or a circle through the origin if it does not.

Example 1. By inspection of the equations of the conic r = 1 , e cos , and the lima on r = b + a cos , it is evident that the inverse of a conic c about its focus is a lima on. I imagine that trying to prove this theory with c synthetic geometry would result in a severe headache. This last result provides a di erent de nition of conics as loci if we invert the de nition of the lima on given above. Consider a circle or straight c

de

153 line and a point O not on it. Draw a circle through O tangent to the circle or line. The diameter through O intersects the circle at P . The locus of all P 's is a conic with O at one focus. Tangent Lines We leave the realm of elementary geometry to enter calculus, where we will teach the same old dog new tricks. The rst is how to nd the tangent line to a polar curve. Our starting point will be the equation of the straight line d = r sin , . The tangent line at 0 is a rst-order approximation to the curve involvdr . Di erentiating the equation of the straight line with ing r0 and

d 0 dr sin , , r cos , , which respect to at 0 , we get 0 = 0 0 0 d 0 r implies that tan , 0 = dr=d . This quantity can sometimes be use0 ful in itself, as , 0 represents the angle between the radius vector and the

tangent line. We will make use of it in the next example. The orientation is determined from its tangent, and implies that

0 + 0 tan , 0 + 0 = 1tan , , tan , tan tan 0

The parameter d in the equation of the tangent line is given after some trigonometric manipulations by which gives

r d = p0 tan , 0 ; 1 + tan2 , 0

0

Example 2. Proof that inversion preserves angles. Let r = f and r = g be two curves that intersect at 0 . Their directions at 0 are 1 and 2, and the angle between them satis es

0 , 0 tan 2 , 1 = tan 2 , 0 + 0 , 1 = 1tan 2 , , tan 1 , : + tan tan ,

2 0 d = pr2 r+dr=d2 j :

Now, the inverted curves, r0 = 1=f and r0 = 1=g , also intersect at 0 and their directions 01 and 02 satisfy

=f ,f tan 01 , 0 = ,11

df = df=d = tan0 , 1 2

f d

154 and similarly for 02. Hence, tan 2 , 1 = tan 01 , 02 and we are done. Tangent lines through the origin An interesting special case is when r0 = 0. In that case, tan = tan ,0 or = 0 . In words, if the curve crosses the origin for a given 0, the equation of the tangent line at the origin is = 0 .

6

-r

-r

When sketching curves, a useful result is that if r has an odd-order root at 0 , then the curve is smooth at the origin, but if the root is even-order, then there is a cusp see the gure. Asymptotes In certain cases r tends to in nity for some nite value of , signalling the possibility of an asymptote. In handling asymptotes, it is convenient to consider s = 1=r, in which ,s j case tan , 0 = 0

d

and tan There is a possible asymptote if s0 = 0 and its equation is: s = sind, 0 , or = 0 if d = 0.

ds 0 s 0 = d jj0 tan ,tan . ds 0 + s 0 0 d

ds=d

This is because, as in the case of tangent lines through the origin, the slope of the tangent line is tan = tan 0 . The parameter d is given by If this does not diverge, there is an asymptote. When sketching curves, it is useful to know from which side of the asymptote the curve approaches in nity. This is achieved by studying the 1 sign of s , d sin , 0 , which tends to 0 at = 0 . If it tends to 0+, the curve is closer to the origin than the asymptote see the gure on the last page, and if it tends to 0,, the curve is farther from the origin than the asymptote. Exercise 2. Sketch the curve r = ln , its asymptote and the tangent line at the origin.

155

Example 3. The parabola r =

diverges at 0 . Arc Length Another application of calculus is the computation of curve lengths. Usually one would take the expression for the line element in cartesian coordinates, dl2 = dx2 + dy 2 and transform it to polar coordinates. To use only polar coordinates, one could apply Pythagoras' Theorem to dr and rd. Although this gives the right answer, it is not rigorous. A rigorous argument that does not rely on rectangular coordinates follows. Applying the cosine rule to side PP 0 of POP 0 see gure we have Expanding each term in a Taylor series up to the second order in d, we get

1 satis es lim r = 1, but it has !0 1 , cos 1 1 no asymptotes since p 2 + sin 0 2 = p21 , cos 0 , which 1 , cos 0

=

dl2

r2 + 2r dr

r , rd

Exercise 3. Derive the polar expression for arc length from the cartesian expression dl2 = dx2 + dy 2. Curvature It seems tautological to say that curvature is an important feature of curves, but the fact is that a planar curve is uniquely determined up to translations and rotations if its curvature is known as a function of arc length. This is generally of little practical importance, since the resulting di erential equations can only be solved if you know the solution! We will give the formula for curvature in terms of s = l=r and some applications.

2 2 + dr d = as follows: l = r d s 0
2 Z 1 ds 1 2 s2 s + d d, where s = r . Z

0

We can thus write the expression for the length of a curve in polar coordinates s

O

dr P 0 r d dl r

156 Curvature, , can be de ned as the rate of change of the direction of the tangent line per unit arc length. We have

,s d arctan ds=d d , = d d

d2 ds , , d 2 + s ds 2 1 = s2 2 ds=d 1+

giving

ds=d

d2 3 2 ds , , d 2 + s ds 5 2 s2 = q , ds 2 41 + , ds 2 s2 + d s2 + d 2

d2s 2 3 s2 6 s + d2 7 = q , ds 2 4 s2 + , ds 2 5 s2 + d d

d2s s+ 2 = h , d2 i3=2 : 1 ds

1 + 2 d

2 2 2 2 = r + 2dr=d , r2 d3=r=d : r2 + dr=d 2

In terms or r, we have

Example 4. If curvature is zero we obtain the di erential equation s + s00 = 0, with general solution s = d cos , 0 , that is, the equation of a straight line. Exercise 4. Check that the curvature at each point of a lemniscate is proportional to the distance to the origin. Hint: to simplify the algebra, divide numerator and denominator by r3 in the curvature formula above.

157

Area Enclosed by Polar Curves

max

O

r + dr r Q

Q0

P0 P

The last application of calculus is the calculation of areas. The natural surface element is the `triangle' de ned by a segment of curve and the radius vectors at the endpoints OPP 0 in the gure. The area of this triangle is, to rst order in d, dA = 1 r2d.

Z sin = =R 1 2 r2 , r, d; A= sin =, =R 2 + p where r = R cos 2 , R2 sin2 . We have Z Z q A = 1 r+ + r, r+ , r, d = 2R cos 2 , R2 sin2 d: 2

A=

If the origin does not lie inside the curve the equation r = r will have more than one branch, as shown, and the sign of the `enclosed area' dA depends on the orientation given to the curve. In the gure the curve is traversed counterclockwise, and so the outer branch PP 0 has positive sign the positive sense of d coincides with the direction of the curve and the inner branch QQ0 has negative sign the positive sense of d as opposed to the direction of the curve. The same applies when calculating the area enclosed by two intersecting curves. Example 5. As our last example, we will evaluate the area enclosed by the circle r , R cos 2 = 2 , R2 sin2 . The area is given by

Z =2

=,=2

2 2 cos2 d =

as expected.

158

A Pattern in Permutations

student, University of Massachusetts Boston, Massachusetts, USA Let pn k be the number of permutations on n elements say, n large anteaters with exactly k xed points i.e. a permutation which takes k elements to themselves, so for example, p3 0 = 2, p3 1 = 3, p32 = 0, and n X p33 = 1. It should be clear that pnk = n!, but may be not so

John Linnell

kpnk = n! this was problem 1 on the 1987 IMO. It may n X be even more surprising to learn that for n 2, k2 pnk = 2n!. What

obvious that

k=0

n X

k=0

kind of pattern ensues? As my old analysis prof would no doubt say, this is good exercise," and it is kind of fun to follow a trail like this and see where it leads. Based on the above results, for n 1 and t 0, let

k=0

1 Qn; t = n!

n X

Then Qn; 0 = Qn; 1 = 1 for all n 1 and Qn; 2 = 2 for all n 2 not n 1, and we will see why soon. Our rst conjecture would probably be then that indeed each Qn; t is an integer. But we will have to see a little more before we can prove anything. Take n = 5. Then we can make the following table:

0 1 2 3 4 5 P

k=0

ktpnk:

44 45 20 10 0 1 120 1 0 45 40 30 0 5 120 1 0 45 80 90 0 25 240 2 0 45 160 270 0 125 600 5 0 45 320 810 0 625 1800 15 0 45 640 2430 0 3125 6240 52

P =5!

Table 1.

159 Thus, Q5; 0 = 1, Q5; 1 = 1, Q5; 2 = 2, Q5; 3 = 5, and so on. So far so good. We can make a second table with the actual Qn;t values:

nnt 0 1 2 3 4 5

1 2 3 4 5 6 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 1 4 5 5 5 5 1 8 14 15 15 15

1 16 41 51 52 52

Table 2. Now we are getting somewhere. Notice how the rows seem to converge to a single sequence of integers, with one new term kicking in with each row. This sequence begins 1, 1, 2, 5, 15, 52, 203, : : : . I could not nd this sequence in any of my references, so I did what any enterprising student would do. I sent an e-mail to sequences@research.att.com, with lookup 1 1 2 5 15 52 203" in the body. For those not familiar, it is an on-line sequence server that tries to solve or match any sequence you might send it; I should also add that they ask that you send at most one request per hour. Soon enough, I had a response, which indicated that this was a sequence known as the Bell numbers, which satisfy

n X n
B0 = 1; Bn + 1 = Bk: k=0 k

This recursion is striking, because if one looks at the second row of n X n
table 2, it may remind one of the identity 2n = . Could it be? Yes, k=0 k in fact the same recursion that generates the Bell numbers is what generates successive rows of table 2. Now we really have something.

Claim. For all n 1 and t 0, Qn + 1; t + 1 =

1 Qn + 1; t + 1 = n + 1!

n+1 X

160

X n + 1 n+1 n! kt+1 p = n + 1! n+1,k 0 k=1 k , 1!n + 1 , k! k X 1 n+1 kt n p = n! k , 1 n+1,k0 k=1 X 1 n+1 ktp k , 1 = n! n k=1 n 1 X k + 1t p k = n! n k=0 X t 1 n+1 X t kip k = n! n k=1 i i=0 ! t n X t 1 X i = k pnk i=0 i n! k=0

So we have proven quite a bit actually, including: 1. Each Qn; t is an integer i.e.,

n X k=0

2. For xed t, Qn; t eventually becomes B t for su ciently high n. The claim looks complicated, but we know what we want to prove, and it turns out to be just a little algebraic manipulation. So in the end, we have a nice result from a simple observation.

161

Canadian students wishing to participate in this program should rst contact Professor Edward J. Barbeau, Department of Mathematics, University of Toronto, Toronto, Ontario. Please note that there is a fee for participation in the program: $12. Please make the cheque payable to Edward J. Barbeau.

PROBLEM SET 1

Algebra 1. Solve the system of equations

x2 + 2yz = x; y2 + 2xz = z; z2 + 2xy = y: 2. Let m be a real number. Solve, for x, the equation jx2 , 1j + jx2 , 4j = mx:

3. Let fx1 ; x2 ; : : : ; xn ; : : : g be a sequence of nonzero real numbers. Show that the sequence is an arithmetic progression if and only if, for each integer n 2,

4. Suppose that x and y are two unequal positive real numbers. Let

g = xy1=2 xy h = x2+ y : Which of the numbers r , a, a , g , g , h is largest and which is smallest? 5. Simplify x3 , 3x + x2 , 1px2 , 4 , 2 x3 , 3x + x2 , 1px2 , 4 + 2 to a fraction whose numerator and denominator are of the form upv with u and v each linear polynomials. For which values of x is the r=

2 a= x+y 2

equation valid?

x2 + y2 1=2

162 6. Prove or disprove: if x and y are real numbers with y 0 and yy + 1 x + 12, then yy , 1 x2. 7. X is a collection of objects upon which the operation of addition, subtraction and multiplication are de ned so as to satisfy the following axioms: 1 if x; y belong to X , then x + y and xy both belong to X ; 2 for all x; y in X , x + y = y + x; 3 for all x; y;z in X , x + y + z = x + y + z and xyz = xy z ; 4 for all x; y; z in x, xy + z = xy + xz ; 5 there is an element 0 such that 0+x = x+0 = x and for each x in X , there exists a unique element denoted by ,x for which x + ,x = 0; 6 x , y = x + ,y for each pair x; y of elements of X ; 7 x3 , x = x + x + x = 0 for x in X . Note that these axioms do not rule out the possibility that the product of two non-zero elements of X may be zero, and so it may not be valid to cancel terms. On X , we de ne a relation by the following condition: x y if and only if x2y , xy2 , xy + x2 = 0. Prove that the following properties obtain: i x x for each element x of X ; ii if x y and y x, then x = y ; iii if x y and y z , then x z . 8. Let n be a positive integer and suppose that u and v are positive real numbers. Determine necessary and su cient conditions on u and v such that there exist real numbers a1 ; a2 ; : : : ; an satisfying

When such a representation is possible, determine the maximum and minimum values of a1 . 1 1 9. Suppose that x + y = y + 1 = z + x = t, where x; y;z are not all z equal. Determine xyz . 10. Let a 0. The polynomial x3 , ax + 1 has three distinct real roots. For which values of a does the root u of least absolute value satisfy 1 2 a u a?

a1 a2 an 0 u = a1 + a2 + + an v = a2 + a2 + + a2 : 1 2 n

163 11. Determine the range of values of cd subject to the constraints ab = 1, ac + bd = 2, where a, b, c, d are real. 12. Find polynomials px and q x with integer coe cients such that

Mayhem Problems

The Mayhem Problems editors are: Cyrus Hsia Mayhem Advanced Problems Editor, Richard Hoshino Mayhem High School Problems Editor, Ravi Vakil Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only problems | the next issue will feature only solutions. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions to the new problems in this issue be submitted by 1 August 1997, for publication in the issue 5 months ahead; that is, issue 8. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions from others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

164

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca There is a correction for H220; the expression 2n T should be 2n T . S S H221. Let P = 195 + 6605 + 13165. It is known that 25 is one of the forty-eight positive divisors of P . Determine the largest divisor of P that is less than 10; 000. H222. McGregor becomes very bored one day and decides to write down a three digit number ABC , and the six permutations of its digits. To his surprise, he nds that ABC is divisible by 2, ACB is divisible by 3, BAC is divisible by 4, BCA is divisible by 5, CAB is divisible by 6, and CBA is a divisor of 1995. Determine ABC . H223. There are n black marbles and two red marbles in a jar. One by one, marbles are drawn at random out of the jar. Jeanette wins as soon as two black marbles are drawn, and Fraserette wins as soon as two red marbles are drawn. The game continues until one of the two wins. Let J n and F n be the two probabilities that Jeanette and Fraserette win, respectively. 1. Determine the value of F 1 + F 2 + + F 3992. 2. As n approaches in nity, what does J 2 J 3 J 4 J n approach?

H224. Consider square ABCD with side length 1. Select a point M exterior to the square so that AMB is 90 . Let a = AM and b = BM . Now, determine the point N exterior to the square so that CN = a and DN = b. Find, as a function of a and b, the length of line segment MN .

A a b

165

Advanced Problems

Editor: Cyrus Hsia, 21 Van Allan Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu A197. Calculate

where N is a non-negative integer. A198. Given positive real numbers a, b, and c such that a + b + c = 1, show that aa bb cc + ab bcca + ac bacb 1. A199. Let P be a point inside triangle ABC . Let A0 , B0, and C 0 be the re ections of P through the sides BC , AC , and AB respectively. For what points P are the six points A, B , C , A0 , B 0 , and C 0 concyclic? A200. Given positive integers n and k, for 0 i k , 1, let

2 , 2

sin2N + 1 d; sin

n Sn;k;i = : j i mod k j Do there exist positive integers n, k 2, such that Sn;k;0, Sn;k;1, : : : , Sn;k;k,1 are all equal? X

Editor: Ravi Vakil, Department of Mathematics, One Oxford Street, Cambridge, MA, USA. 02138-2901 ravi@math.harvard.edu There are no new Challenge Board Problems this month | we reprint those from issue 1 this year 1997: 44 ' C70. Prove that the group of automorphisms of the dodecahedron is S5, the symmetric group on ve letters, and that the rotation group of the dodecahedron the subgroup of automorphisms preserving orientation is A5 . C71. Let L1, L2, L3, L4 be four general lines in the plane. Let pij be the intersection of lines Li and Lj . Prove that the circumcircles of the four triangles p12 p23p31 , p23 p34p42 , p34 p41p13 , p41p12 p24 are concurrent. C72. A nite group G acts on a nite set X transitively. In other words, for any x; y 2 X , there is a g 2 G with g x = y . Prove that there is an element of G whose action on X has no xed points.

166

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 1 "11" or A4 sheets of paper. 2 These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 November 1997. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication. Proposed by K.R.S. Sastry, Dodballapur, India. An old man willed that, upon his death, his three sons would receive the u'th, v 'th, w'th parts of his herd of camels respectively. He had uvw , 1 camels in the herd when he died. Obviously, their sophisticated calculator could not divide uvw , 1 exactly into u, v or w parts. They approached a distinguished CRUX problem solver for help, who rode over on his camel, which he added to the herd and then ful lled the old man's wishes, and took the one camel that remained, which was, of course, his own. Dear CRUX reader, how many camels were there in the herd? 2227. Proposed by Joaqu

n Gomez Rey, IES Luis Bu~ uel, Alcorc
n on, Madrid, Spain. Evaluate " 1 ,2k

2226.

Y X

k 2k p k=0 2p

167

2228. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. Let A be the set of all real numbers from the interval 0; 1 whose decimal representation consists only of 1's and 7's; that is, let

A=

X 1

Let B be the set of all reals that cannot be expressed as nite sums of members of A. Find sup B . 2229. Proposed by Kenneth Kam Chiu Ko, Mississauga, Ontario. a Let m be any positive integer greater than 2, such that x2 1 mod m whenever x; m = 1. Let n be a positive integer. If mjn +1, prove that the sum of all divisors of n is divisible by m. b? Find all possible values of m

k=1

ak : a 2 f1; 7g : 10k k

2230. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. Triangles BCD and ACE are constructed outwardly on sides BC and CA of triangle ABC such that AE = BD and BDC + AEC = 180 . The point F is chosen to lie on the segment AB so that

Prove that

AF = DC : FB CE

2231. Proposed by Herbert Gulicher, Westfalische Wilhelms-Universitat, Munster, Germany. In quadrilateral P1P2 P3 P4 , suppose that the diagonals intersect at the point M 6= Pi i = 1; 2; 3; 4. Let MP1 P4 = 1, MP3 P4 = 2, MP1P2 = 1 and MP3P2 = 2 . Prove that

13 := jjP1 M jj = cot 1 cot 1 ; MP3 cot 2 cot 2 where the +, sign holds if the line segment P1 P3 is located inside outside

the quadrilateral.

EF FD DE CD + CE = BC = AC :

168 2232. Proposed by Sefket Arslanagi c, University of Sarajevo, Sarajevo, Bosnia and Herzegovina. Find all solutions of the inequality:

n2 + n , 5

Note: If x is a real number, then bxc is the largest integer not exceeding x. 2233. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let x, y , z be non-negative real numbers such that x + y + z = 1, and let p be a positive real number. a If 0 p 1, prove that where

n n + 1 n + 2 n2 + 2n , 2; n 2 N: 3 + 3 + 3

b? Prove the same inequality for p 1. Show that the constant Cp is best possible in all cases. 2234. Proposed by Victor Oxman, University of Haifa, Haifa, Israel. Given triangle ABC , its centroid G and its incentre I , construct, using only an unmarked straightedge, its orthocentre H . 2235. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Triangle ABC has angle CAB = 90 . Let ,1O; R be the circumcircle and ,2 T; r be the incircle. The tangent to ,1 at A and the polar line of A with respect to ,2 intersect at S . The distances from S to AC and AB are denoted by d1 and d2 respectively. Show that a ST kBC , b jd1 , d2 j = r. For the bene t of readers who are not familiar with the term polar line", we give the following de nition as in, for example, Modern Geometries, 4th Edition, by James R. Smart, Brooks Cole, 1994: The line through an inverse point and perpendicular to the line joining the original point to the centre of the circle of inversion is called the polar of the original point, whereas the point itself is called the pole of the line.

log 3,log 2

169 Proposed by Victor Oxman, University of Haifa, Haifa, Israel. Let ABC be an arbitrary triangle and let P be an arbitrary point in the interior of the circumcircle of 4ABC . Let K , L, M , denote the feet of the perpendiculars from P to the lines AB , BC , CA, respectively.

2236.

Prove that KLM 4 . Note: XY Z denotes the area of 4XY Z . 2237. Proposed by Meletis D. Vasiliou, Elefsis, Greece. ABCD is a square with incircle ,. Let ` be a tangent to ,. Let A0 , B0, 0 , D0 be points on ` such that AA0 , BB 0 , CC 0 , DD0 are all perpendicular C to `. Prove that AA0 CC 0 = BB 0 DD0 .

ABC

Correction

2173. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let n 2 and x1 ; : : : ; xn 0 with x1 + : : : + xn = 1. Consider the terms

ln =

and where

1 + xk 1 , xk xk k=1

k=1 n Y 1 + xk p1 , x k

n X

rn = Cn

170

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 1940. 1994: 108; 1995: 107; 1995: 205; 1996: 321 Proposed by Ji Chen, Ningbo University, China. Show that if x; y;z 0,

Solution by Marcin E. Kuczma, Warszawa, Poland. Let F be the expression on the left side of the proposed inequality. Assume without loss of generality x y z 0, with y 0 not excluding z = 0, and de ne:

A B C D E

= = = = =

2x + 2y , zx , z y , z + z x + y 2; 1=4zx + y , 2z11x + 11y + 2z ; x + yx + zy + z ; x + y + zx + y , 2z + xy , z + y x , z + x , y 2; 1=4x + yzx + y + 2z 2x + y , 2z 2:

This proves the inequality and shows that it becomes an equality only for x = y = z and for x = y 0, z = 0. Comment. The problem is memorable for me! It was my solution" 1995: 107 that appeared rst. According to someone's polite opinion it was elegant, but according to the impolite truth, it was wrong. I noticed the fatal error when it was too late to do anything; the issue was in print already. In 1995: 205 a correct solution by Kee-Wai Lau appeared. Meanwhile I found two other proofs, hopefully correct, and sent them to the editor. Like Kee-Wai Lau's, they required the use of calculus and were lacking lightness", so to say, so the editor asked 1995:206 for a nice" solution. I became rather sceptical about the possibility of proving the result by those techniques usually considered as nice", such as convexity majorization arguments | just because the inequality turns into equality not only for x = y = z, but also for certain boundary con gurations. In response to the editor's prompt, Vedula Murty 1996: 321 proposed a short proof avoiding hard calculations. But I must frankly confess that I do

171 not understand its nal argument: I do not see why the sum of the rst two terms in 1996: 3213 must be non-negative. While trying to clarify that, I arrived at the proof which I present here. This proof can be called anything but nice"! Decomposition into sums and products of several expressions, obviously nonnegative, and equally ugly, has the advantage that it provides a proof immediately understood and veri ed if one uses some symbolic calculation software with some e ort, the formula can be checked even by hand. But the striking disadvantage of such formulas is that they carefully hide from the reader all the ideas that must have led to them; they take the background mathematics" of the reasoning away. In the case at hand I only wish to say that the equality I propose here has been inspired by Murty's brilliant idea to isolate the polynomial that appears as the third term in 1996: 3213 and to deal with the expression that remains. I once overheard a mathematician problemist claiming lack of sympathy to inequality problems. In the ultimate end, he said, they all reduce to the only one fundamental inequality, which is x2 0! 1996: 77 Proposed by Catherine Shevlin, Wallsend, England. Suppose that ABCD is a quadrilateral with CDB = CBD = 50 and CAB = ABD = BCD. Prove that AD ? BC .

2124.

C A B

I. Solutionby Florian Herzig, student, Perchtoldsdorf, Austria. Essentially identical solutions were submitted by Jordi Dou, Barcelona, Spain and Hans Engelhaupt, Franz Ludwig Gymnasium, Bamberg, Germany. The solution by Carl Bosley, student, Washburn Rural High School, Topeka, Kansas, USA was very similar. Let F1 and F2 be the feet of the perpendiculars from D and A to BC respectively. Let p = BC = CD and q = AC . Then, applying the Sine Rule to 4ABC , we have

CF1 = p cos 80 ;

CF1 = cos 80 = 2 sin 80 cos 80 = sin 160 = 1: CF2 2cos 70 cos 70 sin20 sin 80 Thus, F1 = F2 , and this point is the intersection of AD and BC , whence AD ? BC .

II. Solution by Federico Ardila, student, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA. Consider a regular 18 gon P1 P2 : : : P18. P5 P6 We will rst show that P1 P10, P4 P7 P2P12 and P4P15 concur. P3 P8 By symmetry, P1 P10 , P4 P15 and P2 P9 P5P16 are concurrent. Thus it su prove that P1 P10 Q P1 P10 is2 P12 cientPto 16 are concurrent. , P and 5P Using the angles version of Ceva's P18 P11 theorem in triangle 4P1 P5P12 , it P17 P12 if su cient to prove that P16 P13 P15 P14

q q q q q q q q q q q q q q q q q q q

or

sin P1P12P2 sin P12P5 P16 sin P5P1P10 = 1; sin P2P12P5 sin P16 P5 P1 sin P10P1P12 sin10 sin40 sin50 = 1: sin30 sin30 sin20

So, P1 P10 , P2 P12 and P4 P15 concur at, say, Q. Using this, it is easy to check that and

sin 10 sin40 sin 50 = sin10 sin 40 cos 40 = sin10 sin80 = sin10 2cos 10 2 sin20 = sin30 2 sin20 : = 4

P2P4Q = P4QP2 = 50 ;

P2P1Q = P4QP1 = QP2P4 = 80 : This information clearly determines the quadrilateral P1 P2 P4 Q up to similarity, so P1 P2 P4 Q ACDB .

, Brazil; SEFKET University of Sarajevo, Sarajevo, Bosnia and Herzegovina; ARSLANAGIC, SAM BAETHGE, Science Academy, Austin, Texas, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut, USA; RICHARD I. HESS, Rancho Palos Verdes, California, USA; PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; KEE-WAI LAU, Hong Kong; P. PENNING, Delft, the Netherlands; TOSHIO SEIMIYA, Kawasaki, Japan; D.J. SMEENK, Zaltbommel, the Netherlands; PANOS E. TSAOUSSOGLOU, Athens, Greece; MELETIS VASILIOU, Elefsis, Greece two solutions; and the proposer. The proposer writes: The genesis of this problem lies in a question asked by Junji Inaba, student, William Hulme's Grammar School, Manchester, England, in Mathematical Spectrum, vol. 28 1995 6, p. 18. He gives the diagram in my question, with the given information:

CDA = 20 ; DBC = 50 ;

DAB = 60 ; CBA = 30 ;

and asks the question: can any reader nd CDB without trigonometry?" In fact, such a solution was given in the next issue of Mathematics Spectrum by Brian Stonebridge, Department of Computer Science, University of Bristol, Bristol, England. The genesis of the diagram is much older, if one produces BD and AC to meet at E . See Mathematical Spectrum, vol. 27 1994 5, pp. 7 and 65 66. In one reference, the question of nding CDA is called Mahatma's Puzzle", but no reference was available. Can any reader enlighten me on the origin of this puzzle?

2125. 1996: 122 Proposed by Bill Sands, University of Calgary, Calgary, Alberta. At Lake West Collegiate, the lockers are in a long rectangular array, with three rows of N lockers each. The lockers in the top row are numbered 1 to N , the middle row N + 1 to 2N , and the bottom row 2N + 1 to 3N , all from left to right. Ann, Beth, and Carol are three friends whose lockers are located as follows:

174

:::

@ , @ ,

@ ,

:::

By the way, the three girls are not only friends, but also next-door neighbours, with Ann's, Beth's, and Carol's houses next to each other in that order on the same street. So the girls are intrigued when they notice that Beth's house number divides into all three of their locker numbers. What is Beth's house number? Solution by Han Ping Davin Chor, student, Cambridge, MA, USA. From the diagram, it can be observed that the lockers have numbers

x + 3; N + x + 5 and 2N + x; where 1 x N , x a positive integer. Here locker x + 3 is in the rst row, locker N + x + 5 is in the second row, and locker 2N + x is in the third row. Let y be Beth's house number, where y is a positive integer. Since y divides into x + 3, N + x + 5 and 2N + x, y must divide into 2N + x + 5 , 2N + x , x + 3 = 7: Therefore y = 1 or 7. However, Beth's house is in between Ann's and

Carol's. Assuming that 0 is not assigned as a house number, it means that Beth's house number cannot be 1 else either Ann or Carol would have a house number of 0. Therefore Beth's house number is 7. Also solved by SAM BAETHGE, Science Academy, Austin, Texas, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; J. K. FLOYD, Newnan, Georgia, USA; IAN JUNE L. GARCES, Ateneo de Manila University, Manila, the Philippines, and GIOVANNI MAZZARELLO, Ferrovie dello Stato, Firenze, Italy; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; KATHLEEN E. LEWIS, SUNY Oswego, Oswego, New York, USA; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; JOHN GRANT MCLOUGHLIN, Okanagan University College, Kelowna, B. C.; P. PENNING, Delft, the Netherlands; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; CORY PYE, student, Memorial University of Newfoundland, St. John's, Newfoundland; JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DAVID STONE, Georgia Southern University, Statesboro, Georgia, USA; EDWARD

175 T.H. WANG, Wilfrid Laurier University, Waterloo, Ontario; KENNETH M. WILKE, Topeka, Kansas, USA; and the proposer. Two solvers eliminated 1 as a possible answer, because the problem said that the girls were intrigued" that Beth's house number divided all their locker numbers, which would hardly be likely if Beth's house number were just 1! Thus they didn't need the information about the location of Beth's house at all. Another solver, to whom the editor has therefore given the bene t of the doubt, merely stated that the location of Ann's and Carol's houses doesn't enter into the problem".

2126. 1996: 123 Proposed by Bill Sands, University of Calgary, Calgary, Alberta. At Lake West Collegiate, the lockers are in a long rectangular array, with three rows of N lockers each, where N is some positive integer between 400 and 450. The lockers in the top row were originally numbered 1 to N , the middle row N + 1 to 2N , and the bottom row 2N + 1 to 3N , all from left to right. However, one evening the school administration changed around the locker numbers so that the rst column on the left is now numbered 1 to 3, the next column 4 to 6, and so forth, all from top to bottom. Three friends, whose lockers are located one in each row, come in the next morning to discover that each of them now has the locker number that used to belong to one of the others! What are were their locker numbers, assuming that all are three-digit numbers? Solution by Ian June L. Garces, Ateneo de Manila University, Manila, the Philippines, and Giovanni Mazzarello, Ferrovie dello Stato, Firenze, Italy. The friends' locker numbers are 246, 736 and 932. To show this, rst consider any particular locker. Then the original before the change number of this locker can be written as iN + j , where 0 i 2 the row and 1 j N the column. With respect to this original locker number, this particular locker has a new after the change number 3j , 1 + i + 1 = 3j + i , 2. Consider now the three friends' lockers. Since the three lockers are located one in each row, we can let them be j1 , N + j2 and 2N + j3 where 1 j1; j2; j3 N . For each of these lockers, the corresponding new locker numbers will be 3j1 , 2, 3j2 , 1 and 3j3. Then there will be two possibilities for how their original locker numbers and their new locker numbers were properly" interchanged: Possibility 1. The rst possibility is when

j1 = 3j3; N + j2 = 3j1 , 2;

1 2

176 3 Substituting 1 into 2 and solving for j2, we have j2 = 9j3 , 2 , N . Substituting this last equality into 3 and solving for j3 , we have which implies that N 9 mod 26. Choosing N between 400 and 450, we have the unique N = 425 and thus j3 = 82, j2 = 311 and j1 = 246. Hence the original locker numbers are 246, 736 and 932 which, after the change, will respectively be 736, 932 and 246 which satisfy what we want. Possibility 2. The other possibility is when

2N + j3 = 3j2 , 1: + j3 = 5N26 7

2N + j3 = 3j1 , 2: Similar computation as in Possibility 1 yields N = 425, j2 = 115, j3 = 180 and j1 = 344. But this means that one of the lockers will have number 1030

j1 = 3j2 , 1;

N + j2 = 3j3;

which is contrary to the assumption. Therefore, the only possible locker numbers of the three friends are 246, 736 and 932. Also solved by SAM BAETHGE, Science Academy, Austin, Texas, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; JOSEPH CALLAGHAN, student, University of Waterloo, Waterloo, Ontario; HAN PING DAVIN CHOR, student, Cambridge, MA, USA; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; RICHARD I. HESS, Rancho Palos Verdes, California, USA; PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; KATHLEEN E. LEWIS, SUNY Oswego, Oswego, New York, USA; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; P. PENNING, Delft, the Netherlands; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; DAVID STONE, Georgia Southern University, Statesboro, Georgia, USA; and the proposer. Many solvers mentioned that the other set of locker numbers arising from the problem is 344, 540 and 1030. Some remarked that the value of N was 425 in both cases. However, apparently nobody noticed that these two triples of numbers enjoy a curious relationship:

So now readers are challenged to gure out why this relationship is true. When N = 425, the problem says that the numbers 246; 736; 932 are interchanged when the lockers are renumbered. So let's call this set of numbers a swapset" for N = 425; that is, for a particular N , a swapset is

177 any set of numbers which get swapped among each other by the renumbering. We want true swapping; so we don't allow the sets f1g or f3N g or the middle" locker f3N + 1=2g when N is odd, which are obviously unchanged by the renumbering, to be in swapsets. Lots of problems concerning swapsets could be looked at. For example, one of the solvers Stone points out that there are no swapsets of two numbers when N = 425, but there are when N = 427: lockers 161 and 481 get swapped. Which values of N have swapsets of size two? Here's another problem. It's clear that the set of all numbers from 1 to 3N , minus the two or three numbers that stay the same, will be a swapset for every N . But are there any numbers N which have no other swapsets? If so, can you describe all such N ?

ABC is an acute triangle with circumcentre O, and D is a point on the minor arc AC of the circumcircle D 6= A; C . Let P be a point on the side AB such that ADP = OBC , and let Q be a point on the side BC such that CDQ = OBA. Prove that DPQ = DOC and DQP = DOA.

Solution by Florian Herzig, student, Perchtoldsdorf, Austria. First I prove that B is an excentre of 4PDQ.

2127.

QDB = CDB , CDQ = CAB , OAB = CAO: Since 4OAC is isosceles, we have that PDB = QDB and thus BD is the internal angle bisector of PDQ. 2 What is more, we know that, in any 4XY Z , the excentre, M , whose excircle touches Y Z , is exactly the point on the internal angle bisector of Y XZ outside the triangle for which Y MZ = 180 , MZY , MY Z Y Z , X = 2 + 2 = 180 2 X = 90 , 2 : Therefore B is an excentre of 4PDQ because of 1 and 2. Then BP and BQ are the external angle bisectors of DPQ and DQP , respectively, whence APD = BPQ and CQD = BQP: 3

and

ABC = 180 , ADC = 180 , ADP + CDQ + PDQ = 180 , CBO + ABO + PDQ = 180 , ABC , PDQ; ABC = 90 , PDQ ; 2 PDB = ADB , ADP = ACB , OCB = ACO;

1

= = = = = = = = 2 BDC; 90 + OBC; 90 + ADP; 90 + 180 , DAP , APD; 90 , APD; 180 , APD + BPQ

BDC;

and analogously DOA = DQP: Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; HAN PING DAVIN CHOR, student, Cambridge, MA, USA; P. PENNING, Delft, the Netherlands; WALDEMAR POMPE, student, University of Warsaw, Poland; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer.

DPQ;

because of 3

Solution by Heinz-Jurgen Sei ert, Berlin, Germany. In cartesian coordinates, let A = 0; 0, B = 1; 0, C = 1; 1, D = 0; 1, P = 1;p and Q = q; 1, where 0 p; q 1:

Then E = 11,pq ; 0 and F = 0; 11,pq , tan PAB = p, tan DAQ = q , ,p ,q , , tan DCF = FD = q1,qp , tan BCE = BE = p1,pq . 1 1 Since PAQ = , PAB , DAQ and ECF = + DCF + BCE; 2 2 it follows that

ABCD is a square. Let P and Q be interior points on the sides BC and CD respectively, and let E and F be the intersections of PQ with AB and AD respectively. Prove that PAQ + ECF 54 :

2128.

PAQ + ECF , ,q = + arctan q1, qp , arctan q + arctan p1, p , arctan p 1 1 2 1 p = + arctan 1 , p1 , q1 , pq2, pqp1 , q2 + q1 , p2 p + q + , q

p; q

1, it su ces to

The left inequality is obviously true, while the right follows from the identity

p1 , q2 + q1 , p2p + q = 1 , pq p , q 2 +2pq 1 , p2 +1 , q 2:

Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; NIELS BEJLEGAARD, Stavanger, Norway; FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; JOSEPH CALLAGHAN, student, University of Waterloo; RICHARD I. HESS, Rancho Palos Verdes, California, USA; VICTOR OXMAN, University of Haifa, Haifa, Israel; and the proposer.

PE CD BQ = 1: 1 EC DB QP We have EC = CD because they are tangents from C . Similarly, AF = AE, so that FB = EP since AB = AP . But also, FB = DB, so that DB = PE . Setting EC = CD and DB = PE in 1, we conclude that BQ = QP ; therefore Q is the mid-point of BP . Hence the line DE passes through the xed point Q.

2130. 1996: 123 Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. A and B are xed points, and ` is a xed line passing through A. C is a variable point on `, staying on one side of A. The incircle of ABC touches BC at D and AC at E. Show that line DE passes through a xed point. Solutionby Mitko Kunchev, Baba Tonka School of Mathematics, Rousse, Bulgaria. We choose the point P on ` with AP = AB . Let C be an arbitrary point of `, di erent from P but on the same side of A. The incircle of 4ABC touches the sides BC , AC , AB in the points D, E , F respectively. Let ED meet PB in the point Q. According to Menelaus' Theorem applied to 4CBP and the collinear points E, D, Q, we get

Also solved by NIELS BEJLEGAARD, Stavanger, Norway; FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CHRISTOPHER J. BRADLEY, CliftonCollege, Bristol, UK; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; P. PENNING, Delft, the Netherlands; TOSHIO SEIMIYA, Kawasaki, Japan; PAUL YIU, Florida Atlantic University, Boca Raton, Florida, USA two solutions; and the proposer.

180 Seimiya and Yiu used the same argument as Kunchev. Seimiya mentions that the result is easily shown to hold also when C coincides with P even though the featured argument breaks down. Yiu extends the result to include excircles: The line joining the points where an excircle touches the segment BC and the line ` also passes through Q. 1996: 124 Proposed by Hoe Teck Wee, Singapore. Find all positive integers n 1 such that there exists a cyclic permutation of 1; 1; 2; 2; : : : ; n; n satisfying: i no two adjacent terms of the permutation including the last and rst term are equal; and ii no block of n consecutive terms consists of n distinct integers. Solution by the proposer. It is clear that 2 does not have the desired property. Suppose 3 has the speci ed property. So there exists a permutation of 1; 1; 2; 2; 3; 3 satisfying the two conditions. WLOG assume that the rst term is 1. From ii we know that the second term is not 1, say it is 2. From i the third term must be 1. From i and ii the fourth term must be 2. This leaves the two 3s as the last two terms, contradicting i. Suppose 4 has the speci ed property. So there exists a permutation of 1; 1; 2; 2; 3; 3; 4; 4 satisfying the two conditions. Arrange these eight permuted numbers in a circle in that order so that they are equally spaced. Then the two conditions still hold. Now consider any four consecutive numbers on the circle. If they consist of only two distinct integers, we may assume by i that WLOG these four numbers are 1; 2; 1; 2 in that order, and that the other four numbers are 3; 4; 3; 4. Then ii does not hold. If they consist of three distinct integers, by i and ii we may assume WLOG that these four numbers are a 1; 2; 3; 1 or b 1; 2; 1; 3 or c 1; 2; 3; 2, in these orders. By reversing the order, c reduces to b. Next consider a. If the next number is 2, then by ii we have 1; 2; 3; 1; 2; 3, and the two 4s are adjacent, contradicting i. If the next number is 3, reversing the order to obtain 3; 1; 3; 2; 1 reduces it to b. Finally consider b. By i and ii the next number must be 2, followed by 3, so the two 4s are adjacent, contradicting ii. Next consider the following permutation for n 4:

2131.

4; 5; : : : ; n; 1; 2; 3; 2; 3; 4; 5; : : : ; n:

Clearly, i is satis ed. ii follows from the fact that there does not exist a set of four consecutive terms which is a permutation of 1; 2; 3; 4. In conclusion, the answer is: n 4.

181 Also solved by HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; and DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA. There was one incomplete solution. 1996: 124 Proposed by Sefket Arslanagi c, Berlin, Germany. Let n be an even number and z a complex number. Prove that the polynomial P z = z + 1n , z n , n is not divisible by z2 + z + n. I. Solution by Richard I. Hess, Rancho Palos Verdes, California, USA. Let Qz = z 2 + z + n. For n = 0 or 1, we have that P z = 0, which is clearly divisible by Qz . For any n 1, suppose that P z is divisible by Qz . Then Qn divides P n. But Qn = nn +2 0 mod n, while P n = n +1n , n2 , n 1 mod n. Thus P z is not divisible by Qz . II. Composite solution by F.J. Flanigan, San Jose State University, San Jose, California, USA and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. Let Dz = z 2 + z + n. If n = 0; 1, then P z = 0, which is divisible by Dz . If n = 2, then P z = 2z , 1, which is clearly not divisible by z2 + z + 2. For n 2, suppose that Dz divides P z . Then, since Dz is monic, P z = QzDz, where Qz is a polynomial of degree n , 3 with integer coe cients. Thus P 0 = Q0D0, or 1 , n = nQ0, which is clearly impossible. III. Solution and generalization by Heinz-Jurgen Sei ert, Berlin, Germany. Let n 2 be an even integer. We shall prove that if a, b, c, are complex numbers such that a 6= 0, then the polynomial

2132.

The proposer's result, which does not hold for n = 0, is obtained when a = c = n and b = 1. Let z1 and z2 denote the not necessarily distinct roots of z 2 + bz + c. n n n n The z1 + z2 = ,b, so that P z1 = z2 , z1 , a, and P z2 = z1 , z2 , a. Since P z1 + P z2 = ,2a = 0, our result follows. 6 6 , z 6 = z 2 + z + 16z 3 + 9z 2 + 5z + 1 shows The example z + 1 that the condition a = 0 cannot be dropped. 6

182 Also solved by: CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; KEE-WAI LAU, Hong Kong; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; NORVALD MIDTTUN two solutions, Royal Norwegian Naval Academy, Norway; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; and the proposer. Besides the solvers listed in Solutions I and II above, only Janous observed and showed that the assertion holds for all n 2. 1996: 124 Proposed by Waldemar Pompe, student, University of Warsaw, Poland. Let fxn g be an increasing sequence of positive integers such that the sequence fxn+1 , xn g is bounded. Prove or disprove that, for each integer m 3, there exist positive integers k1 k2 : : : km , such that xk1 ; xk2 ; : : : ; xkm are in arithmetic progression. Solution by David R. Stone, Georgia Southern University, Statesboro, Georgia, USA, and Carl Pomerance, University of Georgia, Athens, Georgia, USA. An old and well-known result of van der Waerden 4 is that if the natural numbers are partitioned into two subsets, then one of the subsets has arbitrarily long arithmetic progressions. It is not very di cult to show 1 that van der Waerden's theorem has the following equivalent formulation: for every number B and positive integer m, there is a number W m; B such that if n W m;B and 0 a1 a2 : : : an are integers with each ai+1 , ai B, then m of the ai's form an arithmetic progression. Thus, for the problem as stated, if we let B be the bound on the di erences xn+1 , xn , then for any given m 3, there exists a W m; B with the property stated above. Then, for any n W m; B , any nite subsequence of length n will have an arithmetic progression of length m as a sub-subsequence. That is, the original sequence contains in nitely many arithmetic progressions of length m. In 1975, Sz meredi 3 proved a conjecture of Erdos and Tur n which ime a proves on van der Waerden's Theorem, relaxing the condition that the sequence's di erences have a uniform upper bound, requiring only that the sequence have a positive upper density. Hence the problem posed here also follows from the theorem of Sz meredi, who, we believe, received for this e result the highest cash prize ever awarded by P l Erdos | $1,000. a

2134?.

183 Comment by the solvers. Do we know how Pompe became interested in this problem?

References

1 T.C. Brown, Variations on van der Waerden's and Ramsey's theorems, Amer. Math. Monthly 82 1975, 993 995. 2 Carl Pomerance, Collinear subsets of lattice point sequences | an analog of Szemeredi's Theorem, J. Combin. Theory 28 1980, 140 149. 3 E. Szemeredi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 1975, 199 245. 4 B.L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw. Arch. Wisk. 15 1928, 212 216. Also solved by THOMAS LEONG, Staten Island, NY, USA; and JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; both using van der Waerden's theorem or its variation. Leong gave the reference: Ramsey Theory by R.L. Graham, B.L. Rothschild and J.H. Spencer. Schlosberg remarked that van der Waerden's theorem was discussed in the July 1990 issue of Scienti c American. The proposer showed that van der Waerden's theorem follows easily from the statement of his problem. His intention and hope was to nd a proof independent of van der Waerden's theorem. This would establish a new proof" of the latter. In view of his comment and the solution above, it should be obvious that the two statements are equivalent, and hence such a proof is unlikely.

n Gomez Rey, IES Luis Bu~ uel, n Alcorc Madrid, Spain. on, Let n be a positive integer. Find the value of the sum

bn=2c X

k=1

Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Modied slightly by the editor. Let Sn denote the given summation. Note that S1 an empty" sum, is 2n . which we shall de ne to be zero. We prove that Sn = ,

n+2 Since 3 = 0, this is true for n = 1. Assume that n 2. Follow ing standard convention, for k = 0, 1, 2, : : : , let xk f x denote the

184 coe cient of xk in the series expansion of the function f x. Let

P x = ,1 , x2n+1 1 , x,n+1: Then, by the binomial expansion, itsgeneralization by Newton, and the ,n
k
well-known fact that = ,1k n + k , 1 , we have: k x2k+2

,1 , x2n+1 = h,x2k+1i

,1 , x2n+1
k+1 n + 1 ; = ,1 k+1 for k = ,1; 0; 1; 2; : : : , and xn,2k

1 , x,n+1 = ,1n,2k,n , 1
2n , 2k
n , 2k = n , 2k for k n=2. Hence xn+2 P x = x2k+2 xn,2k P x + 1
n , k
bn=2c X = ,1k+1 n + 1 2n , 22k : k k=,1 On the other hand, since P x = 1 + xn+1 , we have xn+2 P x = 0. Therefore + 1
n ,
bn=2c X ,1k+1 n + 1 2n , 22kk = 0: k k=,1 Since X 1 bn=2c,1k+1n + 1
2n , 2k
; Sn = , n + 1 k + 1 n , 2k k=1

we get

n n + 1 Sn = , n + 1 n + 1 2n , n + 1 2n + 22 1 0 2n + 2! , 2n! = n + 1n + 2!n! n!n! , = f22n + 1n +n +n2n + 1g 2n! 2! ! n , 1 = ,nn + 2!2!n! = n +,2n! 2! 2!n , 2n n = , n+2 :

185 Also solved by WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; HEINZ-JURGEN SEIFFERT, Berlin, Germany; and the proposer. The correct answer, without a proof, was sent in by RICHARD I. HESS, Rancho Palos Verdes, California, USA. If, in the given summation, one lets k start from zero this was, in fact, the proposer's original idea, then it is easy to see that the answer becomes the n + 1 th Catalan number. tario.

1 2n + 2 ; n+2 n+1

2136.

Let a; b; c be the lengths of the sides of a triangle. Given the values of p = P a and q = P ab, prove that r = abc can be estimated with an error of at most r=26. Solution by P. Penning, Delft, the Netherlands. Scale the triangle down by a factor a + b + c. The value of p then beq r comes 1, the value of q becomes Q = 2 , and R = 3.

a + b and v = a , b : Introduce s =

2 2

a + b + c

a + b + c

Since a, b, c, represent the sides of a triangle, we must require 0 c a + b and , c a , b c: Ed: in other words, the triangle is not degenerate | a case which must be discarded as inappropriate. This translates to Lines of constant Q are ellipses in the s v plane, with centre s = 1 , v = 0. 3 So we write: p 1

1 4

s 1 2

and

1 jvj 2 , s:

s = + A cosx; v = 3A sinx; p1 , 3Q 3 with A = replacing Q. 3 Very symmetrical expressions are now obtained for a, b, c: 1 a = 3 ,2A cos120 +x; b = 1 ,2A cos120 ,x; c = 1 ,2A cosx: 3 3

186

1 R is maximal for x = 60 provided that a 1 , A 12 : 2 1 1 For 12 A 1 , we have cos120 + xmax = , 12A , since the maximum of 6 a is 1 . So 2

1 Rmin = 27 , A2 , 2A3:

1 Rmax = 27 , A2 + 2A3:

The minimum in F is also at A = 1 and yields the same value for Fmin = 26. 6 Also solved by NIELS BEJLEGAARD, Stavanger, Norway; and the proposer. One incorrect submission was received in that the sender assumed that a degenerate triangle disproved the proposition.

2 1 3 1 Rmax = 27 , A2 , 2A3 , 124 3 + 12A = 24 , 3A : A 2 We must determine the reciprocal of the relative spread in R: + F = Rmax , Rmin : Rmax Rmin 1 For A 12 , we have 1 2 F = 272, 3A : A 1 , so that Fmin = 26. The minimum in F is reached at A = 12 1 For 12 A 1 , both Rmax and Rmin are zero for A = 1 . So 6 6 1 2 4A Rmin = 6 , A 9 + 3 + 2A2 ; Rmax = 1 , A 1 +46A : 6

187

2137. 1996: 124, 317; 1997: 48 Proposed by Aram A. Yagubyants, Rostov na Donu, Russia. Three circles of equal radius t pass through a point T , and are each inside triangle ABC and tangent to two of its sides. Prove that:

ii T lies on the line segment joining the centres of the circumcircle and the incircle of 4ABC . Solution by Gottfried Perz, Pestalozzigymnasium, Graz, Austria.

C

r

i t =

rR , R+r

We denote the centres of the three circles by X , Y and Z . Since the three circles pass through a common point T and have equal radius t, it follows that X , Y and Z lie on the circle with centre T and radius t. Z Since each of the circles is tangent to two sides of 4ABC , it follows that T X , Y and Z lie on the internal bisecI tors of A, B and C . Since AB is a common tangent of two intersectX Y ing circles with radius t, it follows A B that AB kXY , and analogously, we have Y Z kBC and ZX kAC . This implies that the lines AX , BY and CZ are bisectors of the angles of 4XY Z as well, and so 4ABC and 4XY Z have the same incentre I . Thus we conclude that triangles 4ABC and 4XY Z are homothetic with I as centre of similitude. This implies that: i the ratio of the radii of the circumcircles of 4ABC and 4XY Z equals the ratio of the radii of the incircles of the triangles; that is

r r r r r r r

R : t = r : r , t tR + r = Rr

ii as corresponding points in the homothety, T the circumcentre of 4XY Z and the circumcentre of 4ABC lie collinear with I , as desired. Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; NIELS BEJLEGAARD, Stavanger, Norway; FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; HAN PING DAVIN CHOR, student, Cambridge, MA, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Aus tria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA;

Rr , Rt = rt t = RRr r ; +

188 P. PENNING, Delft, the Netherlands; TOSHIO SEIMIYA, Kawasaki, Japan; D.J. SMEENK, Zaltbommel, the Netherlands; PAUL YIU, Florida Atlantic University, Boca Raton, Florida, USA; and the proposer. Janous has seen both parts of the problem before; although unable to provide a reference to part i, he reconstructed the argument that he had seen, which was much like our featured solution. He, among several others, noted that ii is essentially problem 5 of the 1981 IMO 1981: 223 , solution on pp. 35 36 of M.S. Klamkin, International Mathematical Olympiads 1979 1985, MAA, 1986. See also the generalization" 694 1982: 314 and the related problem 1808 1993: 299 .

vY 2 u 3 3u cos AB ,2C ABC : t cyclic sin sin A For this, we rst represent A0 B 0 C 0 as a function of A, B , C and R the circumradius. We have: AOB = 2C , so that C BOA0 = 180 , 2C and BA0O = BCO = 90 , A. Both angles subtend the line BO on A0 circle BOC ! Thus, A0BO = 180 , 180 , 2C , 90 , A O = A + 2C , 90 = 180 , B + C , 90 A B = 90 , B , C :

A0 B0C 0

2138. 1996: 169 Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. ABC is an acute angle triangle with circumcentre O. AO meets the circle BOC again at A0 , BO meets the circle COA again at B 0 , and CO meets the circle AOB again at C 0 . Prove that A0 B 0 C 0 4 ABC , where XY Z denotes the area of triangle XY Z . Solution by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. There is an even sharper inequality:

189 Similarly, jOB 0 j = and jOC 0 j = cos B cos C . Now, since A0 OB 0 = AOB = 2C , we get, via the trigonometric area formula of triangles, that

R cosC , A

R cosA , B

A0 B0O = 1 jOA0 j jOB0j sin A0OB0 2 2 , cosC = R cosB cosC cos B , A sin 2C; 2 A and similarly for B 0 C 0 O and C 0 A0 O . Thus A0 B0C 0 = 0 0B0 O + B0 C 0O + C 0A0 O A 1 2 X cosC , A cosC , B = @ sin2C A R : 1 cos A cos B 2 cyclic

Next, we recall the formula

ABC = 2R2

Y

cyclic

sin A

2

X cosC , A cosC , B sin2C cos A cos B cyclic 2 3
3 1 Y cos2B , C 5 4 3 cos2 A sin 2A cyclic 2 31 3 Y cos2B , C 4 5 = 6 cos A sin A cyclic 2 31 Y cos2B , C 5 3 Y = 64 sin A 2 cyclic sin A cos A cyclic 2 31 3 2 4 Y cos B , C 5 Y sin A; = 12 sin A sin 2A

cyclic cyclic

which is valid for all triangles but interesting only for acute triangles with equality if and only if A = B = C = 60 , or the degenerate cases with two of A, B , C being right angles. This immediately yields

and the original inequality follows. Also solved by D.J. SMEENK, Zaltbommel, the Netherlands.

2139. 1996: 169, 219 Proposed by Waldemar Pompe, student, University of Warsaw, Poland. Point P lies inside triangle ABC . Let D, E , F be the orthogonal projections from P onto the lines BC , CA, AB , respectively. Let O0 and R0 denote the circumcentre and circumradius of the triangle DEF , respectively. Prove that q

Solution by the proposer. Let C denote the circumcircle of DEF . Let P 0 be the symmetric point to P with respect to O0 . Let E be the ellipse with foci P and P 0 tangent internally to C . The diameter of the ellipse E is 2R0 , and its area is equal q to R0 R0 2 , O0 P 2 . Since the locus of the orthogonal projections from P onto tangents to the ellipse E is the circle C, the sides of ABC must be tangent to E . Thus E is inscribed in the triangle ABC . Let L be an a ne mapping which takes E to some circle of radius R, and let it take the triangle ABC to the triangle A0 B0C 0. Since L preserves the ratio of areas, we obtain

1

since among all triangles circumscribed about the given circle, the one of smallest area is the equilateral triangle. Thus 1 is equivalent to the desired inequality, so we are done.

191 Remarks: The same proof works also for an n-gon which has an interior point whose projections onto the sides of the n-gon are concyclic. The analogous inequality will be

q A1 : : : An n tan R0 R0 2 , O0P 2 : n Note that as a special case, when the n-gon has the incircle and P = O0 we obtain the well-known result that among all n-gons circumscribed about a

given circle, the one of smallest area is the regular one, though it is used in the proof. 1996: 169 Proposed by K.R.S. Sastry, Dodballapur, India. Determine the quartic f x = x4 + ax3 + bx2 + cx , c if it shares two distinct integral zeros with its derivative f 0x and abc 6= 0. Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let the zeros of f x be the integers p and q ; without loss of generality p q. It is a well-known theorem that if a polynomial Qx divides the polynomial P x as well as the derivative P 0 x, then Qx2 divides P x. Applying the theorem for this problem, we obtain

2140.

f x = x , p2x , q2 = x4 + axx + bx2 + cx , c: Comparing coe cients of x and the constant term yields 0 = c + ,c = ,2p + q pq + p2 q 2: As pq = 0 implies abc = 0, we may divide by pq pq , 2p , 2q = 0 p , 2q , 2 = 4 = 4 1 = ,1,4 Hence p; q = 6; 3 _ 1; ,2 since p = q and the two possible polyno6

mials are

f1x = x , 62x , 32 = x4 , 18x3 + 117x2 , 324x + 324; f2x = x + 22x , 12 = x4 + 2x3 , 3x2x + 4: 4

Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut,USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; WALTHER JANOUS,
Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State

192 University, Big Rapids, Michigan, USA; BEATRIZ MARGOLIS, Paris, France; L. RICE, Woburn Collegiate, Scarborough, Ontario; HARRY SEDINGER, St. Bonaventure University, St. Bonaventure, NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; SKIDMORE COLLEGE PROBLEM GROUP, Saratoga Springs, New York, USA; DIGBY SMITH, Mount Royal College, Calgary, Alberta; and the proposer. There were eight incorrect or incomplete solutions.

Contributed by Juan-Bosco Romero M rquez, Universidad de Valladolid, Valladolid, Spain. a

Founding Editors R dacteurs-fondateurs: L opold Sauv & Frederick G.B. Maskell e e e Editors emeriti R dacteur-emeriti: G.W. Sands, R.E. Woodrow, Bruce L.R. Shawyer e Founding Editors R dacteurs-fondateurs: Patrick Surry & Ravi Vakil e Editors emeriti R dacteurs-emeriti: Philip Jong, Je Higham, e J.P. Grossman, Andre Chang, Naoki Sato, Cyrus Hsia

Crux Mathematicorum

Mathematical Mayhem

193

No. 11 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7

Christopher Small

Faculty of Mathematics University of Waterloo Waterloo, Ontario At the University of Waterloo, we recently held a new mathematics competition called the Bernoulli Trials. The Bernoulli Trials came about as the result of a brainstorming session between Ian Goulden, Ken Davidson and myself. We felt that a winter competition was most desirable, and that it had to be fundamentally di erent from the competitions that the University of Waterloo holds in the Fall. So we decided to hold a double-knockout competition with true" and false" as the response categories for each round of the competition. Students registered ahead of time so that we had an idea of the attendance gures. This gave us a chance to draw up a master list of participants, which we put on a transparency for the overhead projector. As the rounds of the competition progressed, the students were able to see their results posted on one of the screens. Students were given a supplyof ballots" on which to place their votes" for each round. At the beginning of each round, we posted a mathematical conjecture on the overhead projector. Ten minutes were allotted to working on each conjecture, and at the end of that time all students had to submit a completed, signed ballot with a true" or false" response. When all ballots were in, we announced the correct answer and a hint for solving the problem. There was no time for a full solution during the competition. The next ve minutes were used to record the ballots. During this time, the students were able to stretch or chat about the problem and help themselves to food provided at the back of the room. Then it was on to the next round and the next conjecture. The double-knockout format meant that everyone had a chance

194 to make one mistake without being eliminated from the competition. Those who were eliminated at any stage were encouraged to stay and cheer on the remaining students. In order to make the event work, we needed to have many more questions available than we actually used. The questions varied from quite easy to extremely di cult. Our plan was to adjust the level of di culty based upon the performance of the students. The hope was that in the early stages we could keep the students interested without knocking them out too quickly. Over all, we were quite satis ed with the results. The competition started shortly after 9:00 a.m., and were nished for a late lunch around 1:00 p.m. There were 24 students participating. The nal two participants, rst year students, Richard Hoshino and Soroosh Yazdani, who both lasted a full 15 rounds, were declared co-winners of the competition. Tied for third and fourth place were Kevin Hare and Fr d ric Latour, who lasted 11 rounds. In e e fth place was David Kennedy, who lasted 10 rounds. The prizes were given on the spot at the end of the competition. In keeping with the name Bernoulli Trials, the prizes were handed out on the spot at the end of the competition in batches of 100 coins each: quarters for third, fourth and fth places, loonies for second place, and toonies for rst. In a spirit of generosity, Richard Hoshino and Soroosh Yazdani invited everyone to lunch with the prize money they had earned.

True or False? 1. The point

is outside the closed curve x = 1 + 5 cos ; y = ,1 + 5 sin , where 2 0; 2. 2. Let p and q be real numbers with p,1 , q ,1 = 1 and 0 p 1=2. Then

1 p + 1 p2 + 3 p3 + ::: = q , 1 q2 + 1 q3 , 1 q4 + ::: 2 2 3 4 3. There are at least two positive integers n for which 2n , 1 and 2n + 1

are primes. 4. When expressed in the decimal system, 1000! ends in exactly 249 zeros. That is, 1000! has the form n 10249, where n is not divisible by 10.

195 5. For any set M R3 , there exists a plane R3 such that either M has in nitely many points or M is empty. 6. Suppose Johann Bernoulli tosses 1997 fair coins and Jakob Bernoulli tosses 1996 fair coins. The probability that Johann has more heads than Jakob is more than 1=2. 7. Let xp be de ned by x1 = x and xp+1 = xx p . Then limx!0+ x1997 = 1. 8. If the elementary symmetric functions of a set of real numbers are all positive, then the real numbers themselves must be positive. 9. Let a; b; c 0. Then ab + ac + bc 2a + c , b. c b a 10. There does not exist a Fibonacci number with a decimal representation ending in four zeros. 11. 25

k 325 = 651 2 +1 k=1 k + k 12. There exists a unique pair of positive integers n; m with n m such that 1997 = n2 + m2 . 13. Z =2 x dx 1 1 + sin x = p2 0 px , px = px , px has exactly three solutions in 14. The equation nonnegative real x. 15. For some a 0, let f : R ! R satisfy p f x + a = 1 + f x , f x 2 2

4

7 5 3

In the next issue, we will give the hints and the answers!

196

No. 182 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. For your problem solving pleasure over the next few weeks, we give three contests which were collected and forwarded to us by Richard Nowakowski, when he was Canadian Team Leader to the IMO in Hong Kong.

November 20

Final

z | A B C DE F G H I J K 3. Assume that a and b are integers. Prove that the equation a2 + b2 + 2 = y 2 has an integer solution x, y if and only if the product ab is even. x 4. To each pair of real numbers a and b, where a = 0 and b = 0, there 6 6 is a real number a b such that a b c = a b c and a a = 1: Solve the equation x 36 = 216. 5. A triangle with perimeter 2p has the sides a, b and c. If possible, a new triangle with the sides p , a, p , b and p , c is formed. The process

is then repeated with the new triangle. For which original triangles can the process be repeated inde nitely? 6. Let a and b be real numbers and let f x = ax + b,1. For which a and b are there three distinct real numbers x1 , x2 , x3 such that f x1 = x2 , f x2 = x3 and f x3 = x1?

1. The integer x is such that the sum of the digits of 3x is the same as the sum of the digits of x. Prove that 9 is a factor of x. 2. A railway line is divided into 10 sections by the stations A, B, C , D, E, F , G, H , I , J and K . The distance between A and K is 56 km. A trip along two successive sections never exceeds 12 km. A trip along three successive sections is at least 17 km. What is the distance between B and G?

197

Second Round

September 1993

1. Suppose that V = f1; 2; 3; : : : ; 24; 25g. Prove that any subset of V with 17 or more elements contains at least two distinct numbers the product of which is the square of an integer. 2. Given is a triangle ABC , A = 90 . D is the midpoint of BC , F is the midpoint of AB , E the midpoint of AF and G the midpoint of FB . AD intersects CE, CF and CG respectively in P , Q and R. Determine the ratio P Q . QR C

R P Q A E F G B 3. A series of numbers is de ned as follows: u1 = a, u2 = b, un+1 = 1 un + un,1 for n 2. Prove that limn!1 un exists. Express the value 2 of the limit in terms of a and b. 4. In a plane V a circle C is given with centre M . P is a point not on the circle C . P

q q

q q qq q q qq

D

B M V

a Prove that for a xed point P , AP 2 + BP 2 is a constant for every diameter AB of the circle C . b Let AB be any diameter of C and P a point on a xed sphere S not intersecting V . Determine the points P on S such that AP 2 + BP 2 is minimal. 5. P1; P2; : : : ; P11 are eleven distinct points on a line. PiPj 1 for every pair Pi, Pj . Prove that the sum of all 55 distances PiPj , 1 i j 11 is smaller than 30.

198

May 8 14, 1994 Time: 4.5 hours

1. Cyprus Given an acute angle XAY and a point P in its interior, construct a straight line through P and intersecting the sides AX and AY at the points B and C respectively, so that the triangle ABC has area equal to AP 2. Success rate: 26:66 2.

Greece Show that the polynomial has at most one integral root. 3. Romania Compute for n 2

8 n,1 X

4. Bulgaria Find the smallest number n of n people with the following properties: i any two people who know each other have no common acquaintances; ii any two people who do not know each other have exactly two common acquaintances. Note: Acquaintance is a symmetric relation. Success rate: 19 OVERALL SUCCESS RATE: 28:83; Number of Students: 30, Mean: 11:33, Median: 7:5, S.D.: 12:3.

Recently I made time to clean o my desktop and sort a backlog of paper that piled up over the last year while I was on secondment to a university committee and only in my o ce for a short time each week. There appeared a small cache of solutions to problems from the 1995 numbers of the Corner which I had put down in haste and in error, letting them become covered by other layers of incoming material. Let me try to set the record straight by acknowledging the readers' e orts now. My sincere apologies! Miguel Amengual Covas, Cala Figuera, Spain, submitted solutions to problem 2 of Part I of the Turkish Mathematical Olympiad Committee Final Selection Test, for which a solution was given in the December 1996 number

199 1996: 349 350 , and to problem 2 of part II of that test, for which a solution was given 1996: 352 353 . Mansur Boase, student, St. Paul's School, London, England, submitted solutions to problems 1 and 2 of Part I of the Turkish Mathematical Olympiad Final Selection Test, for which solutions were given 1996: 349 350 , 1996: 349 350 and for questions 1 and 3 of Part II, for which solutions were given 1996: 351 352 , 1996: 353-354 . In another submission he gave answers to problems 1, 2 and 4 of the 1992 Dutch Mathematical Olympiad, for which solutions were given 1997: 13 , 1997: 13 14 and 1997: 15 17 , respectively. In a third letter he provided solutions to four problems of the 16th Austrian-Polish Mathematics Competition. Two solutions of these appeared earlier this year: problem 1 in 1997: 71 72 and problem 6 in 1997: 72 73 . In yet a fourth letter he gave solutions to three of the problems proposed to the jury of the 35th IMO but not used. A solution to number 3 was given in 1997: 135 . Finally a fat envelope of solutions by George L. Evagelopoulos to problems proposed but not used at the 35th IMO appeared. Below we give some of the solutions submitted by Mansur Boase but missed before. First back to problems of the 2nd Mathematical Olympiad of the Republic of China. 1. 1995: 80 2nd Mathematical Olympiad of the Republic of China. A sequence fan g of positive integers is de ned by an = n + pn + 1=2 , n 2 N, where N is the set of all positive integers. Determine the positive integers which belong to the sequence. Solution by Mansur Boase, student, St. Paul's School, London, England. p Now an = n + pn + 1 , and an+1 = n + 1 + n + 1 + 1 so 2 2

1 = a2 + 2a a +a+ a +a+ 2 p2 1 = a2 + 2a + 2: 2 a +a+1+ a +a+1+ 2 Thus the only numbers left out are of the form a2 + 2a + 1 = a + 12; that

2

and an+1 , an = 1 otherwise. For an+1 , an = 2 we have n + 1 a2 + a + 1 and n a2 + a + 1 , 4 4 p since for a 2, a2 , 1 6 a , 1 . Thus n + 1 = a2 + a + 1. Now 2

is, the squares. Thus all positive non-squares belong to the sequence.

200 Now to problems given in the September number. 3. 1995: 221 16th Austrian Polish Mathematical Competition. Let the function f be de ned as follows: If n = pk 1 is a power of a prime number p, then f n := n + 1. If n = pk pkr r 1 is a product of powers of pairwise di erent 1 r prime numbers, then f n := pk + + pkr . 1 r For every m 1 we construct the sequence fa0 ; a1 ; : : : g such that a0 = m and aj +1 = f aj for j 0. We denote by g m the smallest element of this sequence. Determine the value of g m for all m 1. Solution by Mansur Boase, student, St. Paul's School, London, England. It is evident that g 2 = 2, g 3 = 3, g 4 = 4, g 5 = 5, g 6 = 6, g7 = 7. Lemma. For m 6, g m 6. Proof. Consider m 6, and its associated sequence.

1 1

6 = 1 + 5 = 2 + 4: Now 2+4 is not permissible since 2; 4 6= 1, and the only way 6 can be part of the sequence is if 5 occurs earlier. 5 = 1 + 4 = 2 + 3: So 5 is only part of the sequence if 4 or 6 occur earlier. 4 = 1 + 3 = 2 + 2; so 4 is part of the sequence only if 3 occurs earlier. 3 = 1 + 2; so 3 is part of the sequence only if 2 occurs earlier, which is impossible with a0 6. Consider the next several values of g m. By calculation g 8 = 7 = g9 = g10 = g11 = g12 = g13 = g14 = g15 = g16. We next prove by induction that if m 16 then g m = 7. We may assume m 16. Observe that at least one of m, m + 1, m + 2, m + 3, m + 4, m + 5 is not a power of a prime because it is congruent to 0 mod 6. Letting n be the rst value which is not a power of a prime m n m + 5. The result follows immediately from the following since g m g n f n.

201

Lemma. Suppose n 16 is not a power of a prime. Then f n n , 5. Proof. Write n = ab with 1 a b and a; b = 1. Then b 5. Now

a + b ab , 5 is equivalent to 1 + a + 5 a which is immediate unless a = 2 because b b a 1, 5 1. But if a = 2 then b 8 as ab 16 and b b 2 1 + a + 5 1 + 8 + 5 2: b b 8 The weaker inequality a + b ab for 1 a b is immediate. It follows that f n a + b ab , 5 if n 16.

This completes the proof. 4. 1995: 221 16th Austrian Polish Mathematical Competition. The Fibonacci numbers are de ned by F0 = F1 = 1 and Fn+2 = Fn+1 + F93 for n 019 Let A and B be natural numbers such that A19 . n divides B and also B divides A93 . Prove: for all natural numbers n 1 the number A4 + B 8 Fn is divisible by AB Fn . Solution by Mansur Boase, student, St. Paul's School, London, England. Now A19 j B 93 and B 19 j A93 . Thus any prime, p, which divides A must divide B , and vice versa. Also if p j A then p 93=19 is the largest power of p which can divide B and vice versa. First we must prove that AB j A4 + B82: 1 Let

+1 1 1

Consider

A = p1 p2 : : : pnn ; B = p1 p2 : : : pnn :

1 2 1 2 1 1

Next we argue that

p1

1+ 1 1 1 1 1

AB2 j A4 + B83 = A12 + B 24 + a multiple of AB 2: So we must prove that AB 2 j A12 + B 24 ; that is p2 +2 j p12 + p24 : 1 1 1

1 1 1 1

2

202

Again because of , 2 1 + 2 1 2 1 + 25 1 = 12 1 and 2 24 1. Thus 2 holds. We have therefore proved the assertion for n = 1 and n = 2. Assume for a proof by induction that

+1

+1

+2 +1 +1 +

+2

Fk+2 ;

AB Fk j A4 + B 8Fk : Thus the statement is true for n = k + 2. The result follows by induction.

+3

We conclude this catch-up" part of the Corner with two solutions to problems posed to the jury but not used at the 35th IMO. 1. 1995: 299 Problems Proposed But Not Used, 35th IMO in Hong Kong, Selected Problems M is a subset of f1; 2; 3; : : : ; 15g such that the product of any three distinct elements of M is not a square. Determine the maximum number of elements in M . Solution by Mansur Boase, student, St. Paul's School, London, England. Let n denote the maximum number of elements in such a subset M . It is easy to check that there are no three elements in the following subset whose product is a square Hence n 10. We shall prove that n 10 is impossible. We split the problem into three cases: i 2 2 M ; ii 2 62 M , 3 62 M ; iii 2 62 M , 3 2 M . Case i. 2 2 M . We now list x; y , x; y 6= 2, 1 x y 15 such that 2xy is a perfect square and hence we cannot have x 2 M and y 2 M :

1; 8; 3; 6; 4; 8; 5; 10; 6; 12; 7; 14 8; 9: In order to have n 10 we can have at most one of 5 or 10 and one of 7 or 14. Thus 8 62 M . Now it follows that 6 62 M as well. To have n 11 we require 1; 4; 9 2 M but 1 4 9 = 36 = 62, a contradiction.

203

Case ii. 2 62 M , 3 62 M . One member from each of the following triples could not belong to M :

Thus n 10. Case iii. 2 62 M , 3 2 M . Each of the following triples must contain a number which does not belong to M :

3; 1; 12; 3; 4; 12; 3; 9; 12; 3; 6; 8; 3; 5; 15; 1; 4; 9: We must have 12 62 M , one of 6 or 8 2 M , 5 62 M or 15 62 M and 1 or 4 = or 9 62 M . But as 2 62 M we have at least 5 elements which do not belong. Thus n = 10. 6. 1995: 335 Problems Proposed But Not Used, 35th IMO in Hong

Kong, More Selected Problems N is an arbitrary point on the bisector of BAC . P and O are points on the lines AB and AN , respectively, such that ANP = 90 = APO. Q is an arbitrary point on NP , and an arbitrary line through Q meets the lines AB and AC at E and F respectively. Prove that OQE = 90 if and only if QE = QF . Solutions by Mansur Boase, student, St. Paul's School, London, England; and by George Evagelopoulos, Athens, Greece. We give the o cial" solution which is very similar to that of Evagelopoulos. First assume that OQE = 90 . Extend PN to meet AC at R. Now OEPQ and ORFQ are cyclic quadrilaterals. Hence OEQ = OPQ = ORQ = OFQ. It now follows that we have 4OEQ 4OFQ and QE = QF . A

E B O C Now suppose that OQE 6= 90 . Let the perpendicular through O to EF meet NP at Q0 6= Q. Draw the 0line through Q0 parallel to EF , meeting the lines AB and AC at E 0 and F , respectively. Then Q0 E 0 = Q0 F 0 as before. Let AQ0 meet EF at M 6= Q. Then ME = MF so that QE 6= QF . It follows that if QE = QF , then OQE = 90 . See next page for the diagram.

q q q q q q

F Q N

204

E0 B

q q qq q q q q q

A FF 0 E P Q M Q0 N O

To conclude this number of the Olympiad Corner we give solutions by the readers to problems given in the February 1996 number with the National Round of the 29th Spanish Mathematical Olympiad, 1992 1996: 22 23 .

1. At a party there are 201 people of ve di erent nationalities. In each group of six, at least two people have the same age. Show that there are at least ve people of the same country, of the same age and of the same sex. Solutions by Mansur Boase, student, St. Paul's School, London, England; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; and by Derek Kisman, student, Queen Elizabeth High School, Calgary, Alberta. We give Boase's solution. By the Pigeonhole Principle there are at least 41 of the same nationality and of these at least 21 must be of the same gender. Let these 21 ages be ai, 1 i 21. Consider a1 , a2 , a3 , a4 , a5 , a6 at least 2 must be equal. Without loss of generality, let a1 = a2 . Similarly with a3 ; a4 ; : : : ; a8 , without loss of generality, let a3 = a4 . Continuing as above we can go as far as a15 = a16 . The sequence now reads

a2a2a4 a4a6a6a8a8a10a10a12a12a14a14a16a16a17a18a19a20a21 Consider a2 a4 a6 a8 a10 a12 . Two must be equal. Without loss of generality, let a2 = a4 . Similarly we have from a6 ; : : : ; a16 we may assume that a6 = a8 . Now consider a2 a6 a10 a12 a14 a16 . If a2 = ai or a6 = ai for some other i then we have ve equal terms and we are done. Therefore we must have a pair equal among a10 , a12 , a14 , a16 ; without loss of generality, let a10 = a12 . The sequence now reads a2a2a2a2a6a6a6 a6a10a10a10a10a14a14a16a17a18a19a20a21:

205 If any ai , 17 i 21 is among a2 , a6 , a10 , we are done. Otherwise, consider a2 a6 a10 a14a16 x where x is any one of the last ve terms. Each x must be equal to a14 or a16 . Without loss of generality, let three of them be equal to a14 by the Pigeonhole Principle. This provides ve terms equal to a14 , and hence ve with the same age, gender and nationality.

1

in which each number equals the sum of the two above it, show that the last number is a multiple of 1993. Solutions by Mansur Boase, student, St. Paul's School, London, England; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Derek Kisman, student, Queen Elizabeth High School, Calgary, Alberta; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. First, we give Kisman's solution. Form a new triangle of numbers by adding each element of this triangle and its horizontally ipped reverse. It obeys the same addition rule as the original, and every element in the top row is 1993. Thus every element in the new triangle is a multiple of 1993. Let n be the last number in the new triangle. The last number of the original triangle is just n=2. Since it is an integer, it must also be a multiple of 1993. Next we give Wang and Yu's generalization. We show more generally that if the given row is 0; 1; 2; : : : ; n, where n is a natural number, then the last number in the triangle is n2n,1 and so it is a multiple of n. Note that the completed triangle will have n + 1 rows. If we denote the ith row by Ri then Ri contains n + 2 , i numbers, i = 1; 2; : : : ; n +1. Let Ri;j denote the j th number in Ri, j = 1; 2; : : : ; n+2, i. We show by induction on i that

Ri;j = i + 2j , 32i,2: This is the case when i = 1 since R1 = 0; 1; 2; : : : ; n implies R1;j = j , 1 and i + 2j , 32i,2 = 2j , 22,1 = j , 1. Suppose holds for some i 1. Then from the described construction, we have Ri+1;j = Ri;j + Ri;j+1 = i + 2j , 32i,2 + i + 2j , 12i,2 = 2i + 4j , 42i,2 = i + 1 + 2j , 32i+1,2 for j = 1; 2; : : : ; n + 1 , i, completing the induction. Letting i = n + 1 and j = 1 in we nd that the last number in the triangle is Rn+1;1 = n2n,1.

206

3. Show that in any triangle, the diameter of the incircle is not bigger than the circumradius. Solutions by Mansur Boase, student, St. Paul's School, London, England; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Wang's solution and remark. Let a, b, c, r, R and denote the side lengths, the inradius, the circumradius and the area of the given triangle, respectively. Then it is well abc where s = 1 a + b + c denotes the known that r = and R = s 4 2 semiperimeter of the triangle. Hence 2r R is equivalent to 82 sabc, which by virtue of Heron's formula

= ss , as , bs , c becomes 8s , as , bs , c abc; or b + c , ac + a , ba + b , c abc: 1 2 , b , c2 a2 , b2 , c , a2 b2 , and To show 1, note that a c2 , a , b2 c2. Multiplying, we obtain b + c , a2 c + a , b2a + b , c2 a2b2c2 : 2 Since b + c , a, c + a , b and a + b , c are all positive, 1 follows from 2

by taking the square roots of both sides. Clearly, equality holds if and only if a = b = c, that is, when the triangle is equilateral. Remark. This is a classical problem which has been known for at least 230 years. See, for example. x5.1 of Geometric Inequalities by O. Bottema et al. In fact, the inequality 8s , as , bs , c abc mentioned in the proof above can also be found in x1.3 of this book.

4. Show that each prime number p di erent from 2 and from 5 has an in nity of multiples which can be written as 1111 : : : 1. Solutions by Mansur Boase, student, St. Paul's School, London, England; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Derek Kisman, student, Queen Elizabeth High School, Calgary, Alberta; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Godin's solution. It su ces to show that, for each prime p other than 2 and 5, there exists a number n of the form 11 : : : 1, such that p j n. Since if p j 11 : : : 1 where the number is made up of k 1's, then p clearly divides all numbers of the form

11 : : : 1

N X

j =0

10kj

207 By Fermat's Little Theorem, 10p,1 1 mod p for all primes except 2 and 5. Thus p j 10p,1 , 1, but 10p,1 , 1 = 911 : : : 1. Thus for p 6= 2; 3; 5, p3 j 111 : : : 1, where there are p , 1 1's in the number. It is easy to check that 3 j 111 so we are done. 6. A game-machine has a screen in which the gure below is shown. At the beginning of the game, the ball is at the point S . With each impulse from the player, the ball moves up to one of the neighbouring circles, with the same probability for each. The game is over when one of the following events occurs: 1 The ball goes back to S , and the player loses. 2 The ball reaches G, and the player wins. Determine: a The probability for the player to win the game. b The mean time for each game.

Solutions by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; and by Derek Kisman, student, Queen Elizabeth High School, Calgary, Alberta. We give Kisman's solution. a From C or D any path to S has a corresponding exact opposite to G, so when at C or D the chance of winning is exactly 1=2. From S we must go to A where we have a 1=3 chance of losing and a 2=3 chance of going to C or D, where there is a 1=2 chance of winning. 2 So the probability is 3 1 = 1 . 2 3 b To nd the mean we sum the products of the number of moves and the probability of getting that number. The number of moves to win or lose is always even. For a given number of moves 2n, we can nd the probability of lasting exactly that long: 1 move is entering from S to A, probability 1 n , 1 moves are switching from A or B to C or D, probability 2 n , 1 moves are switching from C or D to A, or B, probability 31 1 move is moving from A to B or S or G, probability 1 . 3

A S

HHH HH

C D

bb bb b

B G

1 2 n,1 = 2 n 1 : 3 3 3 2

3

So the mean time is 6. That completes the issue of the Corner. Please send me your nice solutions along with your national and regional Olympiads.

209

BOOK REVIEWS

Edited by ANDY LIU

Cien Problemas de Matem
ticas: Combinatoria, Algebra, Geometr

a, a One Hundred Mathematics Problems: Combinatorics, Algebra, Geometry by Francisco Bellot Rosado and Mar

a Ascension Lopez Chamorro,
published by Instituto de Ciencias de la Educacion, Universidad de Valladolid,
ISBN 84-7762-405-4, 1994, softcover, 146+ pages. reviewed by Mar
a Falk de Losada.

There are very few problem-solving books written in Spanish and even fewer good problem-solving books written in other languages and translated into Spanish. One notable exception has been several Russian books published in Spanish by MIR. However, Francisco Bellot Rosado and Mar

a Ascension Lopez Chamorro have recently addressed that need with their book
Cien Problemas de Matem
ticas: Combinatoria, Algebra y Geometr

a and a they have selected their problems from several important sources. From the IMO, the OME Spanish Mathematics Olympiad and the OIM Olimpiada Iberoamericana de Matem
ticas there are both problems that have appeared a and also problems that were proposed but unused. From Mathesis and Gazeta Matematica we nd many classical problems that every interested problem-solver should know. From several other competitions and journals there is a wide-ranging selection of problems. These were, in general, unavailable to the Spanish-speaking student previously. Many of the solutions come from the authors themselves, while others are those given by Spanish participants in the IMO, OIM and still others come from a variety of sources. It is a truism that it is important for students working in the area of problem solving to develop con dence in themselves and their own abilities. For students from countries that do not have a time-honoured tradition in mathematics competitions and serious problemsolving, as is true in many Spanish-speaking countries, having access to solutions given by their own fellow students brings the possibility of success closer and helps to build such con dence.

210

Robert Geretschlager, Bundesrealgymnasium, Graz, Austria

Introduction

In the March 1997 of Crux 1997: 81 , I presented a theoretically precise method of folding a regular heptagon from a square of paper using origami methods in an article titled Folding the Regular Heptagon". The method was derived from results established in Euclidean Constructions and the Geometry of Origami" 2 , where it is shown that all geometric problems that can be reduced algebraically to cubic equations can be solved by elementary methods of origami. Speci cally, the corners of the regular heptagon were thought of as the solutions of the equation

z7 , 1 = 0

in the complex plane, and this equation was then found to lead to the cubic equation which was then discussed using methods of origami. Finally, a concrete method of folding the regular heptagon was presented, as derived from this discussion. In this article, I present a precise method of folding the regular nonagon from a square of paper, again as derived from results established in 2 . However, as we shall see, the sequence of foldingsused is quite di erent from that used for the regular heptagon. As for the heptagon, the folding method is once again presented in standard origami notation, and the mathematical section cross-referenced to the appropriate diagrams.

3 +

2 , 2

, 1 = 0;

Angle Trisection

For any regular n-gon, the angle under which each side appears as seen from the mid-point is 2n . Speci cally, for n = 9, the sides of a regular nonagon are seen from its mid-point under the angle 29 . As is well known, this angle cannot be constructed by Euclidean methods. Three times this angle or 23 can, however, and we note that it would be possible to construct a regular nonagon by Euclidean methods, if it were possible to trisect an arbitrary angle, or at least the speci c angle 23 . If this were the case, all that we would have to do would be to construct an equilateral triangle, trisect the angles from its mid-point to its corners, and intersect these with the triangle's circumcircle. Unfortunately however, as generations of mathematicians have been forced to accept although there are a few hold-outs still out there,

211 angle trisection by Euclidean methods of straight-edge and compass is impossible, as is the construction of a regular nonagon. The underlyingreason for the impossibility of angle trisection by Euclidean methods is the fact that straight-edge and compass constructions only allow the solution of problems that reduce algebraically to linear or quadratic equations. Angle trisection, however, involves the irreducible cubic equation which derives from the well established fact see for instance 1 that

x3 , 3 x , 1 cos 3 = 0; 4 4

cos 3 = 4 cos3 , 3 cos : For the speci c case at hand, where 3 = 23 , the cubic equation in question is x3 , 3 x + 1 = 0: 4 8

As shown in 2 , the solutions of this equation are the slopes of the common tangents of the parabolas p1 and p2 , whereby p1 is de ned by its focus and its directrix and p2 is de ned by its focus and its directrix

1 F1 , 16 ; , 3 8

1 `1 : x = , 16 ;

It is not too di cult to prove that this is indeed the case. Interested readers may like to try their hand at doing the necessary calculations themselves. Finding the common tangents of two parabolas de ned by their foci and directrices is quite straight-forward in origami, as it merely means making one fold, which places two speci c points the foci onto two speci c lines the corresponding directrices. By this method, we will therefore now show how to fold a regular nonagon.

`2 : y = , 1 : 2

F2 ,0; 1 2

As is usually the case in origami, we assume a square of paper to be given. We consider the edge-to-edge folds in step 1 as the x and y axes of a system of cartesian coordinates, and the edge-length of the given square as two units. The mid-point of the square is then the origin M 0; 0, and the end-points of the folds have the coordinates ,1; 0 and 1; 0, and 0; ,1 and 0; 1 respectively.

212 Steps 1 through 8 yield the foci and directrices of the parabolas discussed at the end of the second section of this article. The point C is the focus F1 of parabola p1 , B is the focus F2 of parabola p2 , and the creases onto which these two points are folded in step 9 are the directrices `1 and `2. Since the coordinates involved are all arrived at by halving certain line segments, it is quite easy to see that this is indeed the case. The fold made in step 9 is then a common tangent of the parabolas, and its slope is therefore cos 29 . This step, by the way, is the only one that cannot be replaced by Euclidean constructions. The point of steps 10 to 13 is then to nd the horizontal line represented by the equation y = , cos 29 . This is the horizontal fold through point E, as the distance between the vertical folds through points D and E is equal to 1. We then obtain corners 2 and 9 of the nonagon assuming the point with coordinates 0; ,1 to be corner 1 on this horizontal line by folding the unit length onto this line from mid-point M in step 14. Step 15 therefore yields the rst two sides of the nonagon, and steps 16 and 17 complete the fold, making use of both the radial symmetry of the gure, and its axial symmetry with respect to the vertical line M 1. Step 18, nally, shows us the completed regular nonagon.

The diagrams follow the bibliography.

Conclusion

In the conclusion of Folding the Regular Heptagon, I declared myself as an ardent Heptagonist. I have no qualms or reservations about declaring myself an equally ardent Nonagonist now. Perhaps I will nd some similar-minded folk out there willing to join me in my quest of popularizing these heretofore sadly neglected polygons.

References

1 B. Bold, Famous Problems of Geometry and How to Solve Them, Dover Publications, Inc., Mineola, NY 1969. 2 R. Geretschlager, Euclidean Constructionsand the Geometry of Origami, Mathematics Magazine, Vol. 68, No. 5 December 1995.

213

1.

2.

q

Fold and unfold twice.

Fold and unfold three times, making crease marks each time. nal crease yields point A.

3.

4.

214

5.

6.

7.

8.

B

Fold upper edge to crease, unfold, then fold lower edge to new crease, making crease mark at point C .

215

9.

10.

q q

C

Unfold everything.

11.

12.

Fold along crease and unfold, then fold vertically through point D.

216

13.

14.

q

16.

q

1

Fold through M such that point 1 lies on crease, unfold a repeat on other side points 1, 2, 9 are corners of the nonagon.

15.

q qq qq q

1

q

2

Fold back twice such that marked points come to lie on each other, resulting folds are sides of the nonagon.

217

17.

18.

Mountain fold lower layer using edges of upper layer as guide lines. Resulting folds are two more sides of the nonagon. Open up fold from step 16 and repeat steps 16 and 17 on left side, then fold through M and 2 once more. New folds are new guide lines. Repeating process completes the nonagon.

218

No. 22 R.E. Woodrow

We begin this number by giving the problems of the Twelfth W.J. Blundon Contest, which was written February 22, 1995. This contest is prepared at the Memorial University of Newfoundland and is sponsored by the Canadian Mathematical Society.

February 22, 1995 1. a From a group of boys and girls, 15 girls leave. There are then left two boys for each girl. After this, 45 boys leave. There are then 5 girls for

each boy. How many boys and how many girls were in the original group? b A certain number of students can be accommodated in a hostel. If two students share each room then two students will be left without a room. If 3 students share each room then two rooms will be left over. How many rooms are there? 2. How many pairs of positive integers x; y satisfy the equation

x + y = 1? 19 95

3. A book is to have 250 pages. How many times will the digit 2 be used in numbering the book? 4. Without using a calculator p p p p a Show that 7 + 48 + 7 , 48 is a rational number. b Determine the largest prime factor of 9919. 5. A circle is inscribed in a circular sector which is one sixth of a circle of radius 1, and is tangent to the three sides of the sector as shown. Calculate the radius of the inscribed circle. 6. Determine the units digit of the sum

219

x + y + x = 19 y xx + y = 60: y

every hour, and the other gains 3 seconds every 2 hours. In how many days will both clocks again indicate the correct time? Last issue we gave the 1995 Manitoba Mathematical Contest. Here are the solutions.

8. Find the number of di erent divisors of 10800. 9. Show that n , n is divisible by 12 for any positive integer n 1. 10. Two clocks now indicate the correct time. One gains a second

4 2

Wednesday, February 22, 1995 | Time: 2 hours

nd the value of a. Solution. a2 + ab = aa + b = a 3 = 7 so a = 7=3. b Noriko's average score on three tests was 84. Her score on the rst test was 90. Her score on the third test was 4 marks higher than her score on the second test. What was her score on the second test? Solution. 90+s+s+4 = 84 so 2s + 94 = 3 84 = 252, 2s = 158 and 3 the score on the second test was 79. 2. a Find two numbers which di er by 3 and whose squares di er by 63. Solution. Let the smaller number be x. The larger number is then x+3. Now jx + 32 , x2 j = 63. Thus jx2 + 6x + 9 , x2 j = 63 or j6x + 9j = 63. Now 6x + 9 = 63 OR 6x + 9 = ,63. Thus x = 7 OR x = ,8. b Find the real number which is a root of the equation: 27x , 13 + 8 = 0. Solution. 27x , 13 + 8 = 0 is equivalent to 3x , 13 = ,8 = ,2 . As ,8 has only one real cube root 3x , 1 = ,2 so x = 1=3.

3

2

220

3. a Two circles lying in the same plane have the same centre. The radius of the larger circle is twice the radius of the smaller circle. The area of the region between the two circles is 7. What is the area of the smaller circle? Solution. Let the radius of the smaller circle be r. Then the radius of the larger circle, R = 2r. The areas of the circles are r2 and R2 respectively. Thus the area of the region between them is

7; 7; 7; 7: 3 The area of the smaller circle is 7=3. = = = =

r

2r

b The area of a right triangle is 5. Also, the length of the hypotenuse of this triangle is 5. What are the lengths of the other two sides? Solution. Let the lengths of the two legs be x and 1 y2 with 2x y. Then 2 xy = 5 and x2 + , y = 5 = 25 from the formula for the area, and Pythagoras. So 2xy = 20 and 5 y x+ y2 = x2 + y 2 +2xy = 45, x, y 2 = p p 5, giving x + y = p 5, x , y = 5, so p5 and y = 3 5. The lengths of the x=2 p p other two sides are 5 and 2 5. x

a The parabola whose equation is 8y = x2 meets the parabola whose equation is x = y 2 at two points. What is the distance between these two points? Solution. For the intersection points 8y = x2 and x = y 2 giving 8y = y22 or y y3 , 8 = 0, so y = 0 and x = 0 OR y = 2 and x = 4pThe . p intersection points are 0; 0 and 4; 2. The distance is 42 + 22 = 2 5. b Solve the equation 3x3 + x2 , 12x , 4 = 0. Solution.

4.

The three solutions are x = ,2; ,1=3; 2.

221 a Find the real number a such that a4 , 15a2 , 16 = 0 and a + 4a , 25a , 100 = 0. Solution.

3 2

5.

Substituting these values in the other equation gives: for a = ,4; ,43 + 4,42 , 25 , 4 , 100 = 0; and a = ,4 is a solution; for a = 4; 43 + 442 , 254 , 100 = 138 , 200 6= 0: The only real solution is a = ,4. p b Find all positive numbers x such that xx x = xpxx . Solution. Now p p xx x = xpxx; so xx x = x3=2x = x x : Equating exponents:

3 2

since x

0.

2 3 xpx = 3 x; so px = 2 and x = 3 = 9 ; 2 2 4

xjyj , yjxjy jz j , z jy jxjz j , z jxj = 0:

Solution. Consider the left hand side. If any of x, y , z equal 0, say x then xjy j , y jxj = 0 , 0 = 0, and the equation holds. If none of x, y , z are zero then two must have the same sign. Without loss of generality we may consider the two cases x 0 and y 0 and x 0, y 0. If x; y 0 then xjy j , y jxj = xy , yx = 0. If x; y 0 then xjy j , y jxj = x,y , y ,x = ,xy + xy = 0. In any case the left hand side has one of the terms 0, so the product is 0 and the identity holds.

222

7. x and y are integers between 10 and 100. y is the number obtained by reversing the digits of x. If x2 , y 2 = 495 nd x and y . Solution. Let the digits of the numbers be a, b, with x = 10a + b and y = a + 10b so 9 a b 1. Now

x2 , y2 = 10a + b2 , a + 10b2 = 10a + b + a + 10b10a + b , a + 10b = 11a + b 9a , b = 99a2 , b2 = 495: Thus a2 , b2 = a + ba , b = 5 and a + b = 5, a , b = 1 so a = 3, b = 2. The numbers x and y are 32 and 23, respectively. 8. Three points P , Q and R lie on a circle. If PQ = 4 and PRQ =

60 what is the radius of the circle?

Solution.

r rr r

r

O M

Let the radius of the circle be denoted by r, and the centre O. Now POQ = 2 PRQ = 120 . Let the bisector of PQ be at M . Now OM ? MQ 1 POQ = 60 , so and MOQ =

9. Three points are located in the nite region between the x-axis and the graph of the equation 2x2 + 5y = 10. Prove that at least two of these points are within a distance 3 of each other. Solution. Considerp rectangles R1 , R2 with verthe p tices , 5; 2, , 5; 0,p ; 0, 0; 2 p5; 0, 0; 2 respec6; and 0; 2, 0; 0, 5 tively. Every point of the region lies in two boxes or both. p; ,p ; - one of theeach box is qp52 + 2The di-. 2 = 3 ameter of If three points in the region are given, two must lie in one of R1 or R2 by the Pigeonhole Principle and cannot be further than 3 units apart.

5 0

0 2

5 0

223

10. Three circles pass through the origin. The centre of the rst circle lies in the rst quadrant, the centre of the second circle lies in the second quadrant, and the centre of the third circle lies in the third quadrant. If P is any point that is inside all three circles, show that P lies in the second quadrant. Solution. The key is to consider the third circle. If its centre is in the third quadrant and it 6passes through the origin then the only point in common with the rst quadrant is the origin itself, so no point inside could be in the rst quadrant. Similarly no point inside the rst circle can be in the third quadrant and no point in the second circle lies in the fourth quadrant. The result is immediate.

That completes the Skoliad Corner for this issue. Please send me contest material, submissions, and suggestions for the future direction of this feature.

In the issue of Sports Illustrated dated March 10, 1997, we nd a long article about the coach of the University of Kansas Men's Basketball Coach. We quote: Williams is straighter than an Arrow shirt, so square that he's divisible by four, and cornier than a corncob pipe. Pity that the writer could not even get this little bit of math right!

224

MATHEMATICAL MAYHEM

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, University of Toronto, Toronto, ON Canada M5S 1A1. The electronic address is mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

Almost everyone is familiar with the Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, : : : , where the rst two terms are 0, 1, and each subsequent term

Fibonacci Residues

is the sum of the previous two terms. This sequence, for those who don't know it, is very important and comes up in many problems and solutions unexpectedly. Now consider each term of the sequence modulo 2. We obtain the sequence 0, 1, 1, 0, 1, 1, : : : . This is not very interesting, as we know that the only values of integers modulo 2 are 0 and 1, so we expect something like this which eventually repeats. Notice that the sequence that repeats namely 0, 1, 1 has three terms, and that the pairs 0; 1, 1; 0, and 1; 1 appear in the sequence, but the pair 0; 0 does not. Likewise, if we consider the sequence modulo 3, we get the following sequence:

0; 1; 1; 2; 0; 2; 2; 1; 0; 1; 1; 2; : : : : The only values this sequence can have are 0, 1, and 2. This sequence repeats after eight terms. It contains all pairs 0; 1, 0; 2, : : : , 2; 2, except 0; 0.

At this point, it might be reasonable to make a conjecture. Is it true that upon taking the Fibonacci sequence modulo n, the sequence repeats after n2 , 1 terms and contains all the pairs 0; 1, 0; 2, : : : , n , 1; n , 1, except the term 0; 0? Maybe this is just true for prime integers n. Before plunging headlong into any proofs, we should at least check the validity of the conjectures with more values of n, and it turns out that they aren't true. Let rn be the length of the repeating part of the Fibonacci

225 sequence modulo n, known as the period. Here are the values of rn for the rst few positive integers n.

n

2 3 4 5 6 7

rn

3 8 6 20 24 16

We see that our conjecture was wrong. In fact, it appears that r2m = 3 2m,1; r3m = 8 3m,1 ; and r5m = 4 5m: Can this be proved? Are there patterns for other numbers other than power of primes? Is there a closed form for the function rn in terms of the factorization of n? Perhaps to answer this question we must look at other repeating sequences other than that generated by 0; 1 modulo n. Let us call the repeating sequence generated by a; b modulo n the residue-cycle of a; b, and denote it by the symbol ha; bin . For example, the residue-cycle h0; 1i4 is f0, 1, 1, 2, 3, 1g, which we can verify has length six. There are also three other residue-cycles: h0; 2i4 = f0, 2, 2g, h0; 3i4 = f0, 3, 3, 2, 1, 3g and the trivial sequence h0; 0i4 = f0g. For n = 4, all possible residue-cycles are h0; 0i4, h0; 1i4, h0; 2i4, and h0; 3i4. Note h1; 1i4 = h0; 1i4, since these sequences are understood to be cyclic, so any pair of consecutive terms in a residue-cycle can generate it. Some observations: 1 ha; bin need not be hb;ain . For example, h1; 3i4 and h3; 1i4 are di erent residue-cycles. 2 It might seem that the residue-cycles form a group structure under the operation ha; bin + hc; din = ha + c; b + din , where addition of a + c and b + d is taken modulo n. This is not true. For example, assuming such a group operation could exist, consider the residue-cycles h0; 1i5 = f0, 1, 1, 2, 3, 0, 3, 3, 1, 4, 0, 4, 4, 3, 2, 0, 2, 2, 4, 1g = h0; 2i5 and h1; 3i5 = f1, 3, 4, 2g. We have then h0; 1i5 + h0; 1i5 = h0; 2i5 = h0; 1i5 , and h0; 1i5 = h1; 2i5 so h0; 1i5 + h0; 1i5 = h0; 1i5 + h1; 2i5 = h1; 3i5, contradiction. 3 For any n, if there are k distinct residue-cycles, with the ith one conP taining li elements, then we have the relation k=1 li = n2. i As a corollary of this fact, we see that the length of the residue-cycle h1; 1in is at most n2 , 1. 4 If a residue-cycle has length one, it must be h0; 0in for some n. We see that answering the question of what the length of the residuecycle generated by 0; 1 modulo n is, is a speci c case of knowing what all the possible lengths are.

8 9 10 11 12 13

rn

12 24 60 10 24 28

14 15 16 17 18 19

rn

48 40 24 36 24 18

20 21 22 23 24 25

rn

60 16 30 48 24 100

26 27 28 29 30 31

rn

84 72 48 14 120 30

32 33 34 35 36 37

rn

48 40 36 80 24 76

38 39 40 41 42 43

rn

18 56 60 40 48 88

44 45 46 47 48 49

rn

30 120 48 32 24 112

226 Given n, we may list the lengths of the distinct residue-cycles modulo n. n lengths of residue-cycles modulo n

2 3 4 5 7 8 1, 3 1, 8 1, 3, 6, 6 1, 4, 20 1, 16, 16, 16 1, 3, 6, 6, 12, 12, 12, 12

Is there a pattern in these numbers? Do the residue-cycles for a given n form some kind of structure? group, ring, etc. Acknowledgements Anand Govindarajan, First Year student, University of Toronto at Scarborough, for conjecturing that rn is related to the factorization of n.

student, University of Toronto Toronto, Ontario There are many puzzles in which the rst few terms of a sequence are given, and the next term is asked to be determined. Supposedly, there will be a unique rule for the sequence. A similar type of problem appears in mathematics, where we are also told that the sequence is given by a polynomial. Since polynomials have nice properties, so do these sequences, some of which we will explore here. First, we will lay down a few important and motivating results. Result 1. Given any distinct n + 1 reals, x0 , x1 , : : : , xn , and any n + 1 reals, y0, y1, : : : , yn, there exists a unique polynomial p of degree at most n, such that pxi = yi, 0 i n. Proof. Assume px = cn xn + cn,1 xn,1 + + c1 x + c0 , for some constants ci . The condition pxi = yi, 0 i n, is equivalent to the following linear system in the variables ci :

Naoki Sato

. . .

227 The matrix xj 0i;j n has non-zero determinant, since it is Vanderi monde's determinant. By Cramer's Rule, there is a unique solution for the ci , and hence for p. The next result is simply a corollary, sometimes called the Identity Theorem for polynomials. Result 2. If two polynomials of degree at most n agree at n + 1 points, then they are identical. This is interesting stuff, but what does it have to do with extrapolating sequences? In these problems, we will t a polynomial to the given data. By the Identity Theorem, this polynomial will be the one we seek. What is particularly nice about this method is that we will not have to appeal to the Lagrange Interpolation Formula or any other tedious equations to actually nd the polynomial we seek note that the rst result only assures us of the existence of a polynomial p; little mention is made of what the coef cients might be. Problem 1. Let p be the polynomial of least degree satisfying pk = 1=k + 1 for k = 0; 1; : : : ; n. Find pn + 1. Solution. Let q x = x + 1px , 1. Then q k = 0 for 0 k n, so q x = cxx , 1 x , n for some constant c. Note q ,1 = ,1, but

q,1 = c,1,2 ,n , 1 = c ,1n+1n + 1!; so c = ,1n=n + 1!, and qx = ,1nxx , 1 x , n=n + 1!;

giving so that Hence,

pn + 1 = 2=n + 2 if n is even, 0 if n is odd: Problem 2. Let p be the polynomial of least degree satisfying pk = 1 for k = 0; 1; : : : ; n , 1, and pn = 0. Find pn + 1. Solution. Let q x = px , 1, so that qx = cxx , 1x , 2 x , n , 1 for some constant c. Then qn = c n! = pn , 1 = ,1;

c = ,1=n!;

Solution. Let

Problem 3. Let p be the polynomial of least degree satisfying pk = 2k, for k = 0; 1; : : : ; n. Find pn + 1.

Note that is k ,xsimply a polynomial in x, and that upon expanding, it is easy to see that k = 0 for 0 x k, where x is an integer. It is easy to verify that q k = 2k for k = 0; 1; : : : ; n. Hence, p q . Furthermore,

x x x qx = 0 + 1 + + n :

pn + 1 =

Sometimes though, these methods are not su cient. We turn to another method, one that is probably well-known among people who have played around with sequences. Given a polynomial p, we list p0, p1, p2, : : : , in sequence. Under this row, write the sequence of differences between consecutive terms, and then repeat. We thus form a difference table. For example, for

the table will be: 1 2 0 ,3 ,5 ,4 1 ,2 ,3 ,2 1 6 ,3 ,1 1 3 5

2 2 2 . . . 2 2 2

13

15

We can in fact do the same for any function, but only polynomials have this property:

229

Result 3. The difference table of p will eventually have a constant row if and only if p is a polynomial. To see this, we only need to realize that a row represents a polynomial of degree k if and only if the row below represents a polynomial of degree k,1. One direction is trivial. To see the other direction, we use a telescoping sum, the same that is used to nd the sum of the kth powers of 1, 2, : : : , n which is in fact a polynomial of degree k + 1. Since a constant is simply a polynomial of degree 0, the result follows. Now, several nice properties follow from this result. First, if the value of a polynomial p, of degree at most n, is an integer for n +1 consecutive integers, then px is an integer for all integers x. Note that it is not necessary for p to have integer coe cients as seen in the example above. Second, if we label the rst row 0, and the second 1, etc., then we nd that the degree of the polynomial is the index of the rst row to become constant. In the above example, p is a cubic, and indeed the third row is the rst to become constant. We will exploit this property in extrapolating sequences. Note: In the example, the rst terms in each row, reading down, are 1, 1, ,3, and 2. A nice result in this subject says that

px = 1 x + 1 x + ,3 x + 2 x : 0 1 2 3

A proof will not be provided here, but should not be too hard to construct. Problem 4. Let p be the polynomial of least degree satisfying pk = ,1k, for k = 0; 1; : : : ; n. Find pn + 1. Solution. Suppose n is odd. Writing out the difference table, 1 ,1 1 ,1 ,1 ,2 2 ,2 ,2 4 ,4 ,4 2n,1 ,2n,1 ,2n We know that the last row, the nth row, is constant. Hence, the table can be extended. See Figure 1 on page 230. Hence, pn + 1 = ,2n+1 + 1. Note that this is simply the sum of the rightmost elements of the rst difference table. Similarly, for n even, pn + 1 = 2n+1 , 1. Problem 5. Let Fn denote the nth Fibonacci number. Let p be the polynomial of least degree satisfying pk = Fk , for k = 0; 1; : : : ; n. Calculate pn + 1.

230

1

,2

,1

2 4

,4

2n,1

,2

::: :::

,1

:::

:::

,4

,2

,1

,2n+1 + 4

,2n+1 + 2

,2n+1 + 1

Figure 1.

Solution. Forming the difference table, F0 F1 F2 F3 Fn F,1 F0 F1 Fn,2 F,2 F,1 Fn,4 F,n+1 F,n+2 F,n Then pn + 1 is simply the sum of the right-most values, or

F,n + F,n+2 + + Fn,2 + Fn: Now, F,k = ,1k+1 Fk for all k. Therefore, if n is even, all the terms will cancel, and the sum is 0. If n is odd, the sum is 2F1 + F3 + + Fn = 2F2 , F0 + F4 , F2 + + Fn+1 , Fn,1 = 2Fn+1 , F0 = 2Fn+1 :

Problems

B. Find the value of the polynomial p of least degree satisfying the following: a pk = ak , k = 0, 1, : : : , n, , b pk = n , k = 0, 1, : : : , n. k

n+1 X

Hint: Use the difference table, or realize that the values p0, p1, : : : , pn + 1 must satisfy a recurrence relation. Which one? D. Assume p is a polynomial of degree at most n such that pk2 is an integer for k = 0; 1; : : : ; n. Show that pk2 is an integer for all integers k.

student, University of Waterloo Waterloo, Ontario A fundamental relation in mathematics is given by Euler's Theorem, which states:

Soroosh Yazdani

ei = cos + i sin :

Using the Taylor expansion, one can check the identity as follows:

2 3 ei = 1 + i + i + i + 1! 2! 3! , 2 , i 3 + = 1 + i 1! 2! 3!
3 5
2 4 = 1 , + , + i 1! , + , 2! 4! 3! 5! = cos + i sin :

1

We will use this result to derive several identities quickly and elegantly. Now using the fact that cos, = cos and sin, = , sin , we get:

ei , e,i = sin : 2i

This means that we can write trigonometric functions as pure exponential equations. From this we can prove many identities. Problem: Prove that

2 sin

Solution:

L.H.S. =

= =

Problems 1. Prove 2 cos

+ 2

+ 2 + 2 2 2 + 2 2 + 2 2 + 2 2

+ 2

e,i

, 2

Here is another neat problem: What is the expansion of cos n? We will need the Binomial Theorem.

cos , = cos + cos : 2 2. Prove 2 sin + sin , = cos , cos : 2 2 3. Prove sin + = sin cos + cos sin :

233

cos n = = =

ein + e,in ,ei n + e,i n ,cos + i sin n + cos , i sin n 0n 1 @ X n
cosn,j ij sinj = 2 j =0 j

1 2 1 2 1 2

1 n X n
n,j j j A + j cos ,i sin j =0 n X n
n,j j , j cos sin i + ,ij = 1 2j j n=0
n , n cosn,2 sin2 + n cosn,4 sin4 , = 0 cos 2 4

cos + i sin n . Although we could have come to the same conclusion by equating real and imaginary parts of the expansion, I thought that this path might be a bit more interesting. A similar expression for sin n exists,

which is left as an exercise for the reader to derive. Here is a problem that takes advantage of the exponential form of trigonometric equations.

Problem: Evaluate Solution:

n n 1X 1X sin j = 2i ,eij , e,ij = 2i ,ei j , e,i j j =0 =0 j =0 i nj+1 ,i n+1 , 1 ! 1 , = 2i ee , 1 1 , ee,i , 1 i n X n X j =0

Some readers will notice at this point that we got the real part of

sin j.

i n+1 ,i , 1 , ,i n+1 i = e , 1e iei , 1e,ei ,1 , 1e , 1 2 in , e,i , ein+1 + 1 , e,in , ei , e,in+1 + 1 = e 2i2 , ei , e,i sin = sin n + 2 ,2, sinn + 1 : cos

234 Now we can simplify this equation using our previous identities.

sin n + sin , sinn + 1 2 , 2 cos sin n + sin,n + 1 + sin + sin0 = 2cos 0 , cos 1 , 2 = 2 cosn + 2 sin sin + 2 sin 2 cos 2 4 sin 2 2 1 +2 = , cosn2 sin + cos 2 2 n+1 sin n = 2 sin 2 2 2 sin 2 n+1 sin n = sin 2 sin 2 : 2

We can also evaluate reader.

n X j =0

The last identity that we will derive is the expansion of tan n. We ei , e,i have seen that tan = i ,i .

, i n , ,e,i n in , ,in i tan n = ein + e,in = ei n + e,i n e ,2eine, ,2e,i ne = 2ei n + 2e,i n

2ei n

2e,i n , i e,i i ,i =

e 2+e n

e 2+,i n i e e

+ ei +e,i n n = 1 + i tan n , 1 , i tan n 1 + i tan + 1 , i tan

ei +e,i

235

n n
X n
j , X n ,i tan j i tan j =0 j j =0 j = X n
n n X n
j i tan j + j j ,i tan j =0 j =0 n n
X j j j i tan , ,i tan =0 = jX
n n j j j i tan + ,i tan j =0 n
n
1 3 i 1 tan , 3 tan +
; = n
tan0 , n tan2 +

0 2

Mayhem Problems

The Mayhem Problems editors are: Cyrus Hsia Mayhem Advanced Problems Editor, Richard Hoshino Mayhem High School Problems Editor, Ravi Vakil Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only solutions | the next issue will feature only problems. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions from the previous issue be submitted by 1 October 1997, for publication in the issue 5 months ahead; that is, issue 2 of 1998. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions from others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

236

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca H208. In a triangle ABC with incentre I and angles 2a, 2b, and 2c at vertices A, B , and C respectively, and circumradius R, show that CI = 4R sin a sin b. Solution by Bob Prielipp, University of Wisconsin-Oshkosh, WI, USA. To avoid confusion, let the angles a, b, and c be denoted by , , and . Then the result follows immediately from the following theorem: Theorem. r = 4R sin sin sin , where r is the in-radius. Proof. By the extended Sine Law,

a = sin 2 = 2 sin cos : 2R r and cos = s , a in the small triangle with vertices A, I Also, sin = AI AI and the point of tangency on side AB with the incircle.

Putting all this together gives

and likewise we have similar results for the other two angles. Their product gives Let K be the area of triangle ABC . Using the relations Heron's formula, the result follows. r Armed with this, we use sin = , so that

sin2 = 4Rar, a ; s

3

abc = K; rs = K; and K = pss , as , bs , c 4R r sin CI = sin = 4R sin sin sin = 4R sin sin ; CI

as required. H209. In an acute triangle with angles a, b, and c, show that the following inequality holds:

sin c + sin a + sin b sin a + sin b + sin c : cosa , b cosb , c cosc , a sin2a + sin2b + sin 2c

237 Solution by Wai Ling Yee, University of Waterloo, Waterloo, Ontario. Without loss of generality, assume that b a. Note that

1

We have 0 cos 1, sin 0, and cos a , cos b 0. Thus, for 0 =2, we have that 1 is less than or equal to sin a + sin b. Setting = =2 , b 0, we have

Since the triangle is acute, a + b

=2 and

Using this inequality and the Weighted AM-HM Inequality with

and weights

respectively, we get

so that

w1 + w2 + w3 ; x1 x2 x3

Let

238 Thus

sin c + sin a + sin b cosa , b cosb , c cosc , a 2 a sin c cosa , bsinsin+ sin bb+ sin c sin b cosc , a + a cos , c + sin a + sin b + sin c sin c cosa , b + sin a cosb , c + sin b cosc , a sin c = 2 sin c cosa , b2sin a + cosbb+ sin+2 sin b cosc , a + 2 sin a , c = 2sin a + sin b + sin c 2sin a b+ = sin2b + sin 2a + sin +csinsin 2sin csin2a + sin2c 2 + b+ sin a + sin = sin2a + sin2bb+ sin c2c : + sin

H210. A shu e" of 2n cards labelled a1, a2, : : : , a2n in that order consists of taking the rst n cards and merging it with the last n so that a1 , a2 , : : : , an will be in that order somewhere in the new pile and likewise for an+1 , an+2, : : : , a2n . Prove that if we start with a pile of 2n cards labelled 1, 2, : : : , 2n, then it is possible after a nite number of shu es to get the cards in the reverse order. Solution. De ne a step" to be two shu es de ned in the problem. We will show by induction on k that after k steps, it is possible to place the cards a2n , a2n,1 , : : : , a2n,k+1 in the rst k positions, the cards ak , ak,1 , : : : , a1 in the last k positions, and leave the remaining n , 2k cards in their original positions. Call the position that the card labelled ai originally occupies position i. Base Case: k = 1. We show that in one step or two shu es cards a2n and a1 can be in the rst and last positions respectively and the other cards left in their original positions. For the rst shu e, put a1 at position n and a2 , a3, : : : , an at positions n + 2, n + 3, : : : , 2n respectively, and an+1, an+2 , : : : , a2n,1 in positions 1, 2, : : : , n,1 respectively, leaving card a2n to go into position n+1. For the second shu e just take the rst n cards and put it after the last n cards to give the desired con guration. Diagrammatically, this is as follows:

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

239

Induction Step: Suppose after k steps, 1 k n, that the hypothesis holds, that is, cards a2n , : : : , a2n,k+1 and ak , : : : , a1 are in positions 1, 2, : : : , k, and 2n , k + 1, : : : , 2n respectively and the other n , 2k cards are in their original positions. Now for the rst shu e on the k + 1th step leave a2n , : : : , a2n,k+1 and ak , : : : , a1 in their respective positions. Place card ak+1 in position n + 1 and cards ak+2 , : : : , an in positions n + 1, : : : , 2n , k , 1. Then place cards an+1 , : : : , a2n,k+1 in positions k + 1, : : : , n,2 and nally a2n,k must go in position n+1. For the second shu e again leave a2n , : : : , a2n,k+1 and ak , : : : , a1 alone. Place cards at positions k +1, : : : , n in positions n + 1, : : : , 2n , k and those cards that were at position n +1, : : : , 2n , k down into positions k +1, : : : , n. Diagrammatically, this is as follows:

ak+1 : : : an an+1 : : : a2n,k ak : : : a1 a2n : : : a2n,k+1 an+1 : : : a2n,k+1 ak+1 a2n,k ak+2 : : : a2n,k ak : : : a1 a2n : : : a2n,k+1 a2n,k ak+2 : : : an an+1 : : : a2n,k,1 ak+1 ak : : : a1 Induction is complete, so when k = n we have all the cards in the

a2n : : : a2n,k+1

Editor: Cyrus Hsia, 21 Van Allan Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu A184. Let A be a 3 3 matrix with rational entries such that A8 = I . Show that A4 = I . Solution Let mA x be the minimal polynomial of A over the rationals. Then mA x is a polynomial with8rational coe cients, with degree at most 3. We also know mA x divides x , 1, whose factorization over the rationals is x , 1x + 1x2 + 1x4 + 1. The polynomial mAx must be a product of some of these factors, and x4 + 1 cannot be one of them. Hence, mA x divides x , 1x + 1x2 + 1 = x4 , 1 A4 = I . Ravi Vakil and Nicolas Guay both correctly pointed out that the original statement of the problem, which had real" instead of rational", was awed, as seen in the counterexamples:

0 p2 , 1 1 0 1 0p 1 p2 , 2 1 0 A and A = @ 12 ,1 0 A ; A=@ 0 0

0 0 1 0 0 1

240 Also solved by MIGUEL CARRION ALVAREZ, Universidad Complutense de Madrid, Spain; DONNY CHEUNG, University of Waterloo, Waterloo, Ontario; EDWARD WANG, Wilfrid Laurier University, Waterloo, Ontario. A188. Let ABCD and A0B0 C 0D0 be squares with opposite orientation, with A = A0 . Let M be the midpoint of DD0 . Show that AM ? BB 0 and 2 AM = BB 0 . Solution by Wai Ling Yee, University of Waterloo, Waterloo, Ontario. A 90 rotation about A brings B 0 to D0 and D to B . Therefore,

, !0 ,! = , !0 ,! , , AB AD AD AB:

Hence,

, , 2, ! , ! = AM BB0 = =

,! , !0

,!0 ,! , , AD + AD AB , AB ,! , !0 , ,! ,! + , !0 ,!0 , , !0 ,! , , , , AD AB AD AB AD AB AD AB ,! , !0 , 0 + 0 , , !0 ,! = 0; , , AD AB AD AB

,! ,!0 = ,,! , !0 : , , AB AB AD AD

= =

, 2 , ,

,

, 4 , ! = 4, ! , ! = ,! + , ! ,! + , ! AM AM AM AD AD0 AD AD0

241

A189. Prove that no seven positive integers, not exceeding 24, can have sums of all subsets distinct. Solution by Wai Ling Yee, University of Waterloo, Waterloo, Ontario. Assume that it is possible to nd a set of seven natural numbers, such that all sums of subsets are distinct. The numbers must be distinct, and hence there is a maximum value, x, and a minimum value, y . The set has 27 , 1 = 127 non-empty subsets, and hence the di erence between the largest sum and the smallest sum must be at least 126. The smallest sum must be y . The largest sum cannot exceed

x + x , 1 + x , 2 + x , 4 + x , 5 + x , 7 + y = 6x , 19 + y;

since there cannot be four consecutive terms of an arithmetic progression rst plus last equals sum of middle two terms. Therefore the di erence between the largest and the smallest sum cannot exceed 6x , 19. This takes its maximum value when x = 24. However, 6 24 , 19 = 125 126, contradiction. Therefore no seven positive integers, not exceeding 24, can have sums of all subsets distinct. Also solved by EDWARD WANG, Wilfrid Laurier University, Waterloo, Ontario.

242

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 1 "11" or A4 sheets of paper. 2 These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 December 1997. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

2238. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. A four-digit number abcd is said to be faulty if it has the following property: The product of the two last digits c and d equals the two-digit number ab, while the product of the digits c , 1 and d , 1 equals the two digit number ba. Determine all faulty numbers! 2239. Proposed by Kenneth Kam Chiu Ko, Mississauga, Ontario. Suppose that 1 r n and consider all subsets of r elements of the set f1, 2, 3, : : : , ng. The elements of these subsets are arranged in ascending order of magnitude. For i from 1 to r, let ti denote the ith smallest element in the subset. Let T n; r;i denote the arithmetic mean of the elements ti .

Prove that T n;r; i = i

n + 1. r+1

243 Proposed by Victor Oxman, University of Haifa, Haifa, Israel. Let ABC be an arbitrary triangle with the points D, E , F on the sides BC , CA, AB respectively, so that BD BF 1 and AE AF .

2240.

DC FA EC FB ABC with equality if and only if two of the Prove that DEF 4 three points D, E , F , at least are mid-points of the corresponding sides. Note: XY Z denotes the area of triangle 4XY Z .

Triangle ABC AB 6= AC has incentre I and circumcentre O. The incircle touches BC at D. Suppose that IO ? AD. Prove that AD is a symmedian of triangle ABC . The symmedian is the re ection of the median in the internal angle bisector. 2242. Proposed by K.R.S. Sastry, Dodballapur, India. ABCD is a parallelogram. A point P lies in the plane such that 1. the line through P parallel to DA meets DC at K and AB at L, 2. the line through P parallel to AB meets AD at M and BC at N , and 3. the angle between KM and LN is equal to the non-obtuse angle of the parallelogram. Find the locus of P . 2243. Proposed by F.J. Flanigan, San Jose State University, San Jose, California, USA. Given f x = x , r1 x , r2 : : : x , rn and f 0x = nx , s1x , s2 : : : x , sn,1, n 2, consider the harmonic mean h of the nn , 1 di erences ri , sj . If f x has a multiple root, then h is unde ned, because at least one of the di erences is zero. Calculate h when f x has no multiple roots. 2244. Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is a triangle and D is a point on AB produced beyond B such that BD = AC , and E is a point on AC produced beyond C such that CE = AB. The perpendicular bisector of BC meets DE at P . Prove that BPC = BAC .

244

n Gomez Rey, IES Luis Bu~ uel, Alcorc n on, Madrid, Spain.

3n + ,1n , 2n is divisible by 5 for n 2. Prove that 2

2

Suppose that G, I and O are the centroid, the incentre and the circumcentre of a non-equilateral triangle ABC . The line through B , perpendicular to OI intersects the bisector of BAC at P . The line through P , parallel to AC intersects BC at M . Show that I , G and M are collinear. 2247. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. a Suppose that n 3 is an odd natural number. Show that the only polynomial P 2 R x satisfying the functional equation:

P x + 1n = P xn +

n,1 n X k=0

k k x;

for all x 2 R;

is given by P x = x. b? Suppose that n 1 is a natural number. Show that the only polynomial P 2 R x satisfying the functional equation:

P x + 1n = P xn +

n,1 n X k=0

k k x;

for all x 2 R;

is given by P x = x. c? Suppose that n 1 is a natural number. Show that the only polynomial P 2 R x satisfying the functional equation:

is given by P x = x.

n,1 n X k=0

k k x;

for all x 2 R;

245

2248. Proposed by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario.

Find the value of the sum ; where dk is the number of posi2 k=1 k tive integer divisors of k. 2249. Proposed by K.R.S. Sastry, Dodballapur, India. How many distinct acute angles are there such that

1 X dk

ABC is a scalene triangle with incentre I . Let D, E, F be the points where BC , CA, AB are tangent to the incircle respectively, and let L, M , N be the mid-points of BC , CA, AB respectively. Let l, m, n be the lines through D, E , F parallel to IL, IM , IN respectively. Prove that l, m, n are concurrent.

Historical Titbit

Taken from a 1950's University Scholarship Paper.

1. A, B , C , D are four points on a circle. The tangent at B meets CD at L, the tangent at C meets AB at M , and AD meets BC at N . Prove that L, M , N are collinear. 2. If ABCDEF are concyclic and ACDEF is a harmonic pencil, prove that B CDEF is also a harmonic pencil.

246

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 2129?. 1996: 123 Proposed by Stanley Rabinowitz, Westford, Massachusetts, USA. p For n 1 and i = ,1, prove or disprove that

1 4i

4n X

is an integer. Solutionby G.P. Henderson, Campbellcroft, Ontario; modi ed slightly by the editor. Let S n denote the given sum. We show that S n is always an integer. First we need a lemma:

Lemma. Let n be a positive integer, and let g n =

gcd k;n=1

k=1

ik tan k 4n

Then g n = ,1n+1n. Proof. We rst obtain an expansion of tann. Ed: see also 1997: 233 . Using the following well-known formulae: ! !

sinn cosn = =

tan 4j4, 3 . n j =1

n X

n

1

sin cos

n cos

!

n

2

n,1

n

3

sin

3 cosn,3 + : : : ;

4

!

1

sin

4 cosn,4 , : : : :

2

1 Dividing both the numerator and the denominator of the fraction by 2 cosn , and setting x = tan , we get where P x and Qx are polynomials in x. Speci cally, if n is odd, then

n
n
x , 3 x3 + : : : + ,1n,1=2 n xn; 1
n n x2 + : : : + ,1n,1=2 n
xn,1; Qx = 1 , 2 n,1 and if n is even, then the last terms of P x and Qx are
n=2 n xn,1 n=2 n xn ; ,,1 n , 1 and ,1 n

P x =

x 3 tann = 1 = P x : Q The roots of tann = 1 are clearly given by = 4j , 3=4n; that is x = tan 4j , 3=4n , j = 1, 2, : : : , n. Thus gn is simply the sum of the roots of tann = 1. P x = 1 are the roots of On the other hand, the roots of Qx P x , Qx = 0. Hence, when n is odd, the sum of the roots is , coe cient of xn,1 in ,Qx = n = ,1n+1n; coe cient of xn in P x

1 X tan k ; Sn = 2 4n k2B where B = fk j 1 k 4n; gcdk; n = 1 and k 1 mod 4g. Let n = 2m a where a is odd. If a = 1, then n = 2m , m 1, and k 2 B if and only if k = 4j , 3, j = 1, 2, : : : , n. Hence Sn = g2n = , n ; 2

and when n is even, the sum of the roots is coe cient of xn,1 in P x = ,n = ,1n+1 n: coe cient of xn in ,Qx Therefore, g n = ,1n+1n. The proof of the lemma is complete. Continuing, set A = fk j 1 k 4n; gcdk; n = 1g. Note that if k 2 A, then 4n , k 2 A and 4n , k 6= k. If k is even, then the sum of the terms corresponding to k and 4n , k is zero. If k is odd, then one of k and 4n , k is congruent to 1 and the other to ,1, all congruences are modulo 4, unless otherwise stated, and the corresponding terms are equal. Therefore

which is an integer. If a 3, let p1, p2 , : : : , pr , denote the distinct odd prime divisors of a, and suppose that pj bj , where bj = 1 for j = 1, 2, : : : , r. To get S n from g n, we must subtract the terms with k divisible by at least one of p1 , p2 , : : : , pr .

k
Set h = hj1; j2; : : : ; js = tan 4n , where the summation is k over all k such that k 1, and k is a multiple of c = pj pj : : : pjs , where 1 s r and all the p's are distinct. X

1 2

248 If c 1, then the values of k in the sum are c, 5c, : : : , 4d , 3c, where d = n=c. Hence d X 4j , 3
h = tan = g d = ,1d+1d 4d j =1 = ,1n+1 p p n: : : p ; 4

j1 j2 js

since n = cd and c being odd, together imply that d n mod 2. If c ,1, then the values of k in the sum are 3c, 7c, : : : , 4d , 1c and

h=

j1 j2 js

1 2

d X

5

Since

the answers in formulae 4 and 5 can be combined in the formula:

j1 j2

1 2

js

Sn =

= = =

which is clearly an integer. In fact, it is divisible by 2m+2r,1 since pj , bj is divisible by 4. This completes the proof.

0 1 n X X 1 @gn , hj + hj1; j2 , : : : A 2 j 0=1 n j j 1 n+1n X bj bj bj ,1 @1 , + , :::A 2 j =1 pj pj pj ,1n+1n 1 , b1
1 , b2
: : : 1 , br
2 p1 p2 pr n+1np1 , b1p2 , b2 : : : pr , br ,1 2p1 p2 : : : pr

1 2 1 1 2 2

249 Also solved by KURT GIRSTMAIR, University of Innsbruck, Innsbruck, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA, and VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA. Girstmair, using character coordinates, which play an important role in the study of cyclotomic elds, shows that

,T n if n is even; T n=2 if n is odd; Y1 Y Y where T n = n p , 1 p + 1 with p running through all p p1 p3 prime divisors of n and the congruences are taken modulo 4. It is not di cult

Sn =

to show that his answer is equivalent to the one given in the solution above. 1996: 124 Proposed by K.R.S. Sastry, Dodballapur, India. Similar non-square rectangles are placed outwardly on the sides of a parallelogram . Prove that the centres of these rectangles also form a nonsquare rectangle if and only if is a non-square rhombus. As Florian Herzig and V
clav Kone n
both noted, the similar nona c y square rectangles must be placed nicely", that is, they must either all have the longest side or all have the shortest side in common with the parallelogram. Otherwise, the conclusion of the problem does not hold! Solution by Christopher J. Bradley, Clifton College, Bristol, UK.

2133.

j @ I @

Then

,j , @@ ,, @, -i

i j = cos i j = cos

i

Let i; j be unit vectors making an angle with one another, and let i and j be the images of i and j under a 90 anticlockwise rotation.

i i = 0 j j = 0

i j = sin j i = sin

The proof is trivial, but these relations will be much used in what follows. ,! ,! Let the parallelogram be OACB with OA = 2ai and OB = 2bj and let W; X; Y;Z be the centres of the non-square similar rectangles see the gure.

250

O

Hence

B W 2bj

q q q q

X

2 i

C Y

Those centred at X and Z have sides 2a; 2ka and the other two 2b; 2kb, where k 6= 1, since they are non-square. Let the position vectors of W; X; Z relative to O be w; x; z, respectively. Then it is easy to see that

,! = w , z = bj + kbj , ai + kai and , ZW ,,! = x , w = bj + ai + kai , kbj: WX From which, using relation repeatedly, we see that ,! ,,! = b2 , a21 , k2 and , ZW WX ZW 2 = WX 2 if and only if 2ab cos 1 , k2 = 0: But k = 1, so ZW and WX are at right angles if and only if a = b and 6 ZW = WX if and only if = 90 . So ZWXY is a non-square rectangle if and only if OACB is a non-

square rhombus. The proposer notes that this is related to two well-known results. Napoleon's Theorem: The centres of equilateral triangles, placed on the sides of any triangle, form an equilateral triangle. Th bault's Theorem: The centres of squares placed on any parallelogram e form a square. Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; JOHN G. HEUVER, Grande Prairie Composite High School, Grande Prairie, Alberta; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; P. PENNING, Delft, the Netherlands; TOSHIO SEIMIYA, Kawasaki, Japan; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer.

A1A2A3A4 is a quadrilateral. Let B1, B2, B3 and B4 be points on the sides A1 A2 , A2 A3 , A3 A4 and A4 A1 respectively, such that A1B1 : B1A2 = A4B3 : B3A3 and A2B2 : B2A3 = A1B4 : B4A4:

2141.

A1A2 = a1; A2A3 = a2; A3A4 = a3; A4A1 = a4; A1B1 = a1; B1A2 = a1; + = 1; A2B2 = a2; B2A3 = a2; + = 1; A3B3 = a3; B3A4 = a3; A4B4 = a4; B4A1 = a4 ; A4A1A2 = 1; A1A2A3 = 2; A2A3A4 = 3; A3A4A1 = 4: The distance from P1 and P2 to A1 A2 is d1 ; from P2 and P3 to A2 A3 is d2 ; from P3 and P4 to A3 A4 is d3 ; from P4 to A4 A1 is d4 and from P1 to A4A1 is d04. It su ces to show: d04 = d4 which implies P4P1kA4A1. Consider 4B1 A2 B2 . We see that B1 A2 P2 + A2 B2 P2 = B1 A2 B2 or a1 d1 + a2 d2 = a1 a2 sin 2; 1 Similarly, for 4B2 A3 B3 , 4B3 A4 B4 and 4B4 A1 B1 : a2d2 + a3 d3 = a2a3 sin 3; 2 a3d3 + a4d4 = a3a4 sin 4; 3 a4d04 + a1d1 = a1a4 sin 1: 4 Eliminating d2 out of 1 and 2, we nd: a1d1 , a3 d3 = a1a2 sin 2 , a2a3 sin 3: 5

252 Eliminating d3 out of 3 and 5: We rewrite 4: 6 and 7 imply Then

a1d1 + a4d4 = a1a2 sin 2 , a2 a3 sin 3 + a3a4 sin 4: a1d1 + a4 d04 = a1a4 sin 1:

a4 d4,d04 = a1a2 sin 2+a3 a4 sin 4, a2a3 sin 3+a1 a4 sin 1:

2 A1A2 A3 A4 = a1 a2 sin 2 + a3a4 sin 4 = a2a3 sin 8 and 9 imply d04 = d4 and P4 P1 jjA4 A1 .

3

Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK for a parallelogram; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; and the proposer. 1996: 170 Proposed by Victor Oxman, Haifa, Israel. In the plane are given an arbitrary quadrangle and bisectors of three of its angles. Construct, using only an unmarked ruler, the bisector of the fourth angle. Solution by Toshio Seimiya, Kawasaki, Japan. ABCD is a given quadrangle. We denote the bisectors of angles A, B, C , D, by a, b, c, d, respectively. We assume that a, b, c are given. We shall construct d using only an unmarked ruler. Case I. ABCD is not a parallelogram. We may assume that AB is not parallel to CD. Construction: Let O be the intersection of AB; CD, and let P be the intersection of b and c. Join O and P , and let Q be the intersection of a and OP . Join D and Q; then DQ is d. Proof: P is either the incentre or the excentre of 4OBC depending on whether or not the given quadrangle is convex and how its angles are arranged , so that OP is a bisector of BOC . Thus Q is the excentre or incentre of 4OAD so that QD bisects ADC . Case II. ABCD is a parallelogram. If ABCD is a rhombus then b coincides with d and is the bisector of D. We shall assume that ABCD is not a rhombus. Construction. Let P be the intersection of b and c. Draw AC and BD, and let O be their intersection. Join P , O, and let Q be the intersection of PO with a. Join Q and D; then QD is the bisector of D.

2142.

253 Editor's comment. Although Seimiya provides a brief argument that his construction is correct, it simply proves that a parallelogram is symmetric about its centre, which can be left to the reader. Also solved by CLAUDIO ARCONCHER, Jundia

, Brazil; NIELS BEJLEGAARD, Stavanger, Norway; CHRISTOPHER J. BRADLEY, CliftonCollege, Bristol, UK Case I only; and the proposer. 1996: 170 Proposed by B. M???y, Devon, Switzerland. My lucky number, 34117, is equal to 1662 + 812 and also equal to 1592 + 942, where j166 , 159j = 7 and j81 , 94j = 13; that is, it can be written as the sum of two squares of positive integers in two ways, where the rst integers occurring in each sum di er by 7 and the second integers di er by 13. What is the smallest positive integer with this property? Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let N = a2 + b2 = a , 132 + b + 72, where a 14 and b 1, be the smallest natural number having the desired property. Simplifying yields

2143.

b = 13a , 109 : 7 As b is a natural number, 13a , 109 0 mod 7 which implies a 3 mod 7 for example, since 109 39 mod 7 . Hence the smallest a is 17, and then b = 16 and N = 172 + 162 = 42 + 232 = 545: We get all solutions by setting a = 10 + 7k for k 1: 10 + 7k2 + 3 + 13k2 = 7k , 32 + 10 + 13k2 = 1092k2 + 2k + 1: The solution mentioned in the proposal is obtained for k = 12.

From the above equation we see that 109 divides all solutions. And incidentally, the smallest solution which is also a square is

Also solved by SAM BAETHGE, Nordheim, Texas, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; IAN JUNE L. GARCES, Ateneo de Manila University, Manila, The Philippines, and GIOVANNI MAZZARELLO, Ferrovie

254 dello Stato, Firenze, Italy; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; DAVID HANKIN, Hunter College High School, New York, NY, USA; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; D. KIPP JOHNSON, Val ley Catholic High School, Beaverton, Oregon, USA; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH, Mount Royal College, Calgary, Alberta; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece; KENNETH M. WILKE, Topeka, Kansas, USA; and the proposer. Two other readers sent in incorrect solutions probably due to misunderstanding the problem. Janous notes that 545 is a palindrome and wonders if there are any other palindromic solutions! Kone n replaces the digits 5 and 4 in the c y solution by the corresponding letters E and D respectively, and therefore wonders if the proposer's name is MEDEY. It is not | in fact, each star represents two letters. 1996: 170 Proposed by B. M???y, Devon, Switzerland. My lucky number, 34117, has the interesting property that 34 = 2 17 and 341 = 3 117 , 10; that is, it is a 2N + 1-digit number in base 10 for some N , such that i the number formed by the rst N digits is twice the number formed by the last N , and ii the number formed by the rst N + 1 digits is three times the number formed by the last N + 1, minus 10. Find another number with this property. I Solution by David Hankin, Hunter College High School, New York, NY, USA. Let A be the number formed by the rst N digits of the required number, let B be the number formed by the last N digits, and let x be the middle digit. Then A = 2B and 10A + x = 3x 10N + B , 10: From these, we obtain

2144.

17B = 3x 10N , x , 10; so x + 10 3x 10N mod 17. Since A = 2B has N digits, B and so 17B 8:5 10N . Thus by 1, 1 x 2.

1

5 10N ,1

255 When x = 1, we have 3 10N 11 mod 17, so 10N 15 mod 17. This is satis ed by N = 2, and since 1016 1 mod 17 by Fermat's little theorem , it is satis ed by N = 2 + 16k for non-negative k. Note that x = 1, N = 2 yields the lucky number referred to in the problem. When x = 2, we have 6 10N 12 mod 17, so 10N 2 mod 17. A little arithmetic yields N = 10 + 16k this time, so the next smallest number with the required property is the one given by x = 2 and N = 10. These values yield 17B = 6 1010 , 12, from which B = 3 529 411 764, A = 7 058 823 528, and a lucky number of

which coincidentally happens to be my lucky number too. II Solution by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario. Godin rst obtained equation 1 and that x must be 1 or 2, and then his solution, with Hankin's notation, continues as follows. When x = 1, we need to nd a natural number of the form Now we can calculate

B = 3 1017 , 11 :

N

and if we look in the long division for the rst occurrence of a remainder of 11, we can construct a solution. It occurs after the rst 7, which yields B = 17, A = 34 and thus the lucky number 34117 which is the proposer's lucky number. It is also the rst in an in nite family of solutions. We can create new ones by appending a full period of the repeating decimal for 3=17 to the left of the B of our last solution. Thus the next solution in this family has and thus is

3 = 0:1764705882352941; 17

B = 1764705882352941 17;

A = 3529411764705882 34;

352941176470588234 1 176470588235294117:

N

There is another family of solutions with x = 2, obtained the same way. In this case

and

B = 6 1017 , 12

7058823528 2 3529411764:

Similarly this is the rst solution in an in nite family of solutions. The others are obtained by appending a full period of 6=17 to the left of the B of the last solution. Also solved by SAM BAETHGE, Nordheim, Texas, USA; CHRISTOPHER
J. BRADLEY, Clifton College, Bristol, UK; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; THEODORE CHRONIS, student, Aristotle University of Thesn saloniki, Greece; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; D. KIPP JOHNSON, Valley Catholic High School,
Beaverton, Oregon, USA; AMIT KHETAN, Troy, Michigan, USA; VACLAV
KONECNY, Ferris State University, Big Rapids, Michigan, USA; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH, Mount Royal College, Calgary, Alberta; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. One incorrect solution was sent in. Notice from Godin's solution that the fractions with denominator 17 all have the same digits in their repeating parts, just cycled around". This is the same behaviour that readers will likely know from the fractions 1=7, 2=7, etc. In both cases the reason for this behaviour is that the repeating parts have the largest possible number of digits, 16 in the case of denominator 17. The consequence for this problem is that the solutions have repeated blocks" in them, which some solvers remarked upon.

Crux Mathematicorum

Mathematical Mayhem

257

No. 12 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7 In the last issue, we printed the Bernoulli Trials. Here are the hints and answers.

HINTS | 1

1. The curve is a circle centred at 1; ,1 with radius 5. 2. Write the two series in terms of the log function. 3. For any integer m, one of the numbers m, m + 1 and m + 2 must be divisible by three. 4. Find the highest power of 5 which divides 1000! 5. A real polynomial of odd degree has a positive and nite number of roots. 6. Show that, in fact, the probability equals 1=2. 7. Show that xlim x2p = 1 and xlim x2p+1 = 0. !0+ !0+

8. Expand x , a1 x , a2 : : : x , an . 9. Show that equality can be obtained. 10. By an elementary application of the Pigeonhole Principle, there will eventually be two pairs of adjacent Fibonacci numbers, say fm ; fm+1 and fn; fn+1 whose last four digits respectively are the same. That is, fm and fn are congruent modulo 104, and similarly, so are fm+1 and fn+1. 11. Factor the denominator as k2 + k + 1k2 , k + 1 and use partial fractions.

258 12. The number 1997 is prime and congruent to 1 modulo 4. 13. There is more than one way to skin a cat: Multiply top and bottom by 1 , sin x. 14. Make the substitution x = y p to turn this into a polynomial. 15. Show that f has period 2a.

HINTS | 2

1. Show that the Euclidean distance from 1; ,1 to the given point is greater than 5. 2. Show that , log1 , p = log1 + q . 3. Note that 2n is never divisible by three. 4. Use Legendre's formula for the prime factorization of n! 5. Consider the set ft; t3 ; t5 : ,1 t +1g. 6. Write the number of heads that Johann gets in 1997 tosses as x and the number of heads that Jakob gets in 1996 tosses as y . Compare the distribution of coins for the two Bernoulli sequences with the distribution with heads and tails reversed. Note that x y if and only if 1997 , x 1996 , y . 7. Show that xp log x ! 0 as x ! 0 for all p 0. Use induction. 8. Expanding out, we see that the elementary symmetric functions appear as the coe cients of the polynomial. Suppose the ai 's are distinct. Show that if any ai is negative, then x 0 can be chosen so that the polynomial is negative. 9. Symmetry suggests trying the substitution a = c to nd a counterexample. This does not work! To investigate this question further, prove the inequality is true when strict inequality is relaxed to . The inequality is equivalent to ha; b; c 2 0 for an appropriate function h. 10. Having found two pairs of adjacent Fibonacci numbers with the same last four digits, now work backwards. Compare fm,1 and fn,1 etc. Keep going. 11. Note that Using partial fractions, show that the sum can be written as a telescoping sum.

2k = k2 ,1 + 1 , k2 +1k + 1 2+1 k +k k

4

259 12. Apply Fermat's Great Theorem. 13. There is more than one way to skin a cat: use integration by parts and the transformation t = tanx=2. 14. Descartes Rule of Signs tells us that if z is the number of positive zeros of a polynomial, and c is the number of changes of sign of the sequence of coe cients, then c , z is a nonnegative even number. 15. Show that in the question.

f x + a 2 , f x + a = , f x , 1=2 2: Then write out a formula for f x +2a using the original equation given ANSWERS

1. True 2. True 3. False 4. True 5. False 6. False 7. False 8. True 9. False 10. False 11. True 12. True 13. False 14. True 15. True

Comment

For the information of readers, to the knowledge of the editor, other versions of the Bernoulli Trials have been held at least in his home institution and at the Canadian IMO Residential Training Program. In the latter instance, local high school students were added to the list of competitors. On both occasions, all the competitors reported that it was an enjoyable experience, and a pleasant social event as well.

260

No. 183 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. We begin with the 1997 Canadian Mathematical Olympiad which we reproduce with the permission of the Canadian Mathematical Olympiad Committee of the Canadian Mathematical Society. Thanks go to Daryl Tingley, University of New Brunswick, and Chair of the Canadian Mathematical Olympiad Committee of the Canadian Mathematical Society, for forwarding the questions to me.

PROBLEMS FROM THE 1997 CANADIAN MATHEMATICAL OLYMPIAD 1. How many pairs of positive integers x; y are there, with x y, and such that gcd x; y = 5! and lcm x; y = 50! ? Note: gcd x; y denotes the greatest common divisor of x and y , lcm x; y denotes the least common multiple of x and y , and n! = n n , 1 2 1. 2. The closed interval A = 0; 50 is the union of a nite number of closed intervals, each of length 1. Prove that some of the intervals can be removed so that those remaining are mutually disjoint and have total length 25. Note: For a b, the closed interval a; b := fx 2 R : a x bg has length b , a; disjoint intervals have empty intersection. 3. Prove that

1 1999 1 3 5 1997 2 4 6 1998 1: 44

261

in the form

pn , where p and q are polynomials with integer coe cients. qn

n X

The next set of problems are from the twenty-sixth annual United States of America Mathematical Olympiad written May 1, 1997. These problems are copyrighted by the Committee on the American Mathematical Competitions of the Mathematical Association of America and may not be reproduced without permission. Solutions, and additional copies of the problems may be obtained from Professor Walter E. Mientka, AMC Executive Director, 917 Oldfather Hall, University of Nebraska, Lincoln, NE, USA 68588 0322. As always, we welcome your original, nice" solutions and generalizations which di er from the published solutions.

Part I

May 1, 1997

9 a.m. - 12 noon

1. Let p1; p2; p3; : : : be the prime numbers listed in increasing order, and let x0 be a real number between 0 and 1. For positive integer k, de ne

8

xk = :

where fxg denotes the fractional part of x. The fractional part of x is given by x , bxc where bxc is the greatest integer less than or equal to x. Find, with proof, all x0 satisfying 0 x0 1 for which the sequence x0 ; x1 ; x2 ; : : : eventually becomes 0. 2. Let ABC be a triangle, and draw isosceles triangles BCD, CAE, ABF externally to ABC , with BC , CA, AB as their respective bases. Prove ! ! ! that the lines through A, B , C perpendicular to the lines EF; FD; DE , respectively, are concurrent. 3. Prove that for any integer n, there exists a unique polynomial Q with coe cients in f0; 1; : : : ; 9g such that Q,2 = Q,5 = n.

pk xk,1

if xk,1 = 0; if xk,1 6= 0;

262

Part II

1 p.m. - 4 p.m.

4. To clip a convex n-gon means to choose a pair of consecutive sides AB, BC and to replace them by the three segments AM , MN , and NC , where M is the midpoint of AB and N is the midpoint of BC . In other words, one cuts o the triangle MBN to obtain a convex n + 1-gon. A regular hexagon P6 of area 1 is clipped to obtain a heptagon P7. Then P7 is clipped in one of the seven possible ways to obtain an octagon P8, and so on. Prove that no matter how the clippings are done, the area of Pn is greater than 1=3, for all n 6. 5. Prove that, for all positive real numbers a; b; c, a3 + b3 + abc,1 + b3 + c3 + abc,1 + c3 + a3 + abc,1 abc,1:

is es

ai + aj ai+j ai + aj + 1 for all i; j 1 with i + j 1997. Show that there exists a real number x such that an = bnxc the greatest integer nx for all 1 n 1997.

As a third Olympiad for this issue we give selected problems of the 3rd Ukrainian Mathematical Olympiad, written March 26 and 27, 1994. My thanks go to Richard Nowakowski, Canadian Team leader to the IMO in Hong Kong for collecting the set.

1 2

1997

sat-

Selected Problems

March 26 27, 1994

1. class 9 A convex quadrangle ABCD is given. Bisectors of external angles of ABCD form a new quadrangle PQRS . Prove that sum of diagonals of PQRS is more than the perimeter of ABCD. 2. 9 10 A convex polygon and point O inside it are given. Prove that for any n ,,!there ! points,,!A2 ;,: : ; An on the sides of the polygon 1 exist A1; : such that OA1 + ,, 2 + : : : + OAn = !. OA O 3. 10 A sequence of natural numbers ak , k 1, such that for each k, ak ak+1 ak + 1993 is given. Let all prime divisors of ak be written for every k. Prove that we receive an in nite number of di erent prime numbers. 4. 10 Inside the triangle ABC the point D is given such that angles ABC and DBC are equal. Let K and L be the projections of D on lines AC and BD respectively. Prove that the midpoints of AB , CD and KL are collinear.

263 11 19942 squares 1 1 of k di erent colours are given. Find all natural numbers k for which it is always possible to construct a 1994 1994 square coloured symmetrically with respect to the diagonal from any collection of 19942 such squares. 6. 11 A mathematical olympiad consists of two days. The Jury intends to place the participants in rooms so that any two students will be in rooms with di erent numbers of participants in one of the days. Is it possible for a 9 participants? b 14 participants? The Jury has the necessary number of rooms. 7. 11 Three points P , Q and S in space are given. Two rays from P and two rays from Q are taken such that each ray from P intersects two rays from Q. Let A, B , C , D be the intersection points of these four rays. It is known that pyramid SABCD has a section KLMN of rectangular form K 2 SA, L 2 SB , M 2 SC , N 2 SD. The area of ABCD equals 1. Prove that the volume of SABCD is not larger than PQ=6. 8. 11 Two circles with radii R and r R r in the plane are tangent at point M with one circle inside the other. Chord AB of the bigger circle is tangent to the smaller circle. Find the largest possible value of the perimeter of ABM . Eagle-eyed readers Dan Velleman, Stan Wagon and Andy Liu spotted trouble with problem 4 of the Swedish Mathematics Contest 1993 as we gave it in the last number of the Corner. Indeed, as they point out, setting ab = 1 for all a, b satis es the conditions of the problem, but does not give a unique solution! I must not have been seeing stars when I proof-read that one. Here is the correct version to try. 1997: 196 To each pair of real numbers a and b, where a 6= 0 and b 6= 0, there is a real number a b such that

5.

a b c = a bc a a = 1:

264 In somewhat of a departure from past practice we now give the solutions given to the Canadian Mathematical Olympiad given earlier this issue! I hope you have solved them by now. The o cial solutions" provided for me by Daryl Tingley, University of New Brunswick, and Chair of the Canadian Mathematical Olympiad Committee of the Canadian Mathematical Society, feature solutions by contestants in the CMO itself. Each solution is credited to one of the contestants.

such that gcd x; y = 5! and lcm x; y = 50! ? Note: gcd x; y denotes the greatest common divisor of x and y , lcm x; y denotes the least common multiple of x and y , and n! = n n , 1 2 1. Solution by Deepee Khosla, Lisgar Collegiate Institute, Ottawa, ON Let p1 ; : : : ; p12 denote, in increasing order, the primes from 7 to 47. Then and

PROBLEM SOLUTIONS FOR THE 1997 CANADIAN MATHEMATICAL OLYMPIAD 1. How many pairs of positive integers x; y are there, with x y, and

5! = 23 31 51 p0 p0 p0 1 2 12

50! = 2a1 3a2 5a3 pb1 pb2 pb12 : 1 2 12 4 ; 32 ; 52 ; p ; : : : ; p Note that 2 1 12 all divide 50!, so all its prime powers di er

from those of 5! Since x; y j50!, they are of the form

x = 2n1 3n2 pn15 12 y = 2m1 3m2 pm15 : 12 Then maxni; mi is the ith prime power in 50! and minni; mi is the ith prime power in 5! Since, by the above note, the prime powers for p12 and under di er in 5! and 50!, there are 215 choices for x, only half of which will be less than y . Since for each choice of x, we have that y is forced and either x y or y x. So the number of pairs is 215=2 = 214. 2. The closed interval A = 0; 50 is the union of a nite number

of closed intervals, each of length 1. Prove that some of the intervals can be removed so that those remaining are mutually disjoint and have total length greater than or equal to 25. Note: For a b, the closed interval a; b := fx 2 R : a x bg has length b , a; disjoint intervals have empty intersection.

265 Solution by Byung-Kuy Chun, Harry Ainlay Composite High School, Edmonton, AB. Look at the rst point of each given unit interval. This point uniquely de nes the given unit interval. Lemma. In any interval x; x + 1 there must be at least one of these rst points 0 x 49. Proof. Suppose the opposite. The last rst point before x must be x , " for some " 0. The corresponding unit interval ends at x , " + 1 x + 1. However, the next given unit interval cannot begin until at least x + 1. This implies that points x , " + 1; x + 1 are not in set A, a contradiction. Therefore there must be a rst point in x; x + 1. Note that for two rst points in intervals x; x + 1 and x + 2; x + 3 respectively, the corresponding unit intervals are disjoint, since the intervals are in the range x; x + 2 and x + 2; x + 4 respectively. Thus, we can choose a given unit interval that begins in each of

0; 1 2; 3 : : : 2k; 2k + 1 : : : 48; 49: Since there are 25 of these intervals, we can nd 25 points which correspond to 25 disjoint unit intervals.

Solution by Colin Percival, Burnaby Central Secondary School, Burnaby, BC. S I prove the more general result, that if 0; 2n = i Ai ; jAi j = 1; Ai are intervals then 9 a1 : : : an , such that Aa Aa = ;. 2 Let 0 " n,1 and let bi = i , 12 + "; i = 1 : : : n. Then

i j

So all the bi are in 0; 2n . S Let ai be such that bi 2 Aa . Since Ai = 0; 2n , this is possible. Then since bi , bj = i , j 2+ " 2+ " 2 i j , and the Ai are intervals of length 1, min Aa , max Aa 2 , 1 , 1 = 0, so Aa Aa = ;. Substituting n = 25, we get the required result. 3. Prove that

i i j i j

1 1999

1 3 5 1997 2 4 6 1998

1: 44

266 Solution by Mihaela Enachescu, Dawson College, Montr al, PQ. e 1 3 : : : 1997 . Then 1 1 because 2 3 , 3 Let P =

So

2 4

3 5

1 3 : : : 1997 = 1 : 3 5 1999 1999 2 Also 1 3 because 1 3 2 2 , 3 4 because 3 5 4 4 , : : : , 2 4 5 1997 1998 because 1997 1999 = 19982 , 1 19982 . 1998 1999 2 4 : : : 1998 = 2 4 6 : : : 1998 1 . So P 3 5 1999 | 1 3 5 z 1997 1999

1

ON.

Hence P 2 44 : 1 1 Then 1 and 2 give 1999 P 44 . 4. The point O is situated inside the parallelogram ABCD so that

2

1 1999

=P

O0 A O B

C 0 It map ,!0 = ,!, and translationmappedmaps D to A. ,!will ,!. O ! O with , Consider a C will be which to B because CB = DA OO DA

267 This translation keeps angles invariant, so AO0 B = DOC = 180 , AOB. Therefore AOBO0 is a cyclic quadrilateral. And further, ODC = O0AB = O0 OB. But, since O0O is parallel to BC ,

Therefore

180

180

so

C Let AOB = and BOC = . Then COD = 180 , and AOD = 180 , . Since AB = CD parallelogram and sin = sin180 , , the sine law on 4OCD and 4OAB gives sin CDO = sin180 , = sin = sin ABO OC CD AB OA OA = sin ABO : OC sin CDO Similarly, the Sine Law on 4OBC and 4OAD gives sin CBO = sin = sin180 , = sin ADO OC BC AD OA OA = sin ADO : OC sin CBO

1

so

2

268 Hence

Since ADC = ABC parallelogram and ADO + CDO = ADC and ABO + CBO = ABC it follows that

1 cos ABO + CBO , cos ABO , CBO 2 = 1 cos ADO + CDO , cos ADO , CDO : 2 cos ABO , CBO = cos ADO , CDO:

There are two cases to consider. Case i: ABO , CBO = ADO , CDO. Since ABO+ CBO = ADO+ CDO, subtracting gives 2 CBO = 2 CDO so CBO = CDO, and we are done. Case ii: ABO , CBO = CDO , ADO. Since we know that ABO + CBO = CDO + ADO, adding gives 2 ABO = 2 CDO so ABO = CDO and CBO = ADO. Substituting this into 1, it follows that OA = OC . Also, ADO + ABO = CBO + ABO = ABC . Now, ABC = 180 , BAD since ABCD is a parallelogram. Hence BAD + ADO + ABO = 180 so DOB = 180 and D; O; B are collinear. We now have the diagram

O

180

Then COD + BOC = 180 , so BOC = = AOB . 4AOB is congruent to 4COB SAS, OB is common, AOB = COB and AO = CO, so ABO = CBO. Since also ABO = CDO we conclude that CBO = CDO.

,

n X

in the form pn , where p and q are polynomials with integer coe cients. qn Solution by Sabin Cautis, Earl Haig Secondary School, North York, ON. We rst note that

,1k n k Let S n = k2 + 9k2 + 26k + 24 . k=0

,

n X

Then

Sn =

,1k n! k k k=0 !n , k!k + 2! + 3k + 4
n X ,1kn + 4! k+1 = n + 1n + 2n + 3n + 4 : k=0 k + 4!n , k!

n X k=0

n X

Let

Now, for n 1, since

n X i=0

,1k

n + 4
k + 1
: k+4

,1i

n =0 i

1 , 1n =

n , n + n + : : : + ,1nn = 0: 0 1 2 n

270 Also

n X

n X 0 ,1i n i = ,1i i! i nn! i! + ,10 0! n!! i , n

i=0

i=1 n X

n X i=0

,1in

i=1 n X

j =0

Hence

Substituting j = k + 4, gives

n + 4
k + 1 T n = k+4 k=0 n X + 4
= ,1k+4 n + 4 k + 1 k k=0
n X k+4 n + 4 k + 1 = ,1 k+4 k=,4 n + 4
: , ,3 + 2n + 4 , 2

,1k

n X

T n =

n + 4
, 1 4n + 10 , n2 , 7n , 12 ,3 j 2 j =0 The rst two terms are zero because of results and so

,1j

n+4 X

j =0

n+4 X

271

2 T n = n + 3n + 2 : 2

Then

Therefore

Sn = n + 1n + T nn + 3n + 4 2 n2 + 3n + 2 = 2n + 1n + 2n + 3n + 4 = 2n + 1n + 1n + 2 n + 4 n + 2n + 3 1 = 2n + 3n + 4 : ,1k n 1 k = 2n + 3n + 4 : 3 + 9k 2 + 26k + 24 k=0 k

,

n X

That completes the Corner for this issue. Send me Olympiad contests and your nice solutions and generalizations for use in the Corner.

Congratulations!

The following contributors to CRUX with MAYHEM distinguishedthemselves at the 38th IMO held in Argentina: Name Florian Herzig Sabin Cautis Adrian Chan Byung Kyu Chun Mansur Boase Toby Gee Carl Bosley Country Austria Canada Canada Canada United Kingdom United Kingdom USA Award Gold Medal Bronze Medal Silver Medal Silver Medal Silver Medal Bronze Medal Gold Medal

CRUX with MAYHEM o ers hearty congratulations to these students. We trust that their participation in solving problems in CRUX with MAYHEM was a contributory factor in their successes.

272

BOOK REVIEWS

Edited by ANDY LIU

The Puzzle Arcade, by Jerry Slocum, published in 1996 by Klutz, 2121 Staunton Court, Palo Alto, CA 94306, USA., ISBN 0-888075-851-4, coil bound, 48 pages, US$20 plus handling. Quantum Quandaries, edited by Timothy Weber, published in 1996 by the National Science Teachers' Association, 1840 Wilson Boulevard, Arlington, VA 22201-3000, USA., ISBN 0-87355-136-2, softcover, 208 pages, US$7.95 plus handling. Reviewed by Andy Liu, University of Alberta. These two books are the most delightful additions to the literature of popular mathematics recently, and should appeal to everyone. Jerry Slocum, a retired executive in the aircraft industry, has a collection of mechanical puzzles numbering over 22000. The Puzzle Arcade features a very small portion of this amazing trove. The book is profusely illustrated with striking colours, and comes with several pockets containing either complete puzzles or equipment needed for others. Apart from the standard tangram-like puzzles, matchstick puzzles, topological entanglement puzzles, optical illusions, mazes and word puzzles, there are many unlikely to be familiar to the readers. The readers are asked to put together two identical polyhedral pieces to form a familiar object. This is perhaps the most annoying of the puzzles with only two pieces. A three-piece puzzle features Sam Loyd's tantalizing ponies. There is also a puzzle with four or ve pieces. With four, the readers can form the back of a playing card, but it takes all ve to come up with the King of Hearts. The list goes on and on, and the readers simply have to see the book to relish it. Hints and answers are provided. The publisher has done a fantastic job packing so much into a relatively compact o ering. Purchased separately, the puzzles will cost many times more than this bargain of a book! Timothy Weber of the NSTA is the managing editor of the magazine Quantum. It is the sister publication of the Russian magazine Kvant, a Russian word which means quantum. About two-thirds of the material in Quantum are translated from Kvant, the rest being original contributions in English. About two-thirds of the material are mathematical, the rest being in physics. It is published six times a year by Springer-Verlag New York Inc., P.O.Box 2485, Secaucas, NJ 07096-2485, USA.. Student subscription at US$18 per volume is a steal. One of the most popular columns in Quantum is the Brainteasers. There are ve in each issue, usually four in mathematics and one in physics. Many are presented in whimsical style, and there are always the most delightful

273 cartoon illustrations. Quantum Quandaries, a pocket-sized book, contains the rst 100 Brainteasers and their solutions. Each Brainteaser is on one page, with its solution overleaf for easy reference. Additional cartoon illustrations are provided by Sergey Ivanov. The only regret is that the book is in black-and-white, whereas the original presentation in the magazine was in full colour. We conclude this review with a sample Brainteaser. Solve the alphametic equation where letters stand for di erent digits if and only if they are di erent.

USA+USSR=PEACE

What are the parametric equations, and the range of the parameter, of the following curve? 6

274

A Fermat-Fibonacci Collaboration

K.R.S. Sastry

Fermat begins

Fermat the mischievous proposed the impossible: Find three squares in arithmetic progression AP , the common di erence cd being a square, Dickson 1 pp. 435 . Throughout this paper we deal with integer squares but, we nd that, what is impossible for squares is possible for triangles: 6, 21, 36 are triangular numbers in AP with cd of 15 also being triangular! Let us see how we can generate triples of triangular numbers in AP whose cd is also triangular. Curiously, the supplier is Fibonacci! 1 We recall that the nth triangular number is given by Tn = nn + 1. 2 We also note that 8Tn + 1 = 2n + 12 is a perfect square, an odd square to be exact. Simply retrace the preceding steps to see that the converse, every odd square leads to a triangular number, holds. Furthermore, multiplying each term of an AP by 8 and then adding 1 to them results in a new AP , but the new cd is just eight times the old. Take an example: AP : 2, 7, 12 results in the AP : 17, 57, 97 with cd's of 5 and 40: 1 The upshot of all this is that the triangular numbers in AP can be made to depend on the square numbers in AP .

Suppose the squares x2 , y 2, z 2 are in AP . Then x2 + z 2 = 2y 2. We may assume x, y , z are relatively prime in pairs and that x y z holds. Hence x and z are both odd. Put x = p , q , z = p + q where p and q are relatively prime integers having opposite parity. Then we have the famous Pythagorean relation p2 + q 2 = y 2 whose primitive solutions are well known: p = m2 , n2, q = 2mn, y = m2 + n2. Here m and n are relatively prime integers with opposite parity. This yields x = jm2 , n2 , 2mnj; y = m2 + n2; z = m2 , n2 + 2mn: 2 The cd: y 2 , x2 , equals 4mnm2 , n2. This cannot be a square in view of Fermat's proof of the fact mnm2 , n2 , the area of the Pythagorean right-angled triangle with sides m2 , n2, 2mn, m2 + n2 cannot be a square Dickson 1 pp. 615-616 .

275

Suppose the triangular numbers

are in AP . Then

8Ta + 1 = 2a + 12 = A2; 8Tb + 1 = 2b + 12 = B 2; 8Tc + 1 = 2c + 12 = C 2 ;

A = jm2 , n2 , 2mnj; B = m2 + n2; C = m2 , n2 + 2mn: 3 The cd of the AP squares A2 , B 2, C 2 is 4mnm2 , n2 . Therefore, from the remark in 1, the triangular numbers Ta , Tb , Tc in AP have cd:

The very form of this cd suggests that we choose m2 , n2 = mn 1. In that case the cd: would be triangular. Thus we seek, in natural numbers, the solution of the equation

m2 , n2 = mn 1:

Fibonacci enters

Before solving the equation m2 , n2 = mn 1, let us recall the Fibonacci sequence by Binet's formula

k k Fk = 1 + 52k+ 1 , 5 ; k = 1; 2; 3; : p5

4

to the reader to deduce the following relations:

p! p! 1+ 5 k+ 1, 5 k: Lk = Fk,1 + Fk+1 = 5 2 2 Now consider the solution of the equation m2 , n2 = mn 1, put in the form 2m , n2 , 5n2 = 4. The rst few trial solutions of the equation 2m , n2 , 5n2 = ,4 are 2m , n 1 4 11

n m

1 2 1 3 5 8

It is already apparent that 2m , n = L2k,1 , m = F2k , n = F2k,1 , k = 1, 2, 3, . Direct calculations using 4 and 5 show that We leave the veri cation to the reader. Likewise the rst few trial solutions of the equation are

2m , n2 , 5n2 = 4

n 1 3 8 m 2 5 13 This time we observe that 2m , n = L2k , m = F2k+1 , n = F2k and again

we leave the veri cation that to the reader.

2m , n 3 7 18

L2k , 5F22k = 4; k = 1; 2; 2

A numerical example

Choose the solution m = 8, n = 5. Then from 3, we have

277 This yields a = 20, b = 44, c = 59, Ta = 210, Tb = 990, Tc = 1770 in AP 1 whose cd, 780 = 3940, is triangular too. The reader may have spotted 2 a like parity solution m = 5, n = 3. This makes a, b, c non-integral, since A, B, C are even. This happens when m = F6i,1, n = F6i,2, i = 1; 2; , a fact easily shown by induction.

Fermat concludes

The next question to settle would be: Are there three pentagonal numbers in AP whose cd is pentagonal? The cases that have been settled are n = 3 and n = 4, instances of the general problem: For what values of n are there three n-gonal numbers in AP whose cd is n-gonal too? It may be recalled that the rth n-gonal number is For n

2 pn; r = n , 2 r2 , n , 4 r ; n 3; r = 1; 2; 3; : 2

Reference

1 L.E. Dickson, History of the Theory of Numbers, Vol. II, Chelsea, NY, 1971, pp. 1-39, 435, 615-616. 2943 Yelepet Dodballapur 561 203 Karnataka, India

278

No. 23 R.E. Woodrow

This number we give the problems of the 1995 Prince Edward Island Mathematics Competition. Thanks go to Gordon MacDonald, University of Prince Edward Island, organizer of the contest, for supplying us with the problems, and the solutions which we will give next issue. gure.

1. Find the area of the shaded region inside the circle in the following

6 1

,1

1-

2. I will be n years old in the year n ", said Bob in the year 1995. How old is Bob? 3. Draw the set of points x; y in the plane which satisfy the equation jxj + jx , yj = 4. 4. An autobiographical number is a natural number with ten digits

2

, ?1

or less in which the rst digit of the number reading from left to right tells you how many zeros are in the number, the second digit tells you how many 1's, the third digit tells you how many 2's, and so on. For example, 6; 210; 001; 000 is an autobiographical number. Find the smallest autobiographical number and prove that it is the smallest.

279

5. A solid cube of radium is oating in deep space. Each edge of the cube is exactly 1 kilometre in length. An astronaut is protected from its radiation if she remains at least 1 kilometre from the nearest speck of radium. Including the interior of the cube, what is the volume in cubic kilometres of space that is forbidden to the astronaut? You may assume that the volume of a sphere of radius r is 4 r3 and the volume of a right circular cylinder of 3 radius r and height h is r2 h. 6. Which is greater, 999! or 500999? Where 999! denotes 999 factorial, the product of all the natural numbers from 1 to 999 inclusive. Explain your reasoning.

Several readers wrote about the error in the solution of Problem 2a of the Manitoba Contest 1995 1995: 219 . 2. a Find two numbers which di er by 3 and whose squares di er by 63. Corrections by Jamie Batuwantudawa, student, Fort Richmond Collegiate, Winnipeg, Manitoba; by Paul Olivier Dehaye, Brussels, Belgium; and by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA. The solution of the equations 6x + 9 = 63 or 6x + 9 = ,63 is obvious: x = 9 or x = ,12, and not x = 7 or x = ,8 as given.

Next we give solutions for the problems of the Twelfth W.J. Blundon Contest, written February 22, 1995, 1997: 218 219 .

February 22, 1995

1. a From a group of boys and girls, 15 girls leave. There are then left two boys for each girl. After this, 45 boys leave. There are then 5 girls for each boy. How many boys and how many girls were in the original group? Solution. Call the number of boys b and the number of girls g . When 15 girls leave b = 2g , 15. After 45 boys leave 5b , 45 = g , 15. So b = 25b , 45, b = 10b , 450, 9b = 450, b = 50; g , 15 = 50=2 = 25 and g = 40. Thus the total number of boys and girls was originally 90.

280 b A certain number of students can be accommodated in a hostel. If two students share each room then two students will be left without a room. If three students share each room then two rooms will be left over. How many rooms are there? Solution. Let s be the number of students and r the number of rooms. At two students per room 2r = s , 2. Consider three per room, then 3r , 2 = s. Now 2r = 3r , 2 , 2 so r = 8. There are 8 rooms and 18 students.

x y 19 + 95 = 1? Solution. Note that 95 = 19 5. For x = 1; 2; : : : ; 18 we have y = 1 , x = 19 , x = 95 , 5x ; 95 19 19 95 giving a solution. There are then 18 such pairs. 3. A book is to have 250 pages. How many times will the digit 2 be

used in numbering the book? Solution. Two is used once in each decade in the one's place for a total of 25 such occurrences. It is used 10 times in each hundred in the ten's place for another 30 occurrences. And it occurs 51 times in the hundred's place, for a grand total of 25 + 30 + 51 = 106 times.

p

q p p q p p x2 = 7 + 48 + 2 7 + 48 7 , 48 + 7 , 48 = 14 + 2p49 , 48 = 16

Thus x = 4, as x 0. b Determine the largest prime factor of 9919. Solution. Considering the units digit we are led to try 7 as a factor, yielding 9919 = 7 1417. We are now led to try for a factor of 1417 ending in 3 or 9 less than 38, since 382 = 1444, and 1417 = 13 109. Since 109 is prime, the answer is 109.

281

5. A circle is inscribed in a circular sector which is one sixth of a circle of radius 1, and is tangent to the three sides of the sector as shown. Calculate the radius of the inscribed circle. Solution.

r r r

Call the radius of the inscribed circle r. The central angle is 1 360 = 6 60 , so each small triangle is a r30 , 60 , 90 right triangle. The hypotenuse, 3 h, has length h = r sin 30 = 2 . So r + h = 1 gives 2 r = 1, and r = 2 . 3 6. Determine the units digit of the sum

626 + 333 + 545 : Now 6n 6 mod 10 for n 1 and 8 3 n 1 mod 4 3n 9 n 2 mod 4 ; so 333 3 mod 10: 7 n 3 mod 4 : 1 n 4 mod 4 Finally 5n 5 mod 10 for n 1. Hence 2626 + 3333 + 4545 6 + 3 + 5 4 mod 10 and the last digit is 4. 7. Find all solutions x; y to the system of equations x + y + x = 19 y

xx + y = 60: y

and x + y = 4 or x + y = 15. 4 If x + y = 4, x = 60, we get x = 60y , and 61y = 4, so y = 61 and y x = 240 . 61 If x + y = 15, x = 5 giving y = 3, x = 12. y , 4 The solutions for x; y are 240 ; 61 and 12; 3. 61 8. Find the number of di erent divisors of 10800. Solution. Now 10800 = 9 12 100 = 24 33 52 . The factors must be of the form 2a 3b 5c where 0 a 4, 0 b 3 and 0 c 2, so the number of factors is 5 4 3 = 60. 9. Show that n4 , n2 is divisible by 12 for any positive integer n 1. Solution. Now n4 , n2 = n , 1n2n + 1. In any three consecutive numbers, at least one is divisible by 3. Also if n is even, 4 divides n2 , and if n is odd, both n 2 1 and n + 1 are even so 4 divides n2 , 1. In either case , 4 divides n4 , n and we are done. 10. Two clocks now indicate the correct time. One gains a second every hour, and the other gains 3 seconds every 2 hours. In how many days will both clocks again indicate the correct time? Solution. There is a bit of a problem about whether the clock is a 12 hour or 24 hour clock. Let us assume a 12 hour clock in each case. The rst clock will gain 12 hours in 12 60 60 hours, or 1800 days, which is the rst time it will again,tell the correct time. The second clock will gain 12 hours in 12 60 60 3 hours, or 1200 days. At the end of 3600 days they will 2 both tell the correct time. That completes the Corner for this number. I need suitable exam materials, and would welcome your suggestions for the evolution of this feature of Crux with Mayhem.

x + y + x 60 y = 19; +

x = 60 so y x+y

x + y 2 , 19x + y + 60 = 0

283

MATHEMATICAL MAYHEM

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, Yale University, PO Box 208283 Yale Station, New Have, CT 06520 8283 USA. The electronic address is still mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

Playful Palindromes

What are palindromes? They are any sort of objects which are the same when read backwards or forwards. An example of a palindromic word is NOON. An example of a palindromic sentence is ABLE WAS I ERE I SAW ELBA, accredited to Napoleon. Here we concentrate on palindromic numbers such as 12321, and henceforth the word palindrome will refer to palindromic numbers. Quickly work out the following problems. 1. How many two digit palindromes are there? 2. How many three digit palindromes are there? 3. How many palindromes are there from 0 to 1998? 4. How many n-digit palindromes are there? Consider the cases when n is even and odd. Palindromic Sums Ask a friend to pick a positive integer. Tell this friend to reverse the digits of the integer and add it to the original. If the sum is not a palindrome then take the sum's reverse and add it to itself. Continue doing this until the sum is a palindrome.

284

Examples

139 + 931

1070 + 0701 1771 It is clear that if all the digits are less than 5 then the process terminates after the rst step. The second example shows that a number with a digit greater than 5 can also have a palindromic sum.

Now try these examples: 1. 1990 2. 89 3. 196 Answers 1. 68486 2. 8813200023188 3. No one has yet found the answer! Unsolved Problem Is it true that every integer has a palindromic sum that is, the process will eventually terminate? This is an example of where better algorithms and faster computers will not help. Even if a super-fast computer with terabytes of memory were to nd the solution of 196, this leaves the problem open still as we do not know that ALL integers have a palindromic sum. Perhaps for the eager reader, an attempt should be made to classify as much as possible those numbers which DO have palindromic sums. We have already made one such class of numbers, namely those whose digits are all less than 5. Are there any other classes of numbers that guarantee to give palindromic sums?

We present here some web sites which may be of interest to the mathematical web surfer: Kiran Kedlaya's Math Competition Archive, with copies of old USAMO, IMO, and Putnam papers, and many links to other related sites.

http: www.math.toronto.edu mathnet http: www.math.princeton.edu ~kkedlaya competitions.html

285 U of T Mathnet. A collection of material for high school students and teachers. Sloane's On-line Sequence Dictionary. Thanks to Ben Chia, ex Cedarbrae C.I.

http: www.research.att.com ~njas sequences

Cyrus Hsia

While programming on the computer, a couple of my friends, Peter Plachta and Jacob Mouka noticed some interesting patterns. One such pattern came about as follows: Stumped on a hard programming problem, they tried examining their output. Through the complex mess of numbers, they 1 noticed that the decimal expansion of fractions, of the form p , where p is a prime number other than 2 or 5 always had a repeating decimal pattern. Furthermore, this repeating pattern appeared immediately after the decimal point. For example, 1 = 0:3. With many such examples generated on 3 the computer, they conjectured that this must be the case for all primes p, p 6= 2; 5. In fact, their conjecture is correct. We will show this result and some interesting generalizations. But rst let us give some de nitions so that there will be no ambiguity in their meaning. The decimal expansion of a fraction is of the form where the sequence b1 : : : bm repeats inde nitely. We write a bar over it to indicate that it repeats, that is,

De nition 1.1. The repeating part in a decimal expansion is the number that is, the sequence of digits b1 : : : bm under the bar. The astute reader would notice that the bar could have been placed one decimal place over, as 0:a1 a2 : : : an b1b2 : : : bm b1, or that a bar could have been placed over twice the above sequence and still give the same value. So to make this de nition unambiguous, we will always mean the earliest and smallest such pattern 1 after the decimal point. Finally, we will say that fractions, like 2 , that terminate do not have a repeating part. De nition 1.2. With the above de nition of the repeating part in mind, the leading part is the number that is, the sequence of digits a1 : : : an immediately following the decimal point before the repeating part. Note that fractions may not have a leading part, as in 1 . 3

286 Finally, let us call a number good if it is relatively prime to 10, that is it is not divisible by 2 or 5. With these de nitions, let us show that the conjecture above is true by rst proving some simple results that we need. We will assume from now on that we are looking at the decimal expansions of 1 , where p is a good prime. p Lemma 1.3. The decimal expansion of 1 , where p is a good prime, must have p 1 a repeating part, that is, p = 0:a1 a2 : : : an b1 : : : bm , m 1. Proof. Left to the reader as an exercise. Lemma 1.4. If 0:a1 a2 : : : an b1 : : : bm is the decimal expansion of a fraction, then an 6= bm . Proof. Left to the reader as an exercise. Lemma 1.5. For a decimal expansion,

which we write

in short form. Proof. Left to the reader as an exercise. Now with these lemmas we can prove the conjecture. Conjecture 1.6. Peter Plachta and Jacob Mouka The fraction 1 in decimal notation consists only of a repeating part that p is, it has no leading part if p is a good prime. 1 Proof. Assume on the contrary that p = 0:a1 a2 : : : an b1 : : : bm , where n 1, so that there is at least one digit in the leading part. Case I: m = 0, that is, the decimal expansion terminates. Then but p is good, so this is not possible. Case II: m 1. Then

a1 : : : an + b1 : : : bm 10n 10n10m , 1

1 = a1 : : : an + b1 : : : bm p 10n 10n 10m , 1 by Lemma 1.5. Multiplying both sides by 10n 10m , 1p, we get 10n 10m , 1 = p 10m , 1a1 : : : an + b1 : : : bm = p 10m a1 : : : an + b1 : : : bm , a1 : : : an :

287 Since n 1, 10 j 10n10m , 1, so 10 divides the right hand side of the equation. In particular, since m 1,

Why does the fraction have to have a prime as its denominator? The prime is what makes the particular types of fractions of Conjecture 1.6 have no leading part. Then a natural question to ask is whether the converse holds, that is, given a decimal expansion with only a repeating part, is the denominator in its fractional representation a prime. To see that the converse does not hold, look at the decimal expansion of 1 , which is 0:1. It has only 9 a repeating part but the denominator is not prime. It is not the fact that the denominator is a prime that makes Conjecture 1.6 true as the following theorem will show. 1 Theorem 1.7. For all positive integers N 1, N in decimal notation has a repeating part but no leading part if and only if N is good. First, we need a result that most of the readers will already be familiar with. In fact, it has popped up a number of times in olympiad and preolympiad type problems. Consider the numbers Mi consisting of i digits made up entirely of 1's, for example, M1 = 1, M2 = 11, M3 = 111. Then we have: Lemma 1.8. For any good positive integer N , N divides some Mi . Proof. Consider the N + 1 numbers M1 , M2 , : : : , MN +1 modulo N . Then by the Pigeonhole Principle, at least two of the Mi 's are congruent, say Mj Mk mod N , where j k. Then we have

Mj Mk mod N 11 : z : 1 11 : z : 1 mod N : : | |

j k

11 : z : 1 00 : z : 0 0 mod N : | : | 11 : z : 1 0 mod N : : |

This can be done since neither 2 nor 5 divides N . This means that Mj ,k is divisible by N . Proof of Theorem 1.7. 1 Only if part If N has a repeating part but no leading part, then we have by Lemma 1.5. Cross-multiplying, we get 10m ,1 = N 10m,1 b1 + +bm . Thus N is good.

j ,k j ,k k

288 If part If N is good, then by Lemma 1.8 there is an M = Mi divisible by N . Let M = kN , where k is an integer, k 1. We have then

1 = k = k = 9k = 9k : N M 11 : z : 1 99 : z : 9 10i , 1 : : | |

i i

Hence,

This means that 9k is at most an i-digit number; that is, 9k can be written as b1 : : : bi, where some of the bi 's can be 0. Thus as required. Now it is time for the readers to roll up their sleeves and tackle some problems. Exercises 1.1 Prove Lemmas 1.3, 1.4, and 1.5. 1.2 a Show that any fraction of the form a in lowest terms, where a and b are positive integers, a b, also has bno leading term if and only if b is good. b Show that a holds even when a b and with the same conditions. Thus a = a1 a2 : : : an :b1 : : : bm if and only if b is good. b 1.3 Related exercise Find the smallest positive integer n such that

n3 + 9n2 + 9n + 7

1996

in decimal notation terminates that is, it has no repeating part, just a nite leading part. 1.4 Related exercise Write a computer program to nd the repeating part 1 in a fraction of the form p , where p is a prime. To nish o , fractions with denominators that have factors of 2 and 5 still need to be considered. In fact, it turns out that there is a nice relationship between the number of factors of 2 and 5 in the denominator and the number of terms in the leading part of its decimal representation. 1 Lemma 2.1. If N is of the form 2k M , where M is good, then N has k terms in its leading part, and it has a repeating part if M 1.

289

5 Proof. If M = 1 then it is obvious that 21 = 10 has k terms in the leading part and no repeating part. If M 1, then we have

k k k

k

5 By Exercise 1.2, we have M = a1 : : : an :b1 : : : bm . Dividing through by 1 10k and noting N is less than 1, we must have n k. Now once we show that an 6= bm, then we are nished, as then

If an = bm then

1 = 1 5k = 0: 0 : : : 0a : : : a b : : : b : 1 n 1 m | z N 10k M k terms

!

contradicting Exercise 1.2 that a fraction has a repeating part if and only if the denominator is good. 1 Lemma 2.2. Similarly, if N is of the form 5k M , where M is good, then N has k terms in its leading part, and it has a repeating part if M 1. Proof. Similar in fact identical to the proof of Lemma 2.1. Now for the grand nale... Theorem 2.3. If N is of the form 2k 5l M , where again M is good, then the 1 fraction N has maxk; l terms in the leading part, and if M 1 then it also has a repeating part. Proof. Once again, this just takes from material shown before. If k or l equals 0, then the result becomes Lemma 2.2 or 2.1. If k = l, then the result is immediate, and in fact the leading part has k = l 0's. If k l 1, then we have 2 51 M = 10 2 1, M . By Lemma 2.1, we have k , l terms in the leading part of 2 ,11 M . Dividing by 10l just shifts the decimal point l places to the left giving k , l + l = k terms in the leading part and similarly l terms for l k 1. More Exercises 2.1 Exploration In our long analysis, we have shown not on purpose, that the length of the leading part can be determined. However, the length of the repeating part was never discussed. Determine any relationships between the numbers in the fraction and the length of the repeating part in its decimal representation. 2.2 a If we had 6 ngers 3 on each hand?, then perhaps our system of counting would be in base 6. In general, if the base was pq , where p

k l l k l k

290 and q are distinct primes, then show an analogous result to the above theorems. b Do the same for any base B . 2.3 More down to earth problem Of the numbers 1995, 1996, : : : , 1999, which number has the greatest number of terms in the leading part of its reciprocal? With this, we hope you will be a leading part in this year!

Acknowledgements Peter Plachta and Jacob Mouka, 3rd year students, University of Toronto at Scarborough, for the conjecture.

An Ambivalent Sum

Naoki Sato

A conditionally P convergent series an is a series which converges, but such that the series jan j diverges. One of the most famous examples of such a series, which appears in textbooks everywhere, is the following:

P

A basic, but unusual property of conditionally convergent series is that we may rearrange the terms, so that the sum comes out to be any value we wish see Calculus, 3rd Ed., M. Spivak, pp. 476-8, so we must be careful when manipulating the terms in determining the sum. For example, a question of the 1954 Putnam asks to verify that Same terms, di erent sum. These results suggest a generalization, and the form of the alternating harmonic series makes for an elegant analysis. For positive integers r and s, let

1 1 , 1 + 3 , 1 + 1 , 1 + = ln2: 2 4 5 6

1 1 1 1 1 + 1 , 2 + 1 + 7 , 1 + 1 + 11 , 6 + = 3 ln2: 3 5 4 9 2

Sr; s = 1 + 1 + + 2r 1 1 , 1 , 1 , , 21s 3 , |2 4 z | z

s terms

291 A rst step in summing S r;s will be looking at its partial sums, so let Sn r; s be the sum of the rst nr + s terms of S r; s. Assume for the moment that r s. Then,

Snr; s =

where

1 1 + 1 + + 2r 1 1 , 2 + 1 + + 21s 3 , 4 1 + 1 + + 1 + 2r + 1 2r + 3 4r , 1 1 + 1 + + 1 + , 2s + 2 2s + 4 4s 1 1 1 + 2n , 1r + 1 + 2n , 1r + 3 + + 2nr , 1 1 , 2n , 1 s + 2 + 2n , 1 s + 4 + + 2ns 1 1 1 + + 1 , 1 , 1 , , 1 = 1+ 3 2r , 1 2 4 2r 1 + 1 + + 1 , 1 , 1 , , 1 +2 4 2r 2 4 2s 1 + 1 + + 1 + 2r + 1 2r + 3 4r , 1 , 2r 1 2 , 2r 1 4 , , 41r + + 1 + 1 + + 1 , 1 , 1 + 2r + 2 2r + 4 4r 2s + 2 2s + 4 1 + , , 4s + 2n , 1 r + 1 + 2n , 1 r + 3 + + 2nr1, 1 1 1 1 1 1 , 2n , 1r + 2 , 2n , 1r + 4 , , 2nr 1 + 2n , 1 r + 2 + 2n , 1 r + 4 + + 2nr 1 1 1 , 2n , 1 s + 2 , 2n , 1 s + 4 , , 2ns 1 1 1 = A2nr + 2ns1+ 2 + 2ns1+ 4 + 2ns1+ 6 + + 2nr 1 = A2nr + 1 ns 1 1 + ns 1 2 + ns 1 3 + + nr ; 2 + + +

1 1 An = 1 , 1 + 3 , 1 + + ,1n+1 n : 2 4

292

1 We may estimate a more general sum by integrals. Since y = x is decreasing on 0; 1, for 0 d a,

a+md 1 x dx a

a+m,1d 1 x dx a,d

so that

1 ln a + md

d nr + 1
ln ns + 1

a,d

if you are not sure why these inequalities are true, draw a graph. So, plugging in a = ns + 1, d = 1, m = nr , s, we obtain

Note that we could have also used the well-known result where is Euler's constant. Finally, we have that

The case r s is argued similarly the case r = s is obvious, and we obtain the same value. We make some observations: 1 The value S r;s depends only on the ratio r=s, as can be predicted. 2 The case r = 1, s = 4, produces the intriguing-looking formula

1 1 1 1 1 1 , 1 , 1 , 1 , 8 + 1 , 10 , 12 , 14 , 16 + = 0: 2 4 6 3

293 4 Going back to a result mentioned above, to rearrange the terms of a conditionally convergent series so that it sums to a given value, say S , we use the following algorithm: Assuming S 0, we successively add the rst positive terms of the series until we go over S ; then we add the rst negative terms of the series until we go under S , and so on if S 0, we merely start with the negative terms. In fact, this is the idea behind the proof. The nature of the conditionally convergent series guarantees this algorithm produces a series with sum S . It has been observed that if we try this with the alternating harmonic series, the number of positive terms and negative terms taken each time becomes constant. We can see this is because of 3; that is, any real number can be approximated by a sum S r;s.

The J.I.R. McKnight Problems Contest is a problem solving contest in Scarborough, Ontario. It began in 1975 in honour of one of Scarborough's nest Mathematics teachers and continues today as a scholarship paper for senior students. This paper, although tailored to students taking OAC Ontario Academic Credit Mathematics courses, contains many problems that are accessible to all high school students. With some ingenuity, most problems reveal some very beautiful results and we hope our readers will enjoy this as well. 1. Verify that 13! = 1122962 , 798962. 2. Show that, for any real numbers x, y , and z , 3. Sum to k terms the series whose nth term is

2 2 x + yz x + y + z 2: 2

n4 + 2n3 + n2 , 1 : n2 + n

may be resolved into factors linear in x and y , p must be a root of the equation p2 + 4ap + 2a2 + 6 = 0. 5. Find the sum of all 3 digit odd numbers that can be made using the digits 1, 3, 5, 7, 8, 9, where no repeated digits are used in any number.

294 6. Find a cubic function f x with the following properties: a It is a curve passing through 1; 1. b The tangent to the curve at 1; 1 has slope 1. 1 c The sum of the roots of its corresponding equation is 5 . d The sum of the squares of the roots of its corresponding equation is 121 . 25

Qualifying Round

1. Solve the following system of equations in 5 unknowns:

ab bc cd de ea

= = = = =

1; 2; 3; 4; 6:

2. Show that if n is an odd natural number, then is divisible by 29. 3. Find all positive numbers x such that

n12 , n8 , n4 + 1

x8,3x x7 : 4. ABC is an isosceles triangle with AB = AC . Choose a point D on the side AB , and a point E on AC produced through C , such that AD + AE = AB + AC . Show that DE BC . 5. The numbers 1, 2, : : : , 9, are placed in a 3 3 grid, so that no row, no

column and neither of the two major diagonals contains a sequence of numbers ordered by size either increasing or decreasing. Show that the number in the central square must be odd. 6. A woman, who is not yet 100 years old, and one of her grandchildren have the same birthday. For six years in a row, the woman's age was a multiple of her grandchild's age. How old was the woman on the sixth of these birthdays?

295

Final Round

1. Let A and B be two arbitrary points inside a circle C . Show that there always exists a circle through A and B which lies completely inside C . 2. The squares in a 3 7 grid are coloured either blue or yellow. Consider all rectangles of m n squares in this grid, where 2 m 3, 2 n 7. Show that at least one of these rectangles has all four of its corner squares the same colour. 3. Show that if a and b are positive numbers, then

a + 1
b+1 a
b : b+1 b 4. Find positive integers p and q such that all the roots of the polynomial x2 , px + q x2 , qx + p

where a, b, and c are natural numbers. 6. The numbers a1 , a2 , : : : , a14 are positive integers. It is known that

14 X

Show that the numbers a1 , a2 , : : : , a14 consist of the numbers 1, 2, : : : , 7 each taken twice.

i=1

ai = 6558:

296

1983 Final Round

1. The positive integers are added in groups as follows: 1, 2+3, 4+5+6, 7 + 8 + 9 + 10, and so on. What is the sum of the nth group? Solution by Bob Prielipp, University of Wisconsin-Oshkosh, Oshkosh, WI, USA. Let Tk = kk +1=2 be the kth triangular number. Then the n numbers in the nth group are Tn,1 + 1, Tn,1 + 2, : : : , Tn,1 + n = Tn . Using the formula where S is the sum of a nite arithmetic progression, a is the rst term, l is the nal term, and n is the number of terms in the progression, the desired sum is

S = na2+ l ;

n Tn,1 + 1 + Tn = n 2

n,1n + 1 + nn+1

2

3+ =n 2 n:

Mayhem Problems

The Mayhem Problems editors are: Richard Hoshino Mayhem High School Problems Editor, Cyrus Hsia Mayhem Advanced Problems Editor, Ravi Vakil Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only problems | the next issue will feature only solutions. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions from the previous issue be submitted by 1 October 1997, for publication in the issue 5 months ahead; that is, issue 2 of 1998. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions from others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

297

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca H225. In Cruxmayhemland, stamps can only be bought in two denominations, p and q cents, both of which are at least 31 cents. It is known that if p and q are relatively prime, the largest value that cannot be created by these two stamps is pq , p , q . For example, when p = 5 and q = 3, one can a x any postage that is higher than 15 , 5 , 3, or 7 cents, but not 7 cents itself. The governor of Cruxmayhemland tells you that 1997 is the largest value that cannot be created by these stamps. Find all possible pairs of positive integers p; q with p q . H226. In right-angled triangle ABC , with BC as hypotenuse, AB = x and AC = y, where x and y are positive integers. Squares APQB, BRSC , and CTUA are drawn externally on sides AB, BC , and CA respectively. When QR, ST , and UP are joined, a hexagon is formed. Let K be the area of hexagon PQRSTU . a Prove that K cannot equal 1997. HINT: Try to nd a general formula for K . b Prove that there is only one solution x; y with x y so that K = 1998.

H227. The numbers 2, 4, 8, 16, : : : , 2n are written on a chalkboard. A student selects any two numbers a and b, erases them, and replaces them by their average, namely a+b=2. She performs this operation n,1 times until only one number is left. Let Sn and Tn denote the maximum and minimum possible value of this nal number, respectively. Determine a formula for Sn and Tn in terms of n. H228. Verify that the following three inequalities hold for positive reals x, y , and z : i xx , y x , z + y y , xy , z + z z , xz , y 0 this is

ii x4 + y 4 + z 4 + xyz x + y + z 2x2 y 2 + y 2z 2 + z 2x2 , iii 9xyz + 1 4xy + yz + zx, where x + y + z = 1. Can you derive an ingenious method that allows you to solve the problem without having to prove all three inequalities directly? known as Schur's Inequality,

298

Advanced Problems

Editor: Cyrus Hsia, 21 Van Allan Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu A201. Consider an in nite sequence of integers a1, a2, : : : , ak, : : : with the property that every m consecutive numbers sum to x and every n consecutive numbers sum to y . If x and y are relatively prime then show that all numbers are equal. A202. Let ABC be an equilateral triangle and , its incircle. If D and E are points on AB and AC , respectively, such that DE is tangent to ,, show that

8th Iberoamerican Mathematical Olympiad, Mexico '93 A203. Let Sn = 1+ a + aa + + aa , where the last term is a 1tower of n , 1 a's. Find all positive integers a and n such that Sn = na , . A204. Given a quadrilateral ABCD as shown, with AD = p3, AB + CD = 2AD, A = 60 and D = 120 , nd the length of the

:::a Sn n

AD + AE = 1: DB EC

120

p3

A

60

Editor: Ravi Vakil, Department of Mathematics, Princeton University, Fine Hall, Washington Road, Princeton, NJ 08544 1000 USA vakil@math.princeton.edu C73. Proposed by Matt Szczesny, 4th year, University of Toronto. 1 X The sequence fan g consists of positive reals, such that an diverges.

n=1

an diverges, where s is the nth partial sum, that is, Show that n n=1 sn sn = a1 + a2 + + an.

1 X

299

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 1 "11" or A4 sheets of paper. 2 These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 March 1998. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

Correction Problem 2235 1997: 168 was incorrectly attributed to Walther Janous, Ursulinengymnasium, Innsbruck, Austria, when it was in fact proposed by D.J. Smeenk, Zaltbommel, the Netherlands. The editor apologizes for this error.

There has been an increase in the number of solutions sent in by FAX, either to the Editor-in-chief's departmental FAX machine in St. John's, Newfoundland, or to the Canadian Mathematical Society's FAX machine in Ottawa, Ontario. While we understand the reasons for solvers wishing to use this method, we have found many problems with it. The major one is that hand-written material is frequently transmitted very badly, and at times is almost impossible to read clearly. We have therefore adopted the policy that we will no longer accept submissions sent by FAX. We will, however, continue to accept submissions sent by email or regular mail. We do encourage email. Thank you for your cooperation.

300 Proposed by Victor Oxman, University of Haifa, Haifa, Israel. In the plane, you are given a circle but not its centre, and points A, K , B , D, C on it, so that arc AK = arc KB and arc BD = arc DC . Construct, using only an unmarked straightedge, the mid-point of arc AC . 2252. Proposed by K.R.S. Sastry, Dodballapur, India. Prove that the nine-point circle of a triangle trisects a median if and only if the side lengths of the triangle are proportional to its median lengths in some order. 2253. Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is a triangle and Ib, Ic are the excentres of 4ABC relative to sides CA, AB respectively. Suppose that Ib A2 + Ib C 2 = BA2 + BC 2 and that Ic A2 + Ic B 2 = CA2 + CB2. Prove that 4ABC is equilateral. 2254. Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is an isosceles triangle with AB = AC . Let D be the point on side AC such that CD = 2AD. Let P be the point on the segment BD such that APC = 90 . Prove that ABP = PCB . 2255. Proposed by Toshio Seimiya, Kawasaki, Japan. Let P be an arbitrary interior point of an equilateral triangle ABC . Prove that j PAB , PAC j j PBC , PCB j. 2256. Proposed by Russell Euler and Jawad Sadek, Department of Mathematics and Statistics, Northwest Missouri State University, Maryville, Missouri, USA. If 0

2251.

2257. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. The diagonals AC and BD of a convex quadrilateral ABCD intersect at the point O. Let OK , OL, OM , ON , be the altitudes of triangles 4ABO, 4BCO, 4CDO, 4DAO, respectively. Prove that if OK = OM and OL = ON , then ABCD is a parallelogram.

301

2258. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. In a right-angled triangle ABC with C = 90 , D lies on the segp ment BC so that BD = AC 3. E lies on the segment AC and satis es p3. Find the angle between AD and BE. AE = CD 2259. Proposed by Paul Yiu, Florida Atlantic University, Boca Raton, Florida, USA. Let X , Y , Z , be the projections of the incentre of 4ABC onto the sides BC , CA, AB respectively. Let X 0 , Y 0 , Z 0 , be the points on the incircle diametrically opposite to X , Y , Z , respectively. Show that the lines AX 0 , BY 0, CZ 0, are concurrent. 2260. Proposed by Vedula N. Murty, Andhra University, Visakhapatnam, India. Let n be a positive integer and x 0. Prove that

1 + xn+1 n +n1 n

n+1

x:

2261.

Proposed by Angel Dorito, Geld, Ontario. Assuming that the limit exists, nd

!

Proposer's comment: this problem was suggested by Problem 4 of Round 21 of the International Mathematical Talent Search, Mathematics and Informatics Quarterly, Vol. 6, No. 2, p. 113. 2262. Proposed by Juan-Bosco Romero M arquez, Universidad de Valladolid, Valladolid, Spain. Consider two triangles 4ABC and 4A0 B 0 C 0 such that A 90 and 0 90 and whose sides satisfy a b c and a0 b0 c0 . Denote the A altitudes to sides a and a0 by ha and h0a . Prove that a

302

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 2145. 1996: 170 Proposed by Robert Geretschlager, Bundesrealgymnasium, Graz,nAustria. n Y, k,1 Y ,ak + bn,k for all a, b 1. Prove that ak + b Editor's composite solutionbased on the nearly identical solutionssubmitted by almost all the solvers. Note that if n is odd, then both sides have the positive factor

k=1

k=1

n + 1
a + b

2

,1 2

bn=2c , Y

k=1

k=1

,

bn=2c , Y

1

implies bk,1 bn,k . Thus, 2 follows immediately. Solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut, USA; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; KEE-WAI LAU, Hong Kong; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; L. RICE, University of Toronto Schools, Toronto, Ontario; KRISTIAN SABO, student,

303 Osijek, Croatia; JOEL SCHLOSBERG, student, Hunter College High School, New York NY, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH, Mount Royal College, Calgary, Alberta; PANOS E. TSAOUSSOGLOU, Athens, Greece; EDWARD T.H. WANG, Wilfrid Laurier University, Waterloo, Ontario; and the proposer. Several solvers noted that the given conditions can be relaxed to a 0 or even a 1 and b 1. This is obvious from the proof above.

ABC is a triangle with AB AC , and the bisector of A meets BC at D. Let P be an interior point on the segment AD, and let Q and R be the points of intersection of BP and CP with sides AC and AB respectively. Prove that PB , PC RB , QC 0.

2146.

Solution by the proposer. Let E be a point on AB such that AE = AC . Then we get 4AEP 4ACP , so that AEP = ACP and PE = PC . Since BEP = 180 , QCP 180 , ACB ABC EBP , we have PB PE = PC . Because AE = AC AB, we obtain ABP AEP = ACP . Since BAP = PAC , we have APR = ACP + PAC ABP + BAP = APQ. Let F be a point on AB such that APF = APQ, then APF APR, so F is between A and R, and 4APF 4APQ, so that AF = AQ, PF = PQ and AFP = AQP . Therefore, AR AF = AQ. In addition, ARP = RPB + RBP = RPB + ABQ and

We consider 2 cases. Case I: BAC 90 : Because RPB ARC 90 BAC , we have PR PQ. Let G be a point on PR such that PG = PQ and H a point on PB such that PH = PC . Then 4PGH 4PQC ; thus we get GH = QC . As BRG RAC 90 , we get GB RB, so BH GB , GH RB , GH . Hence

PFR = PQC = BQC = BAC + ABQ: If RPB = BAC; ARP = PFR; so PR = PF = PQ; if RPB BAC; ARP PFR; so PR PF = PQ; if RPB BAC; ARP PFR; so PR PF = PQ:

PB , PC = BH RB , QC:

304

Case II: BAC 90 : Then there exists a point O on AD such that BOC = 180 , BAC . i If O coincides with P , we have RPB = BAC and so PR = PQ. We take a point J on PB such that PJ = PC . Then 4PRJ 4PQC , thus RJ = QC: Because BJ RB , RJ = RB , QC , we have PB , PC RB , QC . ii If P is between A and O, then BPC BOC = 180 , BAC , so RPB = 180 , BPC BAC and from above, PR PQ. We take a point K on PQ such that PK = PR and a point M on PC produced beyond C such that PM = PB PC . Let T be the intersection of KM and QC . As 4PKM 4PRB , we get KM = RB and PKM = PRB, so QKM = ARP = RPB + RBP = RPB + ABQ BAC + ABQ = BQC: Therefore, QKT KQT , thus KT QT . Hence RB , QC = KM , QC = KT + TM , QT + TC = KT , QT + TM , TC TM , TC: As TM , TC CM = PB , PC , we obtain RB , QC PB , PC . iii If P is between O and D, then BPC BOC = 180 , BAC , so RPB = 180 , BPC BAC . Thus, from the above, PR PQ. We take points X and Y on PR and PB , respectively, such that PX = PQ and PY = PC . Then 4PXY 4PQC , so XY = QC . As BPC BOC = 180 , BAC , we have QPR + RAQ 180 , thus ARP + AQP 180 : Since AQP ARP , we get ARP 90 , so BRP 90 ; hence RB XB . Therefore, Y B XB , XY RB , XY = RB , QC . Thus PB , PC = Y B RB , QC .

1996: 171 Proposed by Hoe Teck Wee, Singapore. Let S be the set of all positive integers x such that there exist positive integers y and m satisfying x2 + 2m = y 2. a Characterize which positive integers are in S . b Find all positive integers x so that both x and x + 1 are in S .

2147.

305 Solution by Thomas Leong, Staten Island, NY, USA. a We show that S = fx : x = 2r , 2s ; r s 0; r; s 2 Z . g First suppose that x2 + 2m = y 2 with x positive. Then 2m = y 2 , x2 = y + xy , x, and so y + x = 2r and y , x = 2s where r s 1 s 6= 0 since x and y are of the same parity. Thus 2x = 2r , 2s , or x = 2r,1 , 2s,1 where r , 1 s , 1 0. Conversely, if x = 2r , 2s with r s 0, then with m = r + s + 2 and y = 2r + 2s , we have x2 + 2m = y 2. b The desired set is fx : x = 2r , 2; r 2 or x = 2r , 1; r 1g. Now every odd number in S is of the form 2r , 1, r 1. If x + 1 2 S is odd, then x + 1 = 2r , 1 and x = 2r , 2 are both in S provided r 2. If x 2 S is odd, then x = 2r , 1 and x + 1 = 2r = 2r+1 , 2r are both in S provided r 1. Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; THEODORE n CHRONIS, student, Aristotle University of Thessaloniki, Greece; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; KEITH EKBLAW, Walla Walla, Washington, USA; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; DAVID HANKIN, Hunter College Campus Schools, New York, NY, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV Y, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI KONECN LAU, Hong Kong; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; GIOVANNI MAZZARELLO, Florence, Italy and IAN JUNE GARCES, Ateneo de Manila University, Manila, The Philippines; MICHAEL PARMENTER, Memorial University of Newfoundland, St. John's, Newfoundland; HEINZJURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH, Mount Royal College, Calgary, Alberta; LAWRENCE SOMER, The Catholic University of America, Washington, DC; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece; KENNETH M. WILKE, Topeka, Kansas, USA; and the proposer. There were 6 incorrect or incomplete solutions. KONECNY remarks the similarity between this problem and problem 13, page 162 of Introduction to Number Theory by W.W. Adams and L.J. Goldstein, which claims that the Diophantine equation x2 , y 2 = mk is solvable for x; y for any given m; k 3. In the present problem m = 2 and x and y are interchanged. Several solvers described S in terms of the binary expansions of its members: namely any positive integer in S has a block of 1s followed by a possibly empty block of 0s.

306

2148. 1996: 171 Proposed by Aram A. Yagubyants, Rostov na Donu, Russia. Suppose that AD, BE and CF are the altitudes of triangle ABC . Suppose that L, M , N are points on BC , CA, AB , respectively, such that BL = DC , CM = EA, AF = NB. Prove that: 1. the perpendiculars to BC , CA, AB at L, M , N , respectively are concurrent; 2. the point of concurrency lies on the Euler line of triangle ABC .

Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let H be the orthocentre and O the circumcentre. Re ect H in O to get a point H 0 on OH , and let L0 , M 0 , N 0 be the feet of the perpendiculars from H 0 onto BC , CA and AB , respectively. If X , Y , Z denote the midpoints of BC , CA, AB , then HD k OX k H 0 L0 and similarly for the other sides. As HO = OH 0 we have DX = XL0 and, together with XC = XD + DC = BL0 + L0 X 0= BX , yields that DC = BL0 . Hence from the de nition of L and since L is also an interior point of BC , we have L = L0 and analogously0 M = 0M 0 and N 0 = N 0 . The perpendiculars to the sides of the triangle LH ; MH , and NH intersect at H 0 , which lies on the Euler line HO of 4ABC , as we wanted to prove. Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; L. RICE, Woburn CI, Scarborough Ontario; TOSHIO SEIMIYA, Kawasaki, Japan; SHAILESH SHIRALI, Rishi Valley School, India; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer. One solution was incomplete. Several readers reduced the result to the theorem, attributed sometimes to Steiner and sometimes to Carnot, that appeared recently in CRUX with MAYHEM 1997: 122 in an alternative solution to problem 2120. Although this approach leads to a nice solution here, it takes more work to set up the machinery than to solve the problem without it.

2149. 1996: 171 Proposed by Juan-Bosco Romero M arquez, Universidad de Valladolid, Valladolid, Spain. Let ABCD be a convex quadrilateral and O is the point of the intersection of the diagonals AC and BD. Let A0 B 0 C 0 D0 be the quadrilateral whose vertices, A0 , B 0 , C 0 , D0 , are the feet of the perpendiculars drawn from the point O to the sides BC , CD, DA, AB , respectively. Prove that ABCD is an inscribed cyclic quadrilateral if and only if A0 B0C 0D0 is a circumscribing quadrilateral A0 B0, B0C 0, C 0D0, D0 A0 are tangents to a circle.

307 Solution by D.J. Smeenk, Zaltbommel, the Netherlands with notation modi ed by the editor Assume ABCD is cyclic. We denote:

DBA = DCA = ; ACB = ADB = ; BDC = BAC = ; CAD = CBD = : Because of the right angles at C 0 and D0 , AD0 OC 0 is cyclic, so that OD0 C 0 = OAC 0 0= . Likewise BD0OA00 is0 cyclic, so that A0D0 O = A0 BO = . Thus D O is the bisector of 0 A0 D0 C00. Arguing in this manner we conclude that the angle bisectors of A B C D all pass through O and,

therefore, that this quadrilateral has an incircle. For the converse assume that A0 B 0 C 0 D0 has an incircle and obtain A, B, C , D as the appropriate intersection points of the0 lines through A0 perpendicular to OA0 , through B 0 perpendicular to OB , etc. We are to show that ABCD is cyclic and O is the point where AC and BD intersect. We denote:

with

In a similar way,

C 0 DO = and ODB0 = ; B0CO = and OCA0 = ; A0 BO = and OBD0 = : Consider the quadrangle AOCD. We have OAD + ADC + DCO + COA = 2;

that is,

analogously, O lies also on BD, so that O is the desired intersection point. Finally, opposite angles have the sum thus ABCD is cyclic.

+ + + + COA = 2: 2 Equations 1 and 2 imply COA = , so that O lies on AC . Arguing

BAD + DCB = + + + = ;

308 Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, and MARIA ASCENSION LOPEZ CHAMORRO, I.B. Leopoldo Cano, Valladolid, Spain with two proofs of the only if" portion; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK only if" portion; TOSHIO SEIMIYA, Kawasaki, Japan; SHAILESH SHIRALI, Rishi Valley School, India; and the proposer. FLORIAN HERZIG, student, Perchtoldsdorf, Austria commented that the only if" portion follows immediately from problem 3 in the 1990 Canadian Mathematical Olympiad, CRUX 1990; 161, 198 . Seimiya added a warning that the parenthetical comment appended to the statement of the problem actually leads to a di erent result which turns out to be not quite correct; if the lines A0 B 0 ; B 0 C 0 ; C 0 D0 ; D0 A0 are tangents to a circle then it is not always true that ABCD is an inscribed quadrilateral. For a counterexample, let BAC + BDC = , and BAC 6= =2. If T is the point where AB intersects CD, then T , A, O, D are concyclic, so that by Simson's theorem, B 0 , C 0 , D0 are collinear. The incircle of 4A0 B 0 D0 is tangent to the lines A0 B 0 , B 0 C 0 , C 0 D0 , D0 A0 ; yet A, B , C , D are not concyclic.

2150.

1996: 171 Proposed by Sefket Arslanagi c, Berlin, Germany. Find all real solutions of the equation

p

I. Solution by Kee-Wai Lau, Hong Kong. By squaring both sides of the equation and simplifying we obtain

1 2

,1 = 42x2 , 1 1 , x2:

8y 3 , 4y , 1 = 0 or 2y + 14y 2 , 2y , 1 = 0:

1 + 5 and x = 5 , 5 . For the negative Since y is positive, y = 4 p 8 value of x, both 2x2 , 1 and 2x 1 , x2 are negative and so cannot be a solution. For 0 x 1 the continuous function

p1 , x , 2x2 , 1 + 2xp1 , x2

309 is positive when x = 0 and negative when x = 1. Thus the function vanishes at least once in the interval 0; 1 . We conclude that the only solution of the s

5 , 5. equation is x = 8

41 , 2x2 1 , x2 = 1: Since x lies between ,1 and 1, we may set x = sin , p where ,=2 =2. Then we get 41 , 2 sin2 1 , sin2 = 1, or equivalently, 42 cos2 , 1 cos = 1. Now the equivalent cubic equation 8 cos3 , 4 cos , 1 = 0 can be rewritten as 2 cos + 14 cos2 , 2 cos , 1 = 0:

II. Solution by David Doster, Choate Rosemary Hall, Wallingford, Connecticut, USA. Squaring both sides of the given equation and simplifying the resulting equation yields p

1 + 5 . Thus sin = 10 , 2 5 . Since cos 0, we must have cos = 4 4 Sincep the positive solution satis es the original equation, we have only p x = 10 , 2 5 . , incidentally, is =5. 4

Also solved by NIELS BEJLEGAARD, Stavanger, Norway; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; THEODORE CHRONIS, student, Arisn totle University of Thessaloniki, Greece; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; RUSSELL EULER, NW Missouri State University, Maryville, Missouri, USA; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; DAVID HANKIN, Hunter College Campus Schools, New York, NY, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; AMIT KHETAN, Troy, MI, USA; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; BEATRIZ MARGOLIS, Paris, France; J.A. MCCALLUM, Medicine Hat, Alberta; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; L. RICE, University of Toronto Schools, Toronto, Ontario; KRISTIAN SABO, student, Os ijek, Croatia; CRISTOBAL SANCHEZ RUBIO, I.B. Penyagolosa, Castellon, Spain; HEINZ-JURGEN SEIFFERT, Berlin, Germany; SKIDMORE COLLEGE PROBLEM GROUP, Saratoga Springs, New York, USA; D.J. SMEENK, Zaltbommel, the Netherlands; DIGBY SMITH, Mount Royal College, Calgary, Alberta; DAVID R. STONE, Georgia Southern University, Statesboro, Geor-

310 gia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece; NISHKA VIJAY, student, Mount Allison University, Sackville, New Brunswick; EDWARD T.H. WANG, Wilfrid Laurier University, Waterloo, Ontario; and the proposer. There were 2 incorrect solutions. Most solvers who used a trigonometric approach began immediately with the statement that ,1 x 1, and then used either a sine or cosine substitution. This assumes that we are restricting our attention to an equation with real values, but we are told only that the variable x must be real-valued. Only HANKIN explicitly showed that there were no real-valued solutions to be found outside the above range.

4ABC is a triangle with B = 2 C . Let H be the foot of the perpendicular from A to BC , and let D be the point on the side BC where the excircle touches BC . Prove that AC = 2HD.

2151.

Solution by Cristobal S anchez Rubio, I.B. Penyagolosa, Castellon, Spain. Let s = a + b + c=2 be the semiperimeter of 4ABC ; we have b + CD = c + BD = s, so that

DC = s , b = a , b + c=2: Let C 0 be the image of A under the rotation about B through the angle 180 , B. Because 4ABC 0 is isosceles, from the condition B = 2 C it follows that CAC 0 is also isosceles so that HC = a + c=2. Finally, HD = HC , DC = a + c , a , b + c = b = AC :

2 2 2 2

Also solved by MIGUEL AMENGUAL COVAS, Cala Figuera, Mallorca, Spain; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; GEORGI n DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; D. KIPP JOHNSON, Beaverton, OR, USA; MARIA ASCENSION LOPEZ CHAMORRO, I.B. Leopoldo Cano, Valladolid, Spain; LUIZ A. PONCE, Santos, Brazil; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer. Many solvers used the fact that B = 2 C is equivalent to the condition b2 = cc + a, which has appeared before in CRUX: 1976: 74 , 1984: 278 , and 1996: 265 267 . For a recent problem concerning integer sided triangles with B = 2 C see the solution to problem 578 in The College Math J. 28:3 May, 1997 233 235. Further references are given there.

311

2152. 1996: 217 Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. n X Let n 2 and 0 x1 : : : xn be such that sin xk = 1. 2 k=1 Consider the set Sn of all sums x1 + : : : + xn . 1. Show Sn is an interval. 2. Let ln be the length of Sn. What is nlim ln ? !1

I. Solution by Florian Herzig, student, Perchtoldsdorf, Austria. 1. First I prove that

Since the graph of sin x is concave down for x 2 0; =2 , the chord joining the points 0; sin 0 and =2; sin =2 lies below the graph. Hence since this chord has slope 2=

1 n arcsin n x1 + x2 + + xn : 2

2x sin x

The left-hand side follows immediately from Jensen's inequality, since sin x is concave down for x 2 0; =2 and 0 x1 + + xn =n =2: Next I will show that the set Sn of all sums x1 + x2 + + xn is the interval

1 n arcsin n ; : 2 First let 0 x y arcsin A be such that sin x + sin y = A, where 0 A 1 is xed. I prove that x + y is a continuous function f depending on x only: for each value of x there is exactly one value of y such that all

conditions are ful lled, since

sin y = A , sin x 2 0; A if and only if y = arcsinA , sin x: Thus f x = x + arcsinA , sin x. It is clear that f is continuous for x 2 0; arcsin A .

312 Now we consider the following process. Initially let x1 = = xn = arcsin1=n so that P sin xi = 1 . In the rst step keep x3 ; : : : ; xn constant and vary x1 ; x2 such that sin x1 + sin x2 remains constant and x1 becomes zero. Thereby sin x1 + sin x2 + + sin xn remains constant equal to 1 throughout and x1 + x2 + + xn varies continuously because of the previous result. In the second step keep x1 = 0, x4 ; : : : ; xn constant and vary x2 and x3 as before, with x2 ! 0. Again x1 + x2 + + xn varies continuously. It is clear now how to vary the xi step by step such that in the end x1 = x2 = = xn,1 = 0 and as a consequence xn = =2. As we see, x1 + + xn has varied continuously from n arcsin1=n to =2. Hence 1 ; : Sn = n arcsin n 2 2. By l'H^ pital's rule, o

1
lim ln = nlim , n arcsin n n!1 !1 2 , lim arcsin x = 2 x!0 x = , x!0 p 1 2 2 lim 1 , x = , 1: 2

II. Solution by Thomas C. Leong, The City College of City University of New York, New York, NY, USA. Equivalently, we consider the set Y = fy = y1; : : : ; yn j 1 y1 yn 0; y1 + + yn = 1g Rn and the image f Y of Y under f y = arcsin y1 + + arcsin yn . Note that Sn = f Y . 1. Since Y is a connected subspace of Rn and f is a continuous function, the image f Y R is also connected, and we know that the only connected subspaces of R are intervals. Thus Sn is an interval. 2. Since arcsin x is convex in 0; 1 , we can use the majorization inequality. Since

Editor's note: here x y means that x is majorized by y; see for example page 45 and then Theorem 108, page 89 of Hardy, Littlewood and Polya's Inequalities ,

1 ; 1 ; : : : ; 1 y ; y ; : : : ; y 1; 0; : : : ; 0 1 2 n n n n

313 with equality when y1; : : : ; yn is equal respectively to 1=n;: : : ; 1=n and 1; 0; : : : ; 0. Thus ln = , n arcsin1=n and 2

Also solved by KEITH EKBLAW, Walla Walla, Washington, USA; and RICHARD I. HESS, Rancho Palos Verdes, California, USA. 1996: 217 Proposed by Sefket Arslanagi c, Berlin, Germany. Suppose that a, b, c 2 R. If, for all x 2 ,1; 1 , jax2 + bx + cj 1, prove that

2153.

jcx2 + bx + aj 2:

Solution virtually identical by Florian Herzig, student, Perchtoldsdorf, Austria, and Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let f x = ax2 + bx + c and g x = cx2 + bx + a. Then by assumption ja + b + cj = jf 1j 1, ja , b + cj = jf ,1j 1 and jf 0j 1. Hence

2 2

Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; GEORGI DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; DIGBY SMITH, Mount Royal College, Calgary, Alberta; and the proposer. There was one incorrect solution. Several solvers pointed out that this is not a new problem. Herzig cited the book International Mathematical Olympiad 1978 1985 published by the Mathematical Association of America, 1986. Chronis gave the reference Selected Problems and Theorems in Elementary Mathematics | Arithmetic and Algebra by D.O. Shklyarsky, N.N. Chentov, and I.M. Yaglom exercise 304 on page 60. Demizev and Kunchev remarked that it can be found as problem 86 on page 35 of the book Mathematics Competitions by L. Davidov,

314 V.Petnob, I. Tonov, and V. Chukanov So a, 1977. Bellot Rosado mentioned that the same problem was proposed during the 2nd round of the 1996 Spanish Mathematical Olympiad. Janous remarked that the problem can be restated as Prove that if px is a real polynomial of degree 2 satisfying the condition that jp2xj 1 for all x 2 ,1; 1 , then jx2 p1=xj 2 for all x 2 ,1; 1 ." Ed: x p1=x is to be written as a polynomial before substituting values of x. He then ventured the following conjecture: Conjecture: If px is a real polynomial with degree n such that jpxj 1 for all x 2 ,1; 1 then jxn p1=xj 2n for all x 2 ,1; 1 . Can any reader prove or disprove this? 1996: 217 Proposed by K.R.S. Sastry, Dodballapur, India. In a convex pentagon, the medians are concurrent. If the concurrence point sections each median in the same ratio, nd its numerical value. A median of a pentagon is the line segment between a vertex and the midpoint of the third side from the vertex.

2154.

B E0 C

D0

A P

C0 E B0

AP = BP = CP = DP = EP = : PA0 PB0 PC 0 PD0 PE0 Then set D0 E 0 = 1. Since D0 , E 0 are midpoints of AB , BC , respectively, we have AC = 2D0 E 0 = 2, and D0 E 0 k AC . Since DP = EP = ; PD0 PE0 we have D0 E 0 k DE and DE=D0 E 0 = , so that DE = D0E0 = : 1

I Solution by Toshio Seimiya, Kawasaki, Japan. Let the convex pentagon be ABCDE , and let A0 , B 0 , C 0 , D0 , E 0 be the midpoints of CD, DE , EA, AB , BC , respectively. We assume that AA0 , BB0 , CC 0, DD0 , EE0 are concurrent at P , and that

A0

2 A0 C 0 = AC = : 2 Since AC k D0 E 0 and D0 E 0 k DE , we get AC k DE , and since A0 , C 0 are midpoints of CD, AE , respectively, we have AC + DE = 2A0C 0:

Therefore we have from 1 and 2

from which we have 2 + 2 , 4 = 0. Thus we obtain = 5 , 1. II Solution by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. We will use the same notation as used by Seimiya above. Each boldface letter represents the vector to that point from the origin. Then we have D0 = 1 A + B, E0 = 1 B + C, etc. There must exist real numbers ; 0, 2 2 with + = 1, such that P = A + A0 = B + B0 = C + C0 = D + D0 = E + E0 : Now D + D0 = A + A0 2 D + A + B = 2 A + C + D; 3 A + A0 = B + B0 2 A + C + D = 2 B + D + E: 4 Equation 4 can be simpli ed to 2 A + C = 2 B + E 2 B , A = C , E; which implies that AB k EC . Similarly, BC k AD; CD k BE; DE k CA; EA k DB: 5 Now equation 3 can be written as: 2 D + A , 2 A , D = C , B; 2 , D , A = C , B: On the other hand from 5 we have 2 C , B = D , A: Hence, 2 D,A = C , B = C , B;

4 2 + = ;

2 ,

2 , = 4 2,2 , 2 = 4 2 , 2 1 , , 1 , 2 = 5 2 = =

2 0 0 1 p

5 5:

: = : 1 , = 1 : 5 , 1

Also solved by SAM BAETHGE, Nordheim, Texas, USA; MIHAI CIPU, Romanian Academy, Bucharest; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, n Spain; GEORGI DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka Schoolof Mathematics, Rousse, Bulgaria; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; RICHARD I. HESS, Rancho Palos Verdes, California, USA; D. KIPP JOHNSON, Valley Catholic High School, Beaverton, Oregon; HEINZ-JURGEN SEIFFERT, Berlin, Germany; and the proposer. Seimiya also observes the following: 1. If four medians are concurrent at a point P , then the fth median also passes through P . 2. We assume that ve medians are concurrent at a point P . If any three medians are divided at P into the same ratio : 1, then the other two medians are divided at P into the same ratio : 1. 3. This gure is an image of a regular pentagon by an a ne transformation.

2155. 1996: 218 Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. Prove there is no solution of the equation

in which y is odd and x; y; z are positive integers with highest common factor 1. Find a solution in which y = 15, and x and z are also positive integers. Solution by D. Kipp Johnson modi ed slightly by the editor, Valley Catholic High School, Beaverton, Oregon, USA.

1 + 1 = 1 x2 y8 z2

1 + 1 = 1 where t is odd. 1 x2 t2 z2 1 can be written as z 2 x2 + t2 = x2 t2 , which shows that x2 + t2 must be a square. From well known results, we then have x = k2uv , t = ku2 , v 2, where k 2 N is odd, and u, v are relatively prime integers of opposite parity

with u

v. Substituting into 1 and simplifying gives zu2 + v2 = 2kuvu2 , v2: 2 Since u2 + v 2 is odd, z = 2w for some w 2 N and 2 becomes wu2 + v2 = kuvu2 , v2: 3 Since u; v = 1, u2 + v 2; uv = 1. Furthermore, u2 + v 2; u2 , v 2 = 1 since if p is a prime such that pju2 + v 2, u2 , v 2, then pj2u2 , 2v 2 implies pj2u2; 2v2. But 2u2; 2v2 = 2u; v22 =22 and clearly p = 2 2 u22+ v2 is 6 as odd. This is a contradiction. Hence u + v jk. Letting k = j u + v , then 3 becomes w = juvu2 , v2 where j 2 N is odd. Therefore, we may choose u, v subject to the stated conditions and arbitrarily odd j 2 N to nd the general solution of the original equation, which is given

by:

x = 2juvu2 + v2; y4 = t = j u2 , v2u2 + v2; z = 2juvu2 , v2: Since x; y;z = 1, we must have j = 1 and so y 4 = u4 , v 4, which is

impossible by Fermat's Last Theorem. To nd a solution in which y = 15, let

y4 = 154 = 34 54 = j u , vu + vu2 + v2: 4 Since u , v , u + v , and u2 + v 2 are pairwise relatively prime, and the left side of 4 contains only two distinct prime factors, u , v = 1 and 4 becomes 154 = j 2v + 12v2 + 2v + 1: 5 From 5 we see that 154 4v 3 and so v 24 resulting in 2v + 1 49. Now, 2v +1 is odd and the only odd factors of 154 which are less than 49 are 3, 5, 9, 15, 25 and 45 with corresponding values of v = 1, 2, 4, 7, 12, and 22. A quick check shows that only in the case v = 1 is 2v 2 + 2v + 1 also a factor of 154. Thus u = 2 and 5 gives j = 33 53 = 3375 resulting in the

unique solution:

318 Also solved both parts by WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria, and the proposer. The second part of the problem was also solved by GEORGI DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria jointly; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; RICHARD I. HESS, Rancho Palos Verdes, California, USA; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; and DIGBY SMITH, Mount Royal College, Calgary, Alberta. All these solvers gave the same solution 67500; 15; 40500. However, most of their proofs" erred in assuming that gcdx; y; z = 1 implies that x, y , z are pairwise relatively prime. Furthermore, Johnson was the only one who gave a completely valid proof for the uniqueness of the solution when y = 15, though Janous found this to be the case by using DERIVE. Both Hess and Klamkin considered the given equation without the restriction that y be odd and x; y;z = 1. Hess observed that an in nite family of solutionsis given by x = 2mnm2 + n24 m2 , n23 , y = m4 , n4, and z = 2mnm2 + n23m2 , n324 where m, n 2 N with m 2 n while Klamkin gave the family: x = 22 3 54 n4, y = 15n, z = 2 34 53 n4 . Both formulas yield the solution given above when m = 2 and n = 1.

ABCD is a convex quadrilateral with perpendicular diagonals AC and BD. X and Y are points in the interior of sides BC and AD respectively such that BX = BD = DY : CX AC AY Evaluate BC XY : BX AC BZ = BX = DY = BD
AZ CX AY AC that XZ and AC as well as ZY and BD are parallel, which, considering AC ? BD, implies that 4XY Z is a right triangle with legs XZ and Y Z . Thus XZ = XZ AC BD = BZ AZ AB = 1 ZY AC BD ZY AB BZ AZ where XZ=AC = BZ=AB and BD=ZY = AB=AZ by similar triangles while AC=BD = AZ=BZ by the de nition of Z . This means that 4XY Z

Solution by Gottfried Perz, Pestalozzigymnasium, Graz, Austria. Let Z be the point in the interior of side AB such that BZ : AZ = BX : CX . Then it follows from

2156.

p XY : ZX = 2 : 1

BC XY = AC XY = XY = p2: BX AC ZX AC ZX

Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Val ladolid, Spain; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; GEORGI n DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; TOSHIO SEIMIYA, Kawasaki, Japan; HEINZ-JURGEN SEIFFERT, Berlin, Germany; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer. Bellot comments that facts about orthodiagonal quadrilaterals can be found in Jordan Tabov, Simple properties of the orthodiagonal quadrilaterals, Matematyka & Informatyka, 1:1 1991 1 5. Janous, using rectangular coordinates, shows that if the angle from AC to BD were , then

BC XY = 2 sin : BX AC 2

1996: 218 Proposed by Sefket Arslanagi c, Berlin, Germany. 19971996 , 1 is exactly divisible by 19972 . Prove that 2 I. Solution by Theodore Chronis, student, Aristotle University of Thessaloniki, Greece. From the Fermat-Euler theorem we have a'm 1mod m, for every a; m such that gcda; m = 1. We also have 'pk = pk,1 p , 1, when p is a prime number. So '19972 = 1997 1996 and 2'19972 1mod 19972. II. Solution by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. We have '1997 = 1996 = 22 499. Furthermore, 2449 1585mod 1997 and 22449 ,1mod 1997. Hence 2 is of order 1996 modulo 1997; that is

2157.

320 But

1997 := 219971996 , 1 2 , 1 + 1 , 1 = + 11997 , 1 = 1996 = 1 + 1997 + 1997 2 + 1997 3 + + 1997 , 1 2 3 3 = 1997 + 1997 f; where f is an integer. Thus 0mod 19972, but 6 0mod 19973.

Also solved by MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; n MIHAI CIPU, Romanian Academy, Bucharest, Romania; GEORGI DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; D. KIPP JOHNSON, Valley Catholic High School, Beaverton, Oregon; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; THOMAS LEONG, Staten Island, NY, USA; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; CAN ANH MINH, University of California, Berkeley, California; SOLEDAD ORTEGA and JAVIER GUTIERREZ, students, Universidad de La Rioja, Logro~ o, Spain; YOLANDA n PELLEJERO, student, Universidad de La Rioja, Logro~ o, Spain; ROBERT n P. SEALY, Mount Allison University, Sackville, New Brunswick; HEINZJURGEN SEIFFERT, Berlin, Germany; and the proposer. It is interesting to note that only Janous and Manes addressed the question of exact" divisibility; that is, they showed that no higher power of 1997 than 2 would work.

Crux Mathematicorum

Mathematical Mayhem

321

No. 13 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7

Mathematics Competitions

There are many mathematical competitions at many di erent levels. There is in fact a journal devoted to this. It is called Mathematics Competitions, and is the Journal of the World Federation of National Mathematics Competitions. It is published by the Australian Mathematics Trust, and information on it can be obtained by contacting them at PO Box 1, Belconnen, ACT 2616, Australia. The journal covers all sorts of mathematical competitions, and articles not only give problems and solutions, but also cover the philosophy of competition and alternative ways of stimulating talented students. The World Federation also makes two awards, the David Hilbert International Award which recognises contributions of mathematicians who have played a signi cant role over a number of years in the development of mathematical challenges at the international level and which have been a stimulus for mathematical learning, and the Paul Erdos National Award which recognises contributions of mathematicians who have played a signi cant role over a number of years in the development of mathematical challenges at the national level and which have been a stimulus for the enrichment of mathematics learning.

322

No. 184 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. We begin this number with the problems of the Mock Test for the International Mathematical Olympiad team of Hong Kong. My thanks go to Richard Nowakowski, Canadian Team Leader, for collecting them at the 35 IMO in Hong Kong.

th

Hong Kong Committee | Mock Test, Part I

Time: 4.5 hours

1. In 4ABC , we have C = 2 B. P is a point in the interior of 4ABC satisfying AP = AC and PB = PC . Show that AP trisects the angle A.

th th th th th th

2. In a table-tennis tournament of 10 contestants, any two contestants meet only once. We say that there is a winning triangle if the following situation occurs: i contestant defeated j contestant, j contestant defeated k contestant, and k contestant defeated i contestant. Let Wi and Li be respectively the number of games won and lost by the i contestant. Suppose Li + Wj 8 whenever the i contestant beats the j contestant. Prove that there are exactly 40 winning triangles in this tournament. 3. Find all the non-negative integers x, y, and z satisfying that

th th th

7x + 1 = 3y + 5z :

Time: 4.5 hours

x1 , y

21

,z

2 +

y1 , z

2 1

,x

2 +

z1 , x

2 1

, y 4 9 3:

2

323

a Find f n. b Find all solutions to f n = n. 3. Let m and n be positive integers where m has d digits in base ten and d n. Find the sum of all the digits in base ten of the product 10n , 1m. As a second Olympiad set we give the problems of the Final Round of the 45 Mathematical Olympiad written in April, 1994. My thanks go to Marcin E. Kuczma, Warszawa, Poland; and Richard Nowakowski, Canadian Team leader to the 35 IMO in Hong Kong, for collecting them.

th th

Problems of the Final Round | April 10 11, 1994

First Day | Time: 5 hours

cle disjoint from k. From a point A on k draw the two tangents to the given circle; they cut l at points B and C . Let m be the line through A and the midpoint of BC . Show that all the resultant lines m corresponding to various points A on k have a point in common. 3. Let c 1 be a xed integer. To each subset A of the set f1, 2, : : : : , ng we assign a number wA from the set f1, 2, : : : , cg in such a way that wA B = minwA;wB for A; B f1; 2; : : : ; ng: p Suppose there are an such assignments. Compute limn!1 n an. Second Day | Time: 5 hours

1. Determine all triples of positive rational numbers x; y; z such that 2. In the plane there are given two parallel lines k and l, and a cir-

4. We have three bowls at our disposal, of capacities m litres, n litres and m + n litres, respectively; m and n are mutually coprime natural numbers. The two smaller bowls are empty, the largest bowl is lled with water. Let k be any integer with 1 k m + n , 1. Show that by pouring water from any one of those bowls into any other one, repeatedly, in an unrestricted manner we are able to measure out exactly k litres in the third bowl.

324

5. Let A1; A2; : : : ; A8 be the vertices of a parallelepiped and let O be its centre. Show that

4OA2 + OA2 + + OA2 OA1 + OA2 + + OA82: 1 2 8

6. Suppose that n distinct real numbers x1; x2; : : : ; xn n 4 satisfy the conditions x1 + x2 + + xn = 0 and x2 + x2 + + x2 = 1. Prove 1 2 n that one can choose four distinct numbers a, b, c, d from among the xi 's in such a way that

a + b + c + nabc x3 + x3 + + x3 a + b + d + nabd: 1 2 n

We now give three solutions to problems given in the March 1996 Corner as the Telecom 1993 Australian Mathematical Olympiad 1996: 58 .

TELECOM 1993 AUSTRALIAN MATHEMATICAL OLYMPIAD Paper 1 6. In the acute-angled triangle ABC , let D, E, F be the feet of altitudes through A, B , C , respectively, and H the orthocentre. Prove that

AH + BH + CH = 2: AD BE CF

land. Solution by Mansur Boase, student, St. Paul's School, London, EngTuesday, 9th February, 1993 Time: 4 hours

7. Let n be a positive integer, a1; a2; : : : ; an positive real numbers and s = a1 + a2 + + an . Prove that

ai n i=1 s , ai n , 1

n X

and

n X

325 Solutions by Mansur Boase, student, St. Paul's School, London, England and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give the solution by Boase.

n X

X

ai = 1 i=1 s

s , ai = i=1 ai

n X

n X

i 2 Hence ai n , n = nn , 1. i=1 To prove the rst inequality, rst note that n X n X i=1 i=1

n X

s,a

s n2: i=1 ai

n X

a2 i

n X i=1

ai

!2

= s2 :

s2

Therefore

n X

n X

n X

n X i=1

ai

!2

= s2 :

So, both inequalities are proved. 8. 1996: 58 Telecom 1993 Australian Mathematical Olympiad. The vertices of triangle ABC in the xy plane have integer coordinates, and its sides do not contain any other points having integer coordinates. The interior of ABC contains only one point, G, that has integer coordinates. Prove that G is the centroid of ABC .

326 land. Solution by Mansur Boase, student, St. Paul's School, London, Eng-

A C0

By Pick's Theorem

A0

B0 C

Therefore Hence

ABC = 1 + 3 1 , 1 = 3 ; 2 2 1 , 1 = 1; ABG = 0 + 3 2 2

ABG = BCG = CAG = 1 : ABC ABC ABC 3 GA0 = GB0 = GC 0 = 1 : AA0 BB0 CC 0 3

The unique point satisfying this above is well-known to be the centroid. Next we give one solution from the Japan Mathematical Olympiad 1993 given in the March 1996 Corner. 2. 1996: 58 Japan Mathematical Olympiad 1993. Let dn be the largest odd number which divides a given number n. Suppose that Dn and T n are de ned by

Prove that there exist in nitely many positive numbers n such that 3Dn = 2T n. Solutions by Mansur Boase, student, St. Paul's School, London, England, and Zun Shan and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give the solution by Boase.

327

Thus we need to prove that there are in nitely many n for which Consider

T n = nn2+ 1 :

so that

Dn = nn3+ 1

3Dn = 2T n

holds:

D2n = d1 + d3 + + d2n , 1 + d2 + d4 + + d2n = 1 + 3 + + 2n , 1 + d1 + d2 + + d2n,1 = 1 + 3 + + 2n , 1 + D2n,1 :

n,1 n,1 n n 1 + 3 + + 2n , 1 = 2 2 2 + 1 , 2 2 2 2 + 1 = 2n,1 2n , 2n,1 = 22n,2: Thus D2n = D2n,1 + 22n,2. 22n + 2 for Now, D21 = 2 and we shall prove by induction that D2n = 3 n 0. This holds for n = 0 and for n = 1. Suppose it holds for n = k. 22k + 2 . Thus D2k = 3

Now

Then

2n = 2 3+ 2 , 2n 2n n n n = 2 , 32 + 2 = 2 , 12 , 2 : 3 3

th

Next we turn to comments and solutions from the readers to problems from the April 1996 number of the Corner where we gave the selection test for the Romanian Team to the 34 IMO as well as three contests for the Romanian IMO Team 1996: 107 109 .

SELECTION TESTS FOR THE ROMANIAN TEAM, 34th IMO. Part II | First Contest for IMO Team

1st June, 1993

p

is true for all positive real numbers x, y , z . Solutions by Zun Shan and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We claim that a = 2. Let

2+ 2

+ pz 2y+ x2 + p 2z 2 z x +y

+ pz 2y+ x2 + p 2z 2 : y z x +y We show that f x;y;z 2. Since f x; y;z ! 2 as x ! y and z ! 0, the lower bound 2 is sharp. Without loss of generality, assume that x y z .

f x;y;z =

2+ 2

Since by the arithmetic harmonic mean inequality, we have it su ces to show that or equivalently,

p

f x;y;z x2 + y2 z

1

p

pzz2 + x2 + x y 2 + z 2 + p 2 2 pz 2 2 z + x y + z + y

2+ 2

y:

1

p p

x and p2 x x2 + y2,

p

2 + 2

pzz2 + x2 + x z

2 x

p

pz2 + x2pzy2 + z2 + y

2z p y2 + z2 + y

2+ 2

or equivalently Since

z2 + x2 : x2 + y2

and thus it su ces to show that

p

z2 + y2 p2 y

2z y2 + z2 + y ;

2

or equivalently

and thus 2 holds. This completes the proof. 2. Show that if x, y, z are positive integers such that x2 + y2 + z2 = 1993, then x + y + z is not a perfect square. Solutions by Mansur Boase, student, St. Paul's School, London, England; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Wang's solution. We show that the result holds for nonnegative integers x, y , and z . Without loss of generality, we may assume that 0 x y z . Then

3z2 x2 + y 2 + z 2 = 1993

z2 665; z 26: On the other hand z 2 1993 implies that z 44 and thus 26 z 44. Suppose that x + y + z = k2 for some nonnegative integer k. By the

Cauchy Schwarz Inequality we have

k4 = x + y + z2 12 + 12 + 12x2 + y2 + z2 = 5979 p and so k b 4 5979c = 8. Since k2 z 26, k 6. Furthermore, since x2 + y2 + z2 is odd, it is easily seen that x + y + z must be odd, which implies that k is odd. Thus k = 7 and we have x + y + z = 49. Let z = 26 + d, where 0 d 18. Then x + y = 23 , d y 23 , d x2 + y2 2y2 = 223 , d2 = 1058 , 92d + 2d2 : 1 On the other hand, from x2 + y 2 + z 2 = 1993 we get x2 + y2 = 1993 , z2 = 1993 , 26 + d2 = 1317 , 52d , d2: 2

From 1 and 2, we get or

3d2 , 40d 259 which is clearly impossible since 3d2 , 40d = d3d , 40 18 14 = 252.

This completes the proof. Remark: It is a well-known though by no means easy result in classical number theory that a natural number n is the sum of three squares of nonnegative integers if and only if n 6= 4l 8k + 7 where l and k are nonnegative integers. Since 1993 1mod 8 it can be so expressed and thus the condition given in the problem is not vacuously" true. In fact, 1993 can be so expressed in more than one way; for example,

1993 = = = =

These representations also show that the conclusion of the problem is false if we allow x, y , and z to be negative integers; e.g. if x = ,2, y = ,30, z = 33 then x2 + y2 + z2 2 1993 and x + y + z = 12; and if x 2 ,11, = = y = 24, z = 36 then x2 + y + z2 = 1993 and x + y + z = 49 = 7 .

331

4. Show that for any function f : P f1; 2; : : : ; ng ! f1; 2; : : : ; ng there exist two subsets, A and B , of the set f1; 2; : : : ; ng, such that A 6= B and f A = f B = maxfi j i 2 A B g. Comment by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. The problem, as stated, is clearly incorrect since for maxfi : i 2 A B g to make sense, we must have A B 6= ;. For n = 1 clearly there are no subsets A and B with A 6= B and A B 6= ;. A counterexample when n = 2 is provided by setting f ; = f f1g = f f2g = 1 and f f1; 2g = 2. This counterexample stands if max is changed to min. The conclusion is still incorrect if A B is changed to A B . A counterexample would be f ; = 2 and f f1g = f f2g = f f1; 2g = 1. Part III | Second Contest for IMO Team

2nd June, 1993

3. Prove that for all integer numbers n, with n 6, there exists an n point set M in the plane such that every point P in M has at least three other points in M at unit distance to P .

Solution by Zun Shan and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. The three diagrams displayed below illustrate the existence of such a set. M1 is for all n = 3k, M2 is for all n = 3k+1 and M3 is for all n = 3k+2, where k = 2; 3; 4; : : : . In each diagram, the solid lines connecting two points all have unit length and the dotted lines, also of unit length, indicate how to construct an n + 3 point set with the described property from one with n points.

c c c s c s s s s s s

M1

c c

s s s s s

M2

s

M3

n = 6; 9; 12; : : :

n = 7; 10; 13; : : :

n = 8; 11; 14; : : :

332

3rd June, 1993

1. The sequence of positive integers fxngn1 is de ned as follows: x1 = 1, the next two terms are the even numbers 2 and 4, the next three terms are the three odd numbers 5, 7, 9, the next four terms are the even numbers 10, 12, 14, 16 and so on. Find a formula for xn .

Solutions by Mansur Boase, student, St. Paul's School, London, England; and by Zun Shan and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give the solution of Shan and Wang. We arrange the terms of the sequence fxn g in a triangular array according to the given rule so that the 1 level consists of a single 1 and for all k 2, the k level consists of the k consecutive even odd integers that follow the last odd even integer in the k , 1 level:

st th st

17

10

5 19

2 12

1 7 21

4 14

9 23

16

25

For any given n 2 N , let ln denote the unique integer such that

ln n ln + 1 ; 2 2

that is,

Note that ln is simply the number of the level which xn is on. We claim that

ln , 1ln 2

n lnln2+ 1 :

1

xn = 2n , ln : 2 When n = 1, clearly l1 = 1 and thus 2n , ln = 1 = x1 . Suppose 2 holds for some n 1. There are two possible cases: , +1 Case i: If n + 1 ln2 ; that is, if xn+1 and xn are on the same level, then ln+1 = ln and hence xn+1 = xn + 2 = 2n , ln + 2 = 2n + 1 , ln+1 :

333

+1 Case ii: If n + 1 ln2 then xn is the last number on the ln level and xn+1 is the rst number on the ln+1 level. Thus

,

th th

ln+1 = ln + 1

and

Hence, by induction, 2 is established. From 1 we get Solving the inequalities, we easily obtain

1 + p1 + 8n l + 1: n 2

& '

Hence

p1 ln = 1 + 2 + 8n , 1

1 + p1 + 8n : xn = 2n + 1 , 2

& '

3

where dxe denotes the least integer greater than or equal to x that is, the ceiling function. From 2 and 3 we conclude that

That completes this number of the Corner. Send me your nice solutions as well as Olympiad contests.

334

BOOK REVIEWS

Edited by ANDY LIU

A Mathematical Mosaic, by Ravi Vakil, published by Brendan Kelly Publishing Inc., 1996, 2122 Highview Drive, Burlington, ON L7R3X4, ISBN 1-895997-04-6, softcover, 253+ pages, US$16.95 plus handling. Reviewed by Jim Totten, University College of the Cariboo. So, you have a group of students who have decided they want the extra challenge of doing some mathematics competitions. You want a source of problems which will pique the students' interest, and which also lead to further exploration. The problem source should lend itself well to independent work. The question is: where do you nd the appropriate level enrichment material? Many of us have already tried to answer this question and have a collection of such problem books. Well, here is a book to be added to your collection! It is certainly a problem book, but it is much more than that. The author at one moment guides the reader through some very nice mathematical developments, and throws out problems as they crop up in the development, and in the next moment uses a problem as a starting point for some interesting mathematical development. With a few exceptions the problems in this book are not new, nor are the solutions. They are, however, well organized, both by topic and by level of mathematical maturity needed. Answers are NOT always provided; instead there is often simply a solution strategy or hint given, and occasionally there is simply a reference to some other source for a full-blown treatment. Even when answers are provided, they are not tucked away at the end of the book, but rather they are worked into another topic usually later in the book, but not always, where they become part of the development of another topic or problem. The author is a PhD candidate in pure mathematics at Harvard University at the time the book was written. Being still very young, he knows how to speak to today's teenagers. His sense of humour and general puckishness is present throughout: just when you are lulled into some serious computation in probability, he deviously throws a trick question at you, that has a totally non-obvious answer non-obvious, that is, until you CAREFULLY re-read the question. Many mathematics books published today include short biographies on famous mathematicians through history, especially those whose names come up in the theory developed in the book. This book is no exception. But what is unique about this book is the inclusion of Personal Pro les of young mathematicians from several countries that he has met at International Mathematical Olympiads IMOs in the past. The pro les are quite diverse, which

335 means that most bright students could nd one to identify with and to use as a role model. The author and those he pro les have taken a risk in doing this: they have tried to predict some of the important mathematicians in the early part of the next century. It should be interesting to follow their careers and see if those predictions can come true, or if by placing them in the spotlight, they nd too much pressure to deal with. The problems range from puzzles that elementary school children can do to problems that provide training for Putnam candidates toward the end of the book. There are many cross-references and connections between seemingly unrelated problems from di erent areas of mathematics, connections that most students would be unable to make. Many of these connections are new to this reviewer. However, once made these connections are quite clear. As for his credentials, Ravi Vakil placed among the top ve in the Putnam competition in all four of his undergraduate years at the University of Toronto. Before that he won two gold medals and a silver medal in IMOs and coached the Canadian team to the IMO from 1989 to 1995.

Some tests for divisibility are well known, such as the test for divisibility by 3: nd the sum of the digits of the whole number n | if that sum is divisible by 3, then the original whole number n is divisible by 3. Many people know this test, but do not know why it works. So, why does it work? The basic principle is that the remainder obtained when 10k is divided by 3, is 1. This is easy to check, since 10k = 3 3 10k,1 + 10k,1 . This enables one to step down one power at a time. So, if d is a digit, the remainder" obtained when d 10k is divided by 3 is d. NB: this is not the true remainder one gets when dividing by 3! If n = abc : : : def is a whole number, then we write it as

n = a 10k + b 10k,1 + c 10k,2 + : : : + d 100 + e 10 + f: When we divide by 3, we get a remainder" of a + b + c + : : : + d + e + f . If this is divisible by 3, the the true remainder is 0, and so n is divisible

by 3. Now, do you know, or can you construct, a test for divisibility by 7?

336

Andris Cibulis

Riga, Latvia

Introduction

With the popularity of the video game Tetris, most people are aware of the ve connected shapes formed by four unit squares joined edge to edge. They are called the I , L , N , O and T tetrominoes, after the letter of the alphabet whose shapes they resemble. They form a subclass of the polyominoes, a favourite topic in research and recreational mathematics founded by Solomon Golomb. Here is a problem from his classic treatise, Polyominoes. Is it possible to tile a rectangle with copies of a particular tetromino? Figure 1 shows that the answer is a rmative for four of the tetrominoes but negative for the N tetromino, which cannot even ll up one side of a rectangle.

Figure 1 Getting o the plane into space, we can join unit cubes face to face to form polycubes. By adding unit thickness to the tetrominoes, we get ve tetracubes, but there are three others. They are shown in Figure 2, along with the N tetracube. Is it possible to pack a rectangular block, or box, with copies of a particular tetracube? The answer is obviously a rmative for the I , L , O and T tetracubes, and it is easy to see that two copies of each of the three tetracubes not derived from tetrominoes can pack a 2 2 2 box. Will the N tetracube be left out once again? Build as many copies of it as possible and experiment with them. If the k m n box can be packed with the N tetracube, we call it an N box. Are there any such boxes? Certain types may be dismissed immediately.

337

PPPP PPPP

P P

PP P PPP

P

P

PP

PPPP PPP

P

P P

PPPP

PP P P

PP

Observation 1. The k m n box cannot be an N box if it satis es at least one of the following conditions: a one of k; m and n is equal to 1; b two of k; m and n are equal to 2; c kmn is not divisible by 4. It follows that the 2 3 4 box is the smallest box which may be an N box. Figure 3 shows that this is in fact the case. The box is drawn in two layers, and two dominoes with identical labels form a single N tetracube.

Figure 2

PP PP

P

P

PP

PP PP

PP

P P

PP

PP

P

P

PPPP PPP

P

P P

PPPP

P

P

P PP

P

PPPP

P

0 1 3 2 1

0 2 3

Figure 3 So there is life in this universe after all! The main problem is to nd all N boxes.

cubes

If k = m = n, the k m n box is called the k cube, and a cube which can be packed by the N tetracube is called an N cube. We can easily assemble the 12 cube with the 2 3 4 N box, which makes it an N cube. This is a special case of the following result.

338

Observation 2. Suppose the k m n and ` m n boxes are N boxes. Let a, b and c be any positive integers. Then the following are also N boxes: a k + ` m n; b ak bm cn. The 12 cube is not the smallest N cube. By Observation 1, the rst candidate is k = 4. It turns out that this is indeed an N cube. It can be assembled from the 2 4 4 N box, whose construction is shown in Figure 4.

0 1 3 2 1

0 2 3

Figure 4 The next candidate, the 6 cube, is also an N cube, but a packing is not that easy to nd. In Figure 5, we begin with a packing of a 2 6 6 box, with a 1 2 4 box attached to it. To complete a packing of the 6 cube, add a 2 3 4 N box on top of the small box, ank it with two 2 4 4 N boxes and nally add two more 2 3 4 N boxes.

0 2 4

1 3 5 2

0 6 7 8 9 4

1 3 5

6 7 8 9

Figure 5 Can we pack the 8 cube, the 10 cube, or others? It would appear that as size increases, it is more likely that we would have an N cube. However, it is time to stop considering one case at a time. We present a recursive construction which expands N cubes into larger ones by adding certain N boxes. Theorem 1. The k cube is an N cube if and only if k is an even integer greater than 2. Proof: That this condition is necessary follows from Observation 1. We now

339 prove that it is su cient by establishing the fact that if the k cube is an N cube, then so is the k + 4 cube. We can then start from either the 4 cube or the 6 cube and assemble all others. From the 2 3 4 and 2 4 4 N boxes, we can assemble all 4 m n boxes for all even m; n 4, via Observation 2. By attaching appropriate N boxes from this collection, we can enlarge the k cube rst to the k + 4 k k box, then the k + 4 k + 4 k box and nally the k + 4 cube. This completes the proof of Theorem 1.

Observation 1 contains some trivial necessary conditions for a box to be an N box. We now prove two stronger results, one of which supersedes c in Observation 1. Lemma 1. The k m n box is not an N box if at least two of k; m and n are odd. Proof: We may assume that m and n are odd. Place the box so that the horizontal cross-section is an m n rectangle. Label the layers L1 to Lk from bottom to top. Colour the unit cubes in checkerboard fashion, so that in any two which share a common face, one is black and the other is white. We may assume that the unit cubes at the bottom corners are black. It follows that Li has one more black unit cube than white if i is odd, and one more white unit cube than black if i is even. Suppose to the contrary that we have a packing of the box. We will call an N tetracube vertical if it intersects three layers. Note that the intersection of a layer with any N tetracube which is not vertical consists of two or four unit cubes, with an equal number in black and white. The intersection of a vertical N tetracube with its middle layer consists of one unit cube of each colour. Since L1 has a surplus of one black unit cube, it must intersect `1 vertical N tetracubes in white and `1 + 1 vertical N tetracubes in black, for some non-negative integer `1 . These N tetracubes intersect L3 in `1 black unit cubes and `1 + 1 white ones. Hence the remaining part of L3 has a surplus of two black. They can only be packed with `3 vertical N tetracubes intersecting L3 in white, and `3 + 2 vertical N tetracubes in black, for some non-negative integer `3. However, the surplus in black unit cubes in L5 is now three, and this surplus must continue to grow. Thus the k m n box cannot be packed with the N tetracube. This completes the proof of Lemma 1. Lemma 2. The k m n box is not an N box if kmn is not divisible by 8.

340

Proof: Suppose a k m n box is an N box. In view of Lemma 1, we may assume that at least two of k; m and n are even. Place the packed box so that the horizontal cross-section is an m n rectangle, and label the layers L1 to Lk from bottom to top. De ne vertical N tetracubes as in Lemma 1 and denote by ti the total number of those which intersects Li ; Li+1 and Li+2; 1 i k , 2. Since at least one of m and n is even, each layer has an even number of unit cubes. It follows easily that each ti must be even, so that the total number of vertical N tetracubes is also even. The same conclusion can be reached if we place the box in either of the other two non-equivalent orientations. Hence the total number of N tetracubes must be even, and kmn must be divisible by 8. This completes the proof of Lemma 2.

Boxes of Height 2

We now consider 2 m n boxes. By Observation 1, m 3 and n 3. By Lemma 2, mn is divisible by 4. We may assume that m is even. First let m = 4. We already know that the 2 4 3 and 2 4 4 boxes are N boxes. Figure 6 shows that so is the 2 4 5 box. If the 2 4 n box is an N box, then so is the 2 4 n + 3 box by Observation 2. It follows that the 2 4 n box is an N box for all n 3.

0 1 3 2 1

0 2 3

Figure 6 Now let m = 6. Then n is even. We already know that the 2 6 4 box is an N box. However, the 2 6 6 box is not. Our proof consists of a long case-analysis, and we omit the details. On the other hand, the 2 6 10 box is an N box. In Figure 7, we begin with the packing of a 2 3 6 box with a 2 2 3 box attached to it. We then build the mirror image of this solid and complete the packing of the 2 6 10 box by adding a 2 4 3 N box. If the 2 6 n box is an N box, then so is the 2 6 n + 4 box by Observation 2. It follows that the 2 6 n box is an N box for n = 4 and all even n 8. Theorem 2. The 2 m n box is an N box if and only if m 3; n 3 and mn is divisible by 4, except for the 2 6 6 box.

341

1 3 4

0 1 5 2 3

0 2 4 5

Proof: If m is divisible by 4, the result follows immediately from Observation 2. Let m = 4` + 2 for some positive integer `. We already know that the 2 10 6 box is an N box. If the 2 4` + 2 n box is an N box, then so is the 2 4` + 6 n box by Observation 2. This completes the proof of Theorem 2.

Figure 7

Theorem 3. The k m n box, k m n, is an N box if and only if it satis es all of the following conditions: a k 2; b m 3; c at least two of k, m and n are even; d kmn is divisible by 8; e k;m; n 6= 2; 6; 6. Proof: Necessity has already been established, and we deal with su ciency. We may assume that k 3, since we have taken care of N boxes of height 2. Consider all 3 m n boxes. By c, both m and n must be even. By d, one of them is divisible by 4. All such boxes can be assembled from the 3 2 4 box. Consider now the k m n box. We may assume that m and n are even. If k is odd, then one of m and n is divisible by 4. Slice this box into one 3 m n box and a number of 2 m n boxes. Since these are all N boxes, so is the k m n box. Suppose k is even. Slice this box into a number of 2 m n boxes, each of which is an N box unless m = n = 6. The 4 6 6 box may be assembled from the 4 2 3 box, and we already know that the 6 cube is an N cube. If the k 6 6 box is an N box, then so is the k + 4 6 6 box. This completes the proof of Theorem 3.

342

Research Projects

Problem 1. Try to prove that the 2 6 6 box is not an N box. It is unlikely that any elegant solution exists. Problem 2. An N box which cannot be assembled from smaller N boxes is called a prime N box. Find all prime N boxes. Problem 3. Prove or disprove that an N box cannot be packed if we replace one of the N tetracubes by an O tetracube. Problem 4. For each of the other seven tetracubes, nd all boxes which it can pack.

Bibliography

Bouwkamp, C. J. & Klarner, David, Packing a Box with Y pentacubes, Journal of Recreational Mathematics, 3 1970, 10-26. Gobel, F. & Klarner, David, Packing Boxes with Congruent Figures, Indagationes Mathematicae, 31 1969, 465-472. Golomb, Solomon G., Polyominoes | Puzzles, Patterns, Problems & Packings, Princeton University Press, Princeton, 1994. Klarner, David, A Search for N pentacube Prime Boxes, Journal of Recreational Mathematics, 12 1979, 252-257.

Acknowledgement

This article has been published previously in a special edition of delta-k, Mathematics for Gifted Students II, Vol. 33, 3 1996, a publication of the Mathematics Council of the Alberta Teachers' Association and in AGATE, Vol. 10, 1, 1996, the journal of the Gifted and Talented Education Council of the Alberta Teachers' Association. It is reprinted with permission of the author and delta-k.

343

No. 24 R.E. Woodrow

This number we give the problems of the 1995 Concours Math matique e du Qu bec. This contest comes to us from the organizers via the Canadian e Mathematical Society which gives partial support to the contest. My thanks go to Th r se Ouellet, secretary to the contest. The contest was written by ee over 2000 students February 2, 1997 over a three hour period. This will also test your French! We will, of course, accept solutions in either English or French.

Time: 3 hours 1. LA FRACTION SIMPLIFIEE Simpli er la fraction 2. LA FORMULE MYSTERE

February 2, 1995

1 358 024 701 : 1 851 851 865

xy = p; x + y = s; x1993 + y1993 = t; x1994 + y1994 = u: En faisant appel aux lettres p, s, t, u mais pas aux lettres x, y , donnez une formule pour la valeur x1995 + y1995:

Lorsque la circonf
rence d'un cercle est divis
e en dix parties egales, e e
les cordes qui joignent les points de division successifs forment un d
cagone e r
gulier convexe. En joignant chaque point de division au troisi me suivant, e e on obtient un d
cagone r
gulier etoil
. Montrer que la di erence entre les e e
e
c^ t
s de ces d
cagones est egale au rayon du cercle. oe e
3. LA DIFFERENCE ETONNANTE

344 Abel Belgrillet est membre du Club des a rocervidophiles amateurs de e cerfs-volants du Qu bec. Il dispose de quatre tron ons de cl^ ture rectilignes e c o AB, BC , CD, DA pour d limiter un terrain en forme de cerf-volant, voir e gure sur lequel il s'adonnera a son activit favorite cet et . Sachant que les e e tron ons AB et DA mesurent 50 m chacun et que les tron ons BC et DA c c mesurent 120 m chacun, d terminer la distance entre les points A et C qui e maximisera l'aire du terrain.

50

120

A

50

C B

120

a 2 points L'in galit x2 + 2y 2 3xy est-elle vraie pour tous les e e entiers? b 8 points Montrer que l'in galit x2 + 2y 2 14 xy est valide pour e e 5 tous r els x et y . e 6. L'ECHIQUIER COQUET Trouver l'unique fa on de colorier les 36 cases d'un echiquier 6 6 en c noir et blanc de sorte que chacune des cases soit voisines d'un nombre impair de cases noires. Note: deux cases sont voisines si elles se touchent par un c^ t ou par oe un coin. On ne demande pas de d montrer que la solution est unique. e 7. LA FRACTION D'ANNE GRUJOTE En base 10, 1 = 0:333 : : : . Ecrivons 0:3 pour ces d cimles r p t es. e e ee 3 1 dans une base b, ou b est de la forme Comment ecrit-on 3 i b = 3t trois points, ii b = 3t + 1 trois points, iii b = 3t + 2 quatre points, ou t est un entier positif quelconque?

345 To nish this number of the Skoliad Corner we give the o cial solutions to the 1995 P.E.I. Mathematics Competition given last issue 1997: 278 . My thanks go to Gordon MacDonald, University of Prince Edward Island for forwarding the materials.

gure.

1. Find the area of the shaded region inside the circle in the following

1 6

,1

T2

T1

1 -

, ?1

Solution. First determine the coordinates of the point P . Since P lies on the line y = x, P = a; a for some value of a. Since P lies on the circle , , , x2 + y2 = 1, a2 + a2 = 1 and so a = p1 . Hence P = p1 ; p1 . Partition 2 2 2 the shaded region as shown. Then the area of the quarter circle S is and 4 the area of the triangle T1 is 1 baseheight. The base is 1 and the height 2 1 1 is p2 . Turn the page upside down. So the area of T1 is 2p2 . The triangle T2 has the same area so the total area of the shaded region is

+p : 1 4 2

I will be n years old in the year n2", said Bob in the year 1995. How old is Bob? Solution. Assuming Bob's age is an integer, Bob must have a reasonable chance to be alive in a year that is a perfect square. Since 442 = 1936, 452 = 2025 and 462 = 2116, Bob must be 45 years old in the year 2025. Hence Bob is now 15 years old or 14 years old if he hasn't had his birthday yet this year. 3. Draw the set of points x; y in the plane which satisfy the equation jxj + jx , yj = 4.

2.

346 Solution. Consider the following four possible cases: Case 1: When x 0 and x y . Then x + x , y = 4 so 2x , y = 4. Case 2: When x 0 and x y . Then x , x , y = 4 so y = 4. Case 3: When x 0 and x y . Then ,x + x , y = 4 so y = ,4. Case 4: When x 0 and x y . Then ,x , x , y = 4 so ,2x + y = 4. Thus the set of points is made up of four line segments. When these line segments are drawn we obtain the following parallelogram:

4

6 r

y

axis

,4

,2 ,2

d

2 4

axis

,4

4. An autobiographical number is a natural number with ten digits or less in which the rst digit of the number reading from left to right tells you how many zeros are in the number, the second digit tells you how many 1's, the third digit tells you how many 2's, and so on. For example, 6; 210; 001; 000 is an autobiographical number. Find the smallest autobiographical number and prove that it is the smallest. Solution. When you add the digits of an autobiographical number, you count the total number of digits. For example the digits of the above 10 digit autobiographical number must sum to 10. Using this fact and the process of elimination we can nd the smallest autobiographical number. The only possible one-digit number whose digits sum to 1 is 1 and it is not autobiographical so there are no one digit autobiographical numbers. The only possible two digit numbers whose digits sum to two are in increasing order 11 and 20 and they are not autobiographical so there are no two digit autobiographical numbers. The only possible three digit numbers whose digits sum to three are in increasing order 102; 111; 120; 201; 210 and 300 and they are not autobiographical so there are no three digit autobiographical numbers. The possible four digit numbers whose digits sum to four are in increasing order 1003; 1012; 1021; 1030; 1102; 1111; 1120; 1201; : : : .

347 Checking these numbers we nd that the rst autobiographical number in this list, and hence the smallest autobiographical number is 1201.

5. A solid cube of radium is oating in deep space. Each edge of the cube is exactly 1 kilometre in length. An astronaut is protected from its radiation if she remains at least 1 kilometre from the nearest speck of radium. Including the interior of the cube, what is the volume in cubic kilometres of space that is forbidden to the astronaut? You may assume that the volume of a sphere of radius r is 4 r3 and the volume of a right circular cylinder of 3 radius r and height h is r2 h. Solution. Along with the cube of radium, on each of the six faces of the cube there will be a cube with sides of length 1 km of forbidden space. Along each of the 12 edges of the cube of radium there will be a quarter of a cylinder of radius 1 km and length 1 km of forbidden space, and at each of the eight corners of the cube of radium there will be an eighth of a sphere of radius 1 km of forbidden space. Putting it all together, there are 7 cubes with sides of length 1 km, 3 cylinders of radius 1 km and length 1 km, and 1 sphere of radius 1 km of forbidden space. So the volume of forbidden space is:

the product of all the natural numbers from 1 to 999 inclusive. Explain your reasoning. Solution. Write and successively pair o numbers from the left with numbers from the right so

999! = 1 2 3 4 995 996 997 998 999

4 7 + 3 + 3 km3 = 7 + 16 km3 : 3

999! = 1 9992 9983 9974 996 449 501500: Note that no number is paired with 500 and there are 499 such pairs. Now use the fact that 500 , k500+ k = 5002 , k2 5002 for each value of k from 1 to 499 so 999! 5002500250025002 5002500 where 5002 is repeated 499 times. Hence 999! 5002499500 = 5002499+1 = 500999; so 500999 is greater.

348

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, Yale University, PO Box 208283 Yale Station, New Haven, CT 06520 8283 USA. The electronic address is still mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

MATHEMATICAL MAYHEM

There are two unexpected in their simultaneity invariants of inscribed regular n-gons. Let P1P2 Pn be a regular n-gon, and let P be a point on its circumcircle. Then both 2 4 PP12 + PP22 + + PPn and PP14 + PP24 + + PPn are independent of the position of P . Proof. We will show the result using complex numbers. Without loss of generality, assume the radius of the circumcircle is 1, and that Pk is at the complex number ! k,1 in the complex plane, where ! = cis 2n . Let z be the complex number corresponding to P , so jz j = 1, and zz = jz j2 = 1. Note

PPk2+1 = jz , !kj2 = z , !kz , !k = zz , !kz , ! kz + ! k ! k = 2 , ! kz , ! n,k z; k2 since ! k = j! kj = !1k = !n = ! n,k . Hence, ! !k

2 PP12 + PP22 + + PPn =

n,1 X k=0

jz , !kj2 =

n,1 X

n,1 X

= 2n , k=0 = 2n;

!k

z,

2 , ! kz , ! n,k z

!n,k

349 since

n,1 X k=0

!k = 11, ! = 0: ,!

n

so

PPk4+1 = 2 , !kz , !n,kz2 = 4 + ! 2kz2 + ! 2n,kz 2 , 4!kz , 4! n,k z + 2 = 6 + ! 2kz2 + ! 2n,kz 2 , 4!kz , 4! n,k z;

4 PP14 + PP24 + + PPn n,1 X = 6 + ! 2k z 2 + ! 2n,kz 2 , 4! kz , 4! n,k z

k=0

= 6n +

n,1 X

,4

n,1 X

k=0

2k

!

2+

n,1 X

k=0

!k z , 4

n,1 X

k=0

2n,k

!

z2

k=0

!n,k z = 6n:

Wai Ling Yee Problem: Given four identical spheres of radius R which are mutually tangent, nd the radius r of the sphere that will t in the hole at the centre of the tetrahedron that they form, in terms of R. When I rst tried this problem, I looked at several triangles and, after many calculations, produced an answer. I came across this problem again in chemistry when calculating the size of tetrahedral holes in ion lattices. Try this: Construct a cube so that the centres of the spheres are at alternate corners of the cube. The length of a face diagonalp the cube is 2R. Therefore, of the length of a body diagonal of the cube is 6R. Note that we can also express the length of the body diagonal as 2R + r. Hence,

Rider. This is the radius of the sphere that is externally tangent to all four. What is the radius of the sphere that is internally tangent to all four?

350

IMO REPORT

Adrian Chan

Two weeks of training at St. Mary's University in Halifax in early July kicked o the month-long journey the 1997 Canadian IMO team would endure. Four ights later, the team found itself in Mar del Plata, Argentina, ready to participate in the 37th International Mathematical Olympiad. This year's team members included: Adrian Terrible Taco" Birka, Sabin Cursed Corner" Cautis, Adrian Flash Flood" Chan, Jimmy Fruits and Veggies" Chui, Byung Kyu Argentinian Polite" Chun, and Mihaela My Dearest" Enachescu. We gave our team leader Dr. Richard Richard" Nowakowski and our deputy leader Naoki Raspberry" Sato all they could handle. Special thanks goes out to our coaches Dr. Bruce Shawyer and leader observer Dr. Chris Bob's Your Uncle" Small. This year's contest was not as di cult as last year's killer in India, but still challenging. It was the largest IMO ever, with a record 82 countries competing. Canada was well represented, bringing back 2 silver, 2 bronze, and an honourable mention. Our team's scores were as follows: CAN1 Adrian Birka 6 CAN2 Sabin Cautis 16 Bronze Medal CAN3 Adrian Chan 25 Silver Medal CAN4 Jimmy Chui 10 Honourable Mention CAN5 Byung Kyu Chun 29 Silver Medal CAN6 Mihaela Enachescu 21 Bronze Medal As a team, Canada nished 29 out of the 82 countries. Best of luck to the graduating members of the team, Sabin and Byung, as they take their math skills to the University of Waterloo next year. The remaining four members of the team are eligible to return to Taiwan for next year's IMO. However, it seems that the team should focus more in the area of geometry! Special thanks must also go out to Dr. Graham Wright of the Canadian Mathematical Society for paying all our bills, and Professor Ed Barbeau of the University of Toronto for conducting a year-long correspondence program for all IMO hopefuls. Visiting Argentina was a new experience for many of us, and was definitely a memorable one to all. The food was great, especially the beef and the chocolate alfajores, and the IMO was very well-organized and run. Best of luck to all IMO hopefuls who are working hard to be on the 1998 IMO team, which will compete in Taipei, Taiwan.

th

351

Unique Forms

Naoki Sato

For the mathematician, there is something re-assuring about being able to put an object into a unique form, or a canonical form, such as the prime factorization of a positive integer, or a matrix in Jordan Canonical Form. Such forms make working with these objects much easier and more tractable, as well as allowing a way to get a handle on them. Here, we explore the idea of the unique, canonical form. 1. Let px = an xn + an,1 xn,1 + + a1 x + a0 , and let c be a real number. Show that there exist unique constants bn , bn,1 , : : : , b1, b0, such that

px = bnx , cn + bn,1x , cn,1 + + b1x , c + b0: Can you nd the bi explicitly?

What may seem like a lot of linear algebra to untangle, comes easily undone with one idea: consider px + c. This is a polynomial of degree at most n, so there exist unique bi such that

which is equivalent to

px = bnx , cn + bn,1x , cn,1 + + b1x , c + b0: The expression may look familiar, because it is the n approximant to a power series around x = c, a central object of calculus. Suppose we take the k derivative of both sides. The constant term" is then k!bk, so evaluating both sides at x = c leads to k pkc = k!bk so that bk = p k!c : A quick corollary: If px is a polynomial, then x , ck j px if and only if pc = p0 c = p00 c = = pk,1 c = 0. Both conditions are equivalent to b0 = b1 = = bk,1 = 0. 2. Let N be a non-zero integer. Show that there exist unique positive integers k and a1 a2 ak such that N = ,2ak + ,2ak,1 + + ,2a1 : In other words, show that there is a unique representation of N in base ,2.

th th

352 We will use strong induction. The statement is true for N = 1 = ,20 and for N = ,1 = ,21 + ,20. Now, assume there is a positive integer n such that the statement is true for N = 1; 2; : : : ; n and N = ,1; ,2; : : : ; ,n. Let N = n + 1. If N is odd, then n is even, and n=,2 is an integer between ,1 and ,n, so by the induction hypothesis, for some unique distinct ai , which is equivalent to

N = n + 1 = ,2ak+1 + ,2ak,1+1 + + ,2a1+1 + ,20: Note that the exponents are still distinct. The same trick works if N is even, and for N = ,n + 1. Subtracting o 1 = ,20 if necessary, and then dividing by ,2, we obtain a form which is simultaneously seen to exist and be unique, by the induction hypothesis. Hence, by strong induction, the statement is proved for all N . Note that this also provides an algorithm for

nding the exponents. One may be tempted to isolate the higher exponents, but this tends to get very messy. Instead, one can start with the lower exponents - after seeing if ,20 is in the sum, they can then be picked o inductively. 3. Let r be a positive rational number. Show that there exist unique positive integers k and a1 a2 ak such that

1 1 r = a + a 1a + a a a + + a a a1 a : 1 1 2 1 2 3 1 2 3 k

Note that

1 a1 r , 1 = a + a 1a + + a a 1 a : 2 2 3 2 3 k This suggests nding the right a1 , reducing, and applying the same argument to a1 r , 1. De ne the sequences fai g and frig as follows: set r1 = r, ai = d1=ri e, ri+1 = airi , 1, i 1, and we terminate when ri+1 = 0. For example, if r1 = 3=7, then we obtain a1 = d7=3e = 3, r2 = 3 3=7 , 1 = 2=7, a2 = 4, r2 = 1=7, a3 = 7, and r3 = 0. And we see 3=1+ 1 + 1 : 7 3 34 347

which is equivalent to

1 1 r = a + a 1a + a a a + + a a a1 a ; 1 1 2 1 2 3 1 2 3 k

353 We will show that in general, this is the only possible sequence which works. Consider the choice of a1 . Since a1 r 1, a1 must be at least d1=re. However, if a1 was set to d1=re + 1, then

1 1 r = a + a 1a + a a a + + a a a1 a 1 1 2 1 2 3 1 2 3 k 1 + 1 + 1 + a a2 a3 = a , 1 = d11 e 11 =r =r 1 = r;

1

contradiction. Hence, there is only one choice for a1 , the one we have chosen above. By the above reduction, there is only one choice for a2 , a3 , and so on. Hence, we have uniqueness. We also know terms will be generated, but how do we know the sequence always terminates? Let ri = pi=qi, as a reduced fraction. Then ai = dqi=pie, so

q pi qi , 1 = pi pii , qi : ri+1 = q p qi i i

l m

However,

qi , q p qi + 1
, q = p : pi p i i p i i i i Hence, the numerators of the ri are strictly decreasing. But as they are all

positive integers, the sequence must terminate at some point. Finally, we must show the sequence fai g is non-decreasing. We have

2

ai+1 = 6 6

6

pi

qi pi

qm i

,q

7 7 i7

pi

qi pi

qm i

, qi

qi pi

qi , 1 = a , 1: i pi

Therefore, ai+1 ai . Rider. Does an analogous result hold for positive irrational numbers? p What is the sequence for 2? For e? 4. Let be a root of x3 , x , 1 = 0, and let p, q be polynomials with rational coe cients, such that q 6= 0. Show that there exist unique rationals a, b, and c such that

p = a 2 + b + c: q

354 First, let us express p =q as a polynomial in . Note that x3 ,x,1 is irreducible over the rationals. Hence, there exist polynomials ux and vx with rational coe cients such that

uxqx + vxx3 , x , 1 = gcdqx;x3 , x , 1 = 1: Then by substituting x = , u q = 1 implies that p = p u = r ; q where rx = pxux, a polynomial with rational coe cients.

Now, by the division algorithm for polynomials,

rx = x3 , x , 1wx + ax2 + bx + c; for some rationals a, b, and c dividing rx by x3 , x , 1 leaves, at most, a quadratic remainder. Hence, r = a 2 + b + c, which shows existence. To see uniqueness, suppose r = a0 2 + b0 + c0 implies that a , a0 2 + b , b0 + c , c0 = 0; that is, is a root of the quadratic a , a0 x2 + b , b0 x + c , c0 = 0. But as indicated above, the cubic x3 , x , 1 is irreducible; hence, all the coe cients of the quadratic must be zero, and a = a0 , b = b0 , c = c0 , showing uniqueness. 5. Let a and b be distinct positive integers, and let d = gcda; b. Consider the Diophantine equation ax + by = d. It is well-known that all solutions are given by x; y = u + bt=d; v , at=d, where t is an integer and u; v is some solution. i Show that there exists a unique solution satisfying jxj b=2d, jyj a=2d.

ii Show that the solution in i is given by the Euclidean Algorithm. For example, for a = 4 and b = 7, we have

7 = 1 4 + 3; 4 = 1 3 + 1; 3 = 1 3;

so gcd4,7 = 1, and

1 = 4 , 3 = 4 , 7 , 4 = 2 4 , 7: Hence, the Euclidean Algorithm gives the solution x; y = 2; ,1, which satis es jxj 7=2 and jy j 4=2,

We can assume d = 1, as a way of normalizing the equation, since ax + by = d is equivalent to a=dx + b=dy = 1. It is easy to check that d may be factored back in.

355 i Uniqueness is immediate, since the solutions in x form an arithmetic progression with common di erence b=d = b, and similarly for y , with di erence a=d = a. If b = 1, then x; y = 0; 1 serves as a solution. If b = 2, then a is odd, and x; y = 1; 1 , a=2 serves as a solution. Assume that b 2. Because the solutions in x form an arithmetic progression with di erence b, there exists a solution x; y with jxj b=2, or ,b=2 x b=2. Then y = 1 , ax=b, so and

b y 1 , ba 2 = 1 , a , a ; b 2 2

a + 1;

2

ii We must qualify the statement somewhat | if either a or b is equal to 1, then the Euclidean Algorithm does not explicitly provide a solution. We may stipulate now that the solution is x; y = 1; 0 or 0,1, if a or b is 1, respectively they cannot both be 1, since they must be distinct. We will use strong induction on maxa; b. The statement is easily veri ed for maxa; b 2. Assume the statement is true for maxa; b n, for some positive integer n. We will prove the statement for maxa; b = n + 1. Assume b = n + 1. We seek solutions of ax + n + 1y = 1. By the division algorithm, there exist unique non-negative integers q and r such that n + 1 = aq + r, 0 r a , 1. Then re-arranging, the equation becomes ax + aq + ry = ax + qy + ry = 1. Since a, r n, by the induction hypothesis, there exist solutions satisfying jx + qy j r=2, jy j a=2. By the triangle inequality, jxj r=2+ jqyj r=2+ qa=2 = r + qa=2 = n +1=2. Hence, by strong induction, the statement is proved for all values of maxa; b.

1. Let O and G be the circumcentre and centroid of a triangle ABC respectively. If R is the circumradius and r is the inradius of ABC , show that p

OG RR , 2r : + 2. Let p 5 be a prime number and X = fp , n2 jn 2 Z ; n2 pg. Prove that X contains two distinct elements x, y , such that x 6= 1 and x divides y.

356 3. Let ABCDE be a convex pentagon. Denote by M , N , P , Q, R the midpoints of the segments AB , BC , CD, DE , EA respectively. If the segments AP , BQ, CR, DN have a common point of intersection, prove that this point also belongs to the segment EN . 4. Show that there exists a subset A of the set f1; 2; 3; : : : ; 21996 , 1g having the following properties: a 1 2 A and 21996 , 1 2 A, b Every element of Anf1g is the sum of two not necessarily distinct elements of A, and c The number of elements of A is at most 2012.

Mayhem Problems

The Mayhem Problems editors are: Richard Hoshino Mayhem High School Problems Editor, Cyrus Hsia Mayhem Advanced Problems Editor, Ravi Vakil Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only solutions | the next issue will feature only problems. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions from the previous issue be submitted by 1 November 1997, for publication in the issue 5 months ahead; that is, issue 4 of 1998. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions from others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

357

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca H211. Proposed by Richard Hoshino, grade OAC, University of Toronto Schools Let p, q , and r be the roots of the cubic equation ax3 , bx2 + cx + d = 0, where a, b, c, and d are real coe cients. Given that Arctan p + Arctan q + Arctan r = , where Arctan de4 notes the principal value, prove that a = b + c + d. Solutionby Miguel Carrion Alvarez, Universidad Compluteuse de Mad rid, Spain. Let = Arctan p, = Arctan q , and = Arctan r. Then we have + + = and 4

tan +tan + tan 1 = tan + + = 1tan + + +tan = 1,tan tan , tan tan 1 , 1tan +tan tan ,tan tan tan + tan + tan , tan tan tan = p + q + r , pqr : = 1 , tan tan , tan tan , tan tan 1 , pq , pr , qr

Finally, ax,px,q x,r = a x3 ,p+q +rx2 +pq +pr +qrx,pqr = ax3 , bx2 + cx + d. From the relationship between the coe cients and the b c roots of this cubic, we get p + q + r = a , pq + pr + qr = a , and pqr = , d . a Using these relations in the above equation, we have

b d c b d a+a 1 = 1, c 1, a = a + a a = b+c+d : a

Also solved by BOB PRIELIPP, University of Wisconsin-Oshkosh, WI, USA. Prielipp also points out that this problem is similar to problem E2299 pp. 520-521 of the May 1972 issue of The American Mathematical Monthly. H212. Given two sequences of real numbers of length n, with the property that for any pair of integers i;j with 1 i j n, the i term is equal to the j term in at least one of the two sequences. Prove that at least one of the sequences has all its values the same. Solutionby Miguel Carrion Alvarez, Universidad Compluteuse de Mad
rid, Spain. Let the two sequences be fai g and fbig. Assume that fai g does not have all its values the same. Then, there is a pair i; j such that ai 6= aj , and hence bi = bj . Now, it is impossible that both ak = ai and ak = aj . Hence, either ak 6= ai or ak 6= aj . In either case, bk = bi = bj . This is true for all k, so the sequence of bi 's has all its values the same.

th th

358

H213. Two players begin with one counter each, initially on opposite corners of an n n chessboard. They take turns moving their counter to an adjacent square. A player wins by being the rst to reach the row opposite from their initial starting row, or landing on the opponent's counter. Who has the winning strategy? Generalize to an m n board. Solutionby Miguel Carrion Alvarez, Universidad Compluteuse de Mad
rid, Spain. On a square board, the rst player always wins by crossing the board to the opposite row. In n , 2 moves,

t

becomes

? t ?d

and the rst player wins. If there are more columns than rows, the same strategy works for the rst player. If there are more rows than columns, one of the players wins by capturing" the opponent. If the parity of both dimensions of the board is the same, both players start from squares of the same colour. In this case, the rst player always moves to the opposite colour and cannot capture the second player. The second player wins by closing in" on the rst player and capturing the rst player. Ed: Why is this always possible? Now if the parity of both dimensions of the board is opposite, the rst player moves towards the colour of the second player, and so can capture the second player using the same strategy.

Editor: Cyrus Hsia, 21 Van Allan Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu A190. Find all positive integers n 1 such that ab ,1mod n implies that a + b 0mod n. Solution by k Ling Yee, University of Waterloo, Waterloo, Ontario. Q Wai Let n = i=1 pi i where the pi are distinct primes. By the Chinese Remainder Theorem, the given property holds for n if and only if it holds for each pi i ; that is, ab ,1mod pi i , implies that a + b 0mod pi i . Also, both a and b must be relatively prime with n.

359 Let Si be the set of positive integers both relatively prime with and less than pi i . Take x, u, and v 2 Si. Note that ux vx mod pi i is equivalent to xu , v 0mod pi i , which, in turn, is equivalent to u = v , since x is relatively prime with pi i and u and v are less than pi i . Hence, each element of fx; 2x; : : : ; pi , 1x; pi + 1x; : : : ; pi i , 1xg leaves a unique residue modulo pi i . Also note that the product of two numbers in Si is itself in Si . Therefore, the set fx; 2x; : : : ; pi , 1x; pi + 1x; : : : ; pi i , 1xg taken modulo pi i is a permutation of Si. Since ,1 2 Si, for each x 2 Si, there exists a unique y 2 Si such that xy ,1mod pi i . Case I: pi is odd. Let a = 2. Then there exists a b such that 2b ,1mod pi i . Thus, 2 + b 0mod pi i , so that 4 1mod pi i . Therefore 3 0mod pi i , from which it follows that pi = 3, i = 1. Therefore, the only possible odd prime factor of n is 3, and only one such factor may appear. By a simple check, n = 3 satis es the given property. Case II: pi = 2. Let a = 3. Then there exists a b such that 3b ,1mod 2 i . Thus 3 + b 0mod 2 i , so that 9 1mod 2 i . Therefore 2 i j 8, from which it follows that i 3. Thus n can have 0, 1, 2, or 3 factors of 2, and again by a simple check, all satisfy the given property. From the above two cases, the solutions for n are 2, 3, 4, 6, 8, 12, and 24. This problem, which generalizes problem B-1 on the 1969 Putnam Competition, is equivalent to nding all n 1, such that a relatively prime to n implies that a2 1mod n. A191. Taken over all ordered partitions of n, show that

k1k2 km = m2+ n , 1 : m,1 k1+k2 ++km =n X

Solution. The problem is particularly suitable for generating functions. As is convention, let xn f x denote the coe cient of xn in f x. Consider each ki being contributed from a factor of x + 2x2 + 3x3 + . Then the number we seek is:

m

factors

360

A192. Let ABC be a triangle, such that the Fermat point F lies in the interior. Let u = AF , v = BF , w = CF . Derive the expression

2 2 2 p u2 + v2 + w2 , uv , uw , vw = a + b + c , 2 3K: 2

Solution by Wai Ling Yee, University of Waterloo, Waterloo, Ontario. Using the law of cosines on 4BCF , 4ACF , and 4ABF : a2 = v2 + w2 , 2vw cos 120 = u2 + v2 + vw; 1 2 = u2 + w2 , 2uw cos 120 = u2 + v 2 + uw; b 2 c2 = u2 + v2 , 2uv cos 120 = u2 + v2 + uv: 3

1 1 K = 1 uv sin 120 + 2 uw sin120 + 2 vw sin120 2 p3 = 4 uv + vw + uw: 4 p Therefore, u2 + v 2 + w2 , uv , uw , vw = a2 +b22 +c2 , 2 3K , from 1 1 + 2 + 3 , 2p34. 2 Since u2 + v 2 + w2 , uv , uw , vw 0 for all real u, v , w, it follows p from this problem that a2 + b2 + c2 4 3K .

Editor: Ravi Vakil, Department of Mathematics, Princeton University, Fine Hall, Washington Road, Princeton, NJ 08544 1000 USA

C70. Prove that the group of automorphisms of the dodecahedron is S5, the symmetric group on ve letters, and that the rotation group of the dodecahedron the subgroup of automorphisms preserving orientation is A5 . Solution. Assign a number to each of the dodecahedron's edges as shown in Figure 1. Alternatively, think of it as painting each of the edges one of ve di erent colours. Notice that if an edge on a face F is numbered n, then the edge from the opposite vertex in F that isn't an edge of F has the same number. Thus the entire numbering can be recovered from the numbering of the edges of a simple face. Notice also that the edges around each face are numbered 1 through 5 in some order.

vakil@math.princeton.edu

361

1 3 5 1 2 3 5 4 1 4 2 3 1 5 4 3 3 2 3 2 5 4 2 5 4 4 3 1 5

Figure 1.

1 4 By observation, if a 2 3 d 5 is an element of A5 , then there b c e is a unique face where edges are numbered clockwise a-b-c-d-e. In the 1 4 this way each element a 2 3 d 5 of A5 induces a rotation of the b c e dodecahedron by sending the face 1-2-3-4-5 to the face a-b-c-d-e, with edge 1 of the rst face sent to edge a of the second. Conversely, each rotation induces an element of A5 . This set map is clearly a group homomorphism, so the group of rotations of the dodecahedron is A5 . Essentially the same argument shows that the group of automorphisms of the dodecahedron including re ections is S5 . Comments. 1. What are the rotation and automorphism groups of the icosahedron? How about the other platonic solids? 2. The group A5 comes up often in higher mathematics. For example, because of a simple property of A5 , there are quintic polynomials with integer co-e cients whose roots can't be written in terms of radicals. This is not true of polynomials of degree less than 5. The proof involves Galois theory. Surprisingly, the description of A5 as the automorphism group of the dodecahedron comes up in a variety of contexts.

C72. A nite group G acts on a nite set X transitively. In other words, for any x; y 2 X , there is a g 2 G with g x = y . Prove that there is an element of G whose action on X has no xed points.

362 The problem as stated is incorrect. We need to assume that X has more than one element. Solution. Fix any element x0 of X . The number of elements of G sending x0 to y is independent of y 2 X : if y1 and y2 are any two elements of X , and

Si = fg 2 G j g x0 = yig; i = 1; 2; and z is an element of G sending y1 to y2 z exists by the transitivity of the group action, then zS1 = S2. In other words, the elements of S2 are obtained from the elements of S1 by multiplication on the left by z . In particular, jS1 j = jS2j. Let f g;x = 1 if g x = x and 0 otherwise. Then by the previous comment, for any xed x 2 X , P g2G f g;x = 1 : jGj jX j

The average number of xed points over all elements of the group is 1:

jGj

g2G x2X

f g;x

= =

x2X

X

g2G f g;x

= 1:

x2X

jX j

jGj

One element of the group the identity has more than the average as jX j 1, so there is an element with less than the average number and hence zero xed points. Comments. 1. How does this relate to problem 1 on the 1987 IMO?: Let pn k be the number of permutations of the set f1; : : : ; ng, n 1, which have exactly k xed points. Prove that

n X k=0

kpnk = n!:

Hint: Let X be the set f1; : : : ; ng and G the group of permutations on X , acting on X in the natural way. 2. Can the result be salvaged if the group action is not transitive?

363

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 1 "11" or A4 sheets of paper. 2 These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 April 1998. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

There has been an increase in the number of solutions sent in by FAX, either to the Editor-in-Chief's departmental FAX machine in St. John's, Newfoundland, or to the Canadian Mathematical Society's FAX machine in Ottawa, Ontario. While we understand the reasons for solvers wishing to use this method, we have found many problems with it. The major one is that hand-written material is frequently transmitted very badly, and at times is almost impossible to read clearly. We have therefore adopted the policy that we will no longer accept submissions sent by FAX. We will, however, continue to accept submissions sent by email or regular mail. We do encourage email. Thank you for your cooperation.

364 Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is a triangle, and the internal bisectors of B, C , meet AC , AB at D, E, respectively. Suppose that BDE = 30 . Characterize 4ABC . 2264. Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is a right angled triangle with the right angle at A. Points D and E are on sides AB and AC respectively, such that DEkBC . Points F and G are the feet of the perpendiculars from D and E to BC respectively. Let I , I1 , I2 , I3 be the incentres of 4ABC , 4ADE , 4BDF , 4CEG respectively. Let P be the point such that I2 P kI1 I3 , and I3 P kI1 I2 . Prove that the segment IP is bisected by the line BC . 2265. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. Given triangle ABC , let ABX and ACY be two variable triangles constructed outwardly on sides AB and AC of 4ABC , such that the angles XAB and Y AC are xed and XBA + Y CA = 180 . Prove that all the lines XY pass through a common point. 2266. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. BCLK is the square constructed outwardly on side BC of an acute triangle ABC . Let CD be the altitude of 4ABC with D on AB , and let H be the orthocentre of 4ABC . If the lines AK and CD meet at P , show that

2263.

HP = AB : PD CD

2267. Proposed by Clark Kimberling, University of Evansville, Evansville, IN, USA and Peter Y , Ball State University, Muncie, IN, USA. In the plane of 4ABC , let F be the Fermat point and F 0 its isogonal conjugate. Prove that the circles through F 0 centred at A, B and C meet pairwise in the vertices of an equilateral triangle having centre F . 2268. Proposed by Juan-Bosco Romero M
arquez, Universidad de Valladolid, Valladolid, Spain. Let x, y be real. Find all solutions of the equation

2xy + x2 + y 2 = pxy + x + y : x+y 2 2

s

365

2269. Proposed by Cristobal S anchez Rubio, I.B. Penyagolosa,
Castellon, Spain.
Let OABC be a given parallelogram with AOB = 2 0; =2 . A. Prove that there is a square inscribable in OABC if and only if

and

B. Let the area of the inscribed square be Ss and the area of the given parallelogram be Sp . Prove that

,

Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. Given 4ABC with sides a, b, c, a circle, centre P and radius intersects sides BC , CA, AB in A1 and A2 , B1 and B2 , C1 and C2 respectively, so that

2270.

Proposed by F.R. Baudert, Waterkloof Ridge, South Africa. A municipality charges householders per month for electricity used according to the following scale: rst 400 units | 4.5cj per unit; next 1100 units | 6.1cj per unit; thereafter | 5.9cj per unit. If E is the total amount owing in dollars for n units of electricity used, nd a closed form expression, E n. 2272?. Proposed by no name on proposal please identify! Write r - s if there is an integer k satisfying r k s. Find, as a function of n n 2, the least positive integer k satisfying

2271.

k - k - k - : : : - k - k: n n,1 n,2 2

The proposer has not seen a proof, and has veri ed the conjectured solutions for 2 n 600.

366

2273. Proposed by Tim Cross, King Edward's School, Birmingham, England. Consider the sequence of positive integers: f1, 12, 123, 1 234, 12 345, : : : g, where the next term is constructed by lengthening the previous term at its right-hand end by appending the next positive integer. Note that this next integer occupies only one place, with carrying" occurring as in addition: thus the ninth and tenth terms of the sequence are 123 456 789 and 1 234 567 900 respectively. Determine which terms of the sequence are divisible by 7. 2274. Proposed by V
aclav Konecn
y, Ferris State University, Big Rapids, Michigan, USA.

A. Let m be a non-negative integer. Find a closed form for B. Let m 2 f1; 2; 3; 4g. Find a closed form for

n m X Y k=1 j =0 n m X Y k=1 j =0

k + j .

k + j 2.

C?. Let m and j j = 0; 1; : : : ; m be non-negative integers. Prove or m+1 n m X Y Y disprove that k + j j is divisible by n + j .

k=1 j =0 j =0

India. Let b

2275.

367

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 1940. 1994: 108; 1995: 107, 205; 1996: 321; 1997: 170 Proposed by Ji Chen, Ningbo University, China. Show that if x; y;z 0,

1 1 1
xy + yz + zx x + y 2 + y + z 2 + z + x2 9 : 4

dia.

In response to Marcin Kuczma's comment 1997: 170 , I present the details of my proof of the assertion:

2a2 , bc 0

when

2b2 , ca 2c2 , ab; where a, b, c are the side lengths of a triangle satisfying 0 a b c.

We have

a+b

So, 2 a2 + b2 a + b2 further that

,

c:

1

1; and

bc bc , 2a2 bc : 2 ac 2b2 , ca ac c , a 1 implies that c , a2 c , a b ; and further that Thus c,b c ,
2 b c,b a 2 c , a bc bc bc , 2a2 : So we have c , b2 ac ac 2b2 , ca bcb , c22a2 , bc + cac , a22b2 , ca

0:

368 1996: 218 Proposed by P. Penning, Delft, the Netherlands. Find the smallest integer in base eight for which the square root also in base eight has 10 immediately following p `decimal' point. the In base ten, the answer would be 199, with 199 = 14:10673 : : : . Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let n be a positive integer with the given property. Let m be the integer part of pn and n = m2 + p. The base 8 representation of a real number x is denoted by x8. By hypothesis,

1 9 9 which is equivalent to m2 + 1 m + 64 n m2 + 32 m + 6422 : 4 It is easy to see that these inequalities can be replaced by the following stronger ones by taking into account that the expressions on both sides cannot be integers:

2158.

9 m + 1 = m + 0:108 pn m + 0:118 = m + 64 ; 8

+ m2 + m 4 1 n m2 + 9m : 32 1 For example, any integer greater than or equal to m2 + m + 64 must be 4 m+1 , since m is an integer.|Ed. So greater than or equal to m2 + 4 m + 1 p 9m :

The lower limit has to be less than the upper limit, hence m 8. For 8 m 10 the lower limit is greater than 2 and the upper limit less than 3 so no integer value of p exists . If m = 11 then p = 3; therefore the smallest m is 11 and so the smallest n is m2 + p = 124 = 1748, where

p

32

Also solved by CHARLES ASHBACHER, Hiawatha, Iowa, USA; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; THEODORE CHRONIS, student, n Aristotle University of Thessaloniki, Greece; MIHAI CIPU, Instituteof Mathematics, Romanian Academy, Bucharest, Romania; GEORGI DEMIREV, Varna, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; ROBERT GERETSCHLAGER, Bundesrealgymnasium, Graz, Austria; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; D. KIPP JOHNSON, Valley Catholic High School, Beaverton, Oregon, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. The curious fact that the smallest solution for base 8 is 124 = 112 + 3 and for base 10 is 199 = 142 + 3 both written in base 10 is no coincidence! Geretschlager, Godin, and the proposer consider other bases as well, and

369 show that the smallest base 10 integer whose square root when written in base b has 10 immediately following the decimal" point is

b , 1
2 + 1 if b is odd 2 3b , 2
2 + 3 if b is even: :

8

Janous lists all base 10 positive integers 10000 which satisfy the condition of the problem, and gets 144 such integers, starting 124, 229, 329, : : : . From this list one can nd, for example, that: the rst occurrence of a consecutive pair is 1860; 1861 also pointed out by Engelhaupt; the last integer not part of a consecutive pair appears to be 3616; the rst consecutive triple is 5644; 5645; 5646; and so on. Can anyone nd any general patterns here for arbitrary bases? Tsaoussoglou reports that the smallest integer whose square root in base 10 has 100 immediately following the decimal point is 992 +20 = 9821 p 9821 = 99:100958 : : : , and that the corresponding answer for base 8 is 712 + 18 = 5059 p5059 = 107:100657 : : : 8. What if we want 1000 following the decimal point? Or 1 followed by n zeros?

2159. 1996: 218 Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let the sequence fxn ; n 1g be given by

where t 0 is an arbitrary real number. Show that for all k, l 1, there exists an index m = mk;l such that xk xl xm . Solution by D. Kipp Johnson, Valley Catholic High School, Beaverton, Oregon, USA. Since xn = 1 for all n if t = 1, any index m will su ce. We distinguish two other cases. First, let t 1. By the AM GM inequality,

1 xn = n 1 + t + : : : + tn,1

n,1 p1 t : : : tn,1 n xn = 1 + t + n + t p p = n t1++n,1 = n tnn,1=2 = tn,1=2: This last quantity increases without bound as n ! 1, so there must be an index m for which xk xl xm for given indices k; l.

so xk xl k or l. Also solved by THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; MIHAI CIPU, Institute of Mathematics, Romanian Academy, Bucharest, Romania; GEORGI DEMIREV, Varna, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; THOMAS C. LEONG, City College of City University of New York, New York, USA; HEINZ-JURGEN SEIFFERT, Berlin, Germany; and the proposer. Some solvers noted that since x1 = 1 for all t, m = 1 will work for all k and l whenever t 1. Cipu and the proposer found that m = k + l , 1 works when t 1.

t 1. Then n,1 1 + 1 + + 1 = 1; xn = 1 + t + n + t n xk and xk xl xl, and we may choose the index m to equal either

4ABC is a triangle with A 90 . Let P be an interior point of ABC such that BAP = ACP and CAP = ABP . Let M and N be the incentres of 4ABP and 4ACP respectively, and let R1 be the circumradius of 4AMN . Prove that 1 = 1 + 1 + 1 : R1 AB AC AP

Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let a; b; c denote the sides BC; CA; AB and ; ; the angles of the triangle. Then

2160.

APB = 180 , ABP , BAP = 180 , ABP , + CAP = 180 , and by the cosine law in 4APB c2 = AP 2 + BP 2 + 2AP BP cos : 4ABP and 4CAP are by hypothesis similar, whence BP = cAP and b 2 c2 = AP b2 + c2 + 2bc cos : b2 By setting x2 = b2 + c2 + 2bc cos AP 2 AP = bc and BP = c b = cx : x

371 Let X be the point where the incircle of 4APB touches AP . Then

PX = AP + BP , AB = c b +xc , x 2 2 c b + c2 , x2 = 2x b + c + x 2 sin2 = x 2bc + c +2x b and since XPM = 1 APB = 90 , 2 we get 2 2 PX 2 PM = sin = x 2bc+sin+ x : b c 2 PM Since 4NPM and 4CPA are similar, MN = bAP , and by using the fact that MAN = 2 , we have

1 2 sin 2 R1 = MN bc = 2 2x 2sin 22 b xbcb+sin x c+ b+c+x = bc 1 + 1 + 1 : = AB AC AP

Also solved by MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; n RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MARIA ASCENSION LOPEZ CHAMORRO, I.B. Leopoldo Cano, Valladolid, Spain; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer.

2161. 1996: 219 Proposed by Juan-Bosco Romero M
arquez, Universidad de Valladolid, Valladolid, Spain. Evaluate 1

1 2n , 13n , 1 : n=1

X

Solution by David E. Manes, SUNY at Oneonta, Oneonta, NY, USA Let S denote the given summation. We show that

3 S = 2 ln2 , 3 ln 3 + 6 0:64527561: 2

1 X

S =

1 2 + X 1 , 3 = , 2n n=1 2n , 1 n=1 n 3n , 1 1 1 1 X X 1 = 2 ,1n,1 n , 3 , 31n n=1 n=1 3n , 1 1 1 X = 2 ln 2 , 3 , 31 : 1 n n=1 3n , 1 Since the sequence of functions ffnxg, where fnx = x3n+1 , x3n+2 , is uniformly convergent on 0; 1 , 1 1 X 1 , 31n = 1 , 3 + 1 , 1 + 1 , 1 + 2 5 6 8 9 n=1 3n , 1

n=1 1 X

3 2n , 1 , 3n , 1 2

= = = = = = =

Z 1 Z 1

3 Substituting 2 into 1, we nd S = 2 ln 2 , 3 ln 3 + 6 , as claimed. 2 Also solved by THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; GEORGI DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria jointly; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; D. KIPP JOHNSON, Valley Catholic High School, Beaverton, OR, USA; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; HEINZ-JURGEN SEIFFERT, Berlin, Germany; and the proposer. Two incorrect solutions were also received.

x1 , x1 + x3 + x6 + dx 0 Z 1 x1 , x dx = Z 1 x dx 0 1 , x3 0 1 + x + x2 Z 1 1 x + 2 dx , 1 Z 1 1 dx , 2 1 2 + 3 2 0 x+ 2 0 1+x+x 4 1 ln1 + x + x2 , 1 p tan,1 2x + 1
1 2 p3 2 2 3 0 p 1 ln3 , 3 tan,1 p3 , tan,1 p
1 2 3 3 p3 1 ln3 , : 2 2 3 6

p

x , x2 + x4 , x5 + x7 , x8 + dx

373 About half of the solvers used the 0non elementary approach of considx ering the Euler psi-function x = , x where ,x denotes the gamma , function. Both Hess and Sei ert pointed out that the evaluation of the more P 1 general sum 1 n+pn+f p ,1, f ,1, p 6= f can be found in n=1 Tables of Integrals, Series, and Products by I.S. Gradsteyn and I.M. Ryzhik Academic Press, 1994, 5th edition. Speci cally, the following formulas can be found on p. 952 and p. 954, respectively:

x = , ,

1 X

P 1 1 Since S = 1 n, 1 , n, 1 , one obtains easily from the above n=1 2 3 p3 ,2 , formulas that S = 3 , 1 = 2 ln2 , 3 ln3 + 6 as in the solution 2 2

above.

n=1

1 1 , n ; x 0; n,1+x

2162. 1996: 219 Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. In 4ABC , the Cevian lines AD, BE , and CF concur at P . XY Z is the area of 4XY Z . Show that

DEF = PD PE PF 2 ABC PA PB PC

I. Solution by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain

It is a standard exercise for example, 13.5.6 in H.S.M. Coxeter, Introduction to Geometry to show that

DEF = + 1 ABC + 1 + 1 + 1 AF , = BD , = CE . with = FB DC EA Since in our case, according to Ceva's Theorem, = 1, all we have

to prove is that

PB = PAB ; PE PEA PAF + 1 = PAB ; PFB PFB PBD + 1 = PBC ; PDC PDC

and

II. Comment by Murray S. Klamkin, University of Alberta, Edmonton, Alberta. The corresponding more general problem for a simplex is given in 2 and also with a slightly modi ed proof in 3 . It is shown that if V0 , V1 , : : : , Vn denote the n +1 vertices of a simplex S in n dimensional Euclidean space0 0 and if V00 , V10 , : : : , Vn denote the n + 1 vertices of an inscribed simplex S such that the cevians Vi Vi0 are concurrent at a point P within S , then VOL S 0 n01 : = 1 , 1 , : :: :n1 , : VOL S 0 1 : n Here the barycentric representation for P is P = 0V0 + 1 V1 + : : : + n Vn where 0 + 1 + : : : + n = 1 and i 0. It is also shown that the volume of S 0 is a maximum if P is the centroid. Also PV 0 =PV = i =1 , i . For this and other metric properties of concurrent cevians of a simplex see 1987: 274 275 . Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Val ladolid, Spain; MIGUEL ANGEL CABEZON OCHOA, Logro~ o, Spain; GEORGI n DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; TOSHIO SEIMIYA, Kawasaki, Japan; and the proposer. Janous refers to 4, p. 342, item 1.3 for a closely related identity. Bellot quotes Victor Th bault who reported an 1881 reference for the e exercise that began our featured solution. This exercise is often attributed

375 to Routh 1891. For those who read Bulgarian, he also provides a reference concerning interesting properties of a cevian triangle DEF : Hristo Lesov, Projections of noteworthy points of the triangle following the respective cevians in Bulgarian. Matematyka & Informatyka, 5 1994 42 49. He further mentions 1, p. 78 where a problem of Langendonck is solved: Given a 4ABC , nd the probability of selecting a point P inside the triangle such that it is possible to form a triangle whose sides equal the respective distances from P to the sides of the 4ABC . The probability turns out to be DEF = ABC . 1 Heinrich Dorrie, Mathematische Miniaturen, F. Hirt, Breslau, 1943. 2 M.S. Klamkin, A volume inequality for simplexes, Univ. Beograd Publ. Elektrotehn. Fak. Ser. Mat. Fiz. No. 357 380 1971 3 4. 3 M.S. Klamkin, International Mathematical Olympiads 1978 1985, Math. Assoc. Amer., Washington, D.C., 1986, pp. 87 88. 4 D.S. Mitrinovi et. al., Recent Advances in Geometric Inequalities, c Kluwer Academic Publishers, 1989.

2163. 1996: 219 Proposed by Theodore Chronis, student, Aristotle University of Thessaloniki, Greece. Prove that if n;m 2 N and n m2 16, then 2n nm. I. Solution by Florian Herzig, student, Perchtoldsdorf, Austria. Let x = pn m 4. Then we rst prove that x2 2x . This inequality is equivalent to

De ne f x as x=ln x. Then

x 2 : ln x ln 2

, f 0x = ln x x21 ln which is positive for all x 4. Moreover f x is continuous and di erentiable in the interval 4; 1 and f 4 = f 2. Hence x2 2x , and so, nm x2x 2xx = 2n.

II. Solution by D. Kipp Johnson, Valley Catholic High School, Beaverton, Oregon. We rst show that the inequality is true for any m 4 with the smallest allowable n, namely n = m2, and then we induct on n. For the rst step we let m 4 and n = m2 and consider the following equivalent statements:

1=2 m,1 2 ,1 1 + m 1 1 21=2 ,

1 log2 1 + m 1 1 2 , log2 m , log2 m , 1 1 : 2 This permits us to write the following m , 4 inequalities: log2 5 , log2 4 1 2 log2 6 , log2 5 1 2

log2m , log2 m , 1 1 ; 2 which, when added, telescope to produce the desired log2 m m=2.

. . .

For the second step we induct on n. We shall assume that for some nn+1 m2 16 we have 2n nm. Multiplying each side by 2 we obtain 2 2 nm . It will su ce to show that 2 nm n + 1m , which is equivalent to 2 1 + 1=nm. The following sequence of inequalities does the trick:

2 pe

1 m2 1 + 1 m 1 + 1 m ; 1 + m2 m2 n

and the proof is nished. Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; MIHAI CIPU, Romanian Academy, Bucharest, Romania; GEORGI DEMIZEV, Varna, Bulgaria, and MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; RUSSELL EULER and JAWAD SADEK, NW Missouri State University, Maryville, Missouri; SHAWN GODIN, St. Joseph Scollard Hall, North Bay, Ontario; FABIAN MARTIN HERCE, student, Universidad de La Rioja, Logro~ o, Spain; RICHARD I. HESS, Rann cho Palos Verdes, California, USA; JOE HOWARD, New Mexico Highlands University, Las Vegas, NM, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; HEINZ-JURGEN SEIFFERT, Berlin, Germany; DIGBY SMITH,

377 Mount Royal College, Calgary, Alberta; EDWARD T.H. WANG, Wilfrid Laurier University, Waterloo, Ontario; and the proposer. There was 1 incomplete solution. Hess actually proves a somewhat stronger result by replacing the condition n m2 16 by the 2 conditions n 16 and n m2. 1996: 273 Proposed by Toshio Seimiya, Kawasaki, Japan. Let D be a point on the side BC of triangle ABC , and let E and F be the incentres of triangles ABD and ACD respectively. Suppose that B , C , E, F are concyclic. Prove that

2164.

AD + BD = AB : AD + CD AC

Solution by the Con Amore Problem Group, the Royal Danish School of Educational Studies and Informatics, Copenhagen, Denmark. The intersection points of the line EF with AB; AC , and AD will be called G; H and K , respectively, and we put B = 2y , and C = 2z , so GBE = EBD = y, and DCF = FCH = z. Since B; C; E; F are concyclic, GEB = FCD = z , and CFH = EBD = y ; and so giving

AGH = y + z = AHG

using 1 : EG = AG = AH = FH , whence EG + 1 = FH + 1, or In 4ABD let the inradius, the altitude from D, and the area be r1 , h1 and T1 , respectively; and in 4ACD let the corresponding quantities be r2; h2 and T2 . In 4AKG, and 4AKH let the altitude from K be k1 and k2 , k respectively. Then h1 = k1 , whence h2 2 and using 2

KG = KH : EG FH

2

h1 = h2 k1 k2

k1 = KG = KH = k2 ; r1 EG FH r2 h1 = h2 : r1 r2

6 7

Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; RICHARD I. HESS, Rancho Palos Verdes, California, USA; CRISTOBAL SANCHEZ RUBIO, I.B. Penyagolosa, Castellon, Spain; D.J. SMEENK, Zalt bommel, the Netherlands; and the proposer. Bellot Rosado notes that this problem is a special case of problem 1206 H. Demir, Mathematics Magazine, 58, no. 1, January 1985; solution by V. D. Mascioni, Mathematics Magazine, 59, no. 1, February 1986

2165. 1996: 273 Proposed by Hoe Teck Wee, student, Hwa Chong Junior College, Singapore. Given a triangle ABC , prove that there exists a unique pair of points P and Q such that the triangles ABC , PQC and PBQ are directly similar; that is, ABC = PQC = PBQ and BAC = QPC = BPQ, and the three similar triangles have the same orientation. Find a Euclidean construction for the points P and Q. Solution by the Con Amore Problem Group, the Royal Danish School of Educational Studies and Informatics, Copenhagen, Denmark. We identify the Euclidean plane with the complex plane, and points with complex numbers. We may assume without loss of generality that B = 0: 1 Suppose such a P and Q exist. Since 4ABC 4PQC , there is a point complex number X such that P = XA; 2 and Q = XC; 3

or or

P , Q = A: 4 C ,Q C Moreover, if 2 - 4 hold, then P; Q are as desired. Now 2 - 4 imply that XA , XC = A ; C , XC C XA , XC = A , XA; X = 2AA C ; ,

2 P = 2AA, C

On the other hand, if X; P; Q satisfy 5 - 7 then 2 - 4 hold. This proves the existence and uniqueness of P and Q with the desired properties. To nd a Euclidean construction for P and Q, de ne

AC Q = 2A , C : R = 2A , C;

A = R + C; 2 that is, R is the image of C by re ection in A. Also note that Q = A; C R that is, triangles ABR and QBC are similar, and similarly oriented. Finally A + Q = 1 AC + A = A2 = P 2 2 2A , C 2A , C so P is the midpoint of AQ. All this gives us the following construction: A Re ect C in A to get R. B Construct Q such that A and Q are on opposite sides of the line BC , CBQ = RBA, and QCB = ARB.

380 C Construct P as the midpoint of AQ. Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria two solutions; TOSHIO SEIMIYA, Kawasaki, Japan; and the proposer. 1996: 273 Proposed by K.R.S. Sastry, Dodballapur, India. In a right-angled triangle, establish the existence of a unique interior point with the property that the line through the point perpendicular to any side cuts o a triangle of the same area. Solution by Toshio Seimiya, Kawasaki, Japan. Let the right-angled triangle be ABC , with right angle at A. We may assume without loss of generality that AB AC . P is an interior point of 4ABC . The line through P perpendicular to BC meets BC; AC at D; E respectively if AB = AC , then E = A; the line through P perpendicular to CA meets BC; CA at F; G respectively, and the line through P perpendicular to AB meets BC; AB at H; K respectively. We assume that the triangles BHK; CDE; CFG have the same area. Since these triangles are similar, they must be congruent. Since 4CDE 4CGF , we have CD = CG, so that 4CDP 4CGP . Thus we have PCD = PCG. Therefore, CP is the bisector of C . Let M be the intersection of AP with BC if AB = AC; M = D. Since 4BHK 4FCG, we have BH = FC , so that BF = HC: 1 Since PF kAB and PH kAC , we get BF : BM = AP : AM = CH : CM 2 From 1 and 2 we have BM = CM . Therefore, AM is the median of 4ABC . Thus P must be the intersection of the median AM with the bisector of C . It is interesting to note that the bisector of B does not pass through P if AB 6= AC . Conversely, let P be the intersection of the median AM with the bisector of C . Draw the lines DE; FG;HK through P perpendicular to BC , CA, AB respectively, as shown in the gure. Since PCD = PCG, we have 4PCD 4PCG, so that CD = CG. As 4CFG is 4CED we get 4CFG CED. Since PF kAB and PH kAC , we have BF : BM = AP : AM = CH : CM . As BM = CM , we get BF = CH , so that BH = FC . Because 4KBH is 4GFC , we have 4KBH 4GFC . Since 4CDE; 4CGF; 4HKB are congruent, they have the same area. A number of solvers used a coordinate

approach. A = 0; 0, If b2 ; bc . B = 0; c, C = b; 0 and BC = a, then P = 2b+a 2b+a

2166.

381 Also solved by MIGUEL AMENGUAL COVAS, Cala Figuera, Mallorca, Spain; SAM BAETHGE, Nordheim, Texas, USA; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; CON AMORE PROBLEM GROUP, Royal Danish School of Educational Studies, Copenhagen, Denmark; C. DIXON, Royal Grammar School, Newcastle upon Tyne, England; DAVID DOSTER, Choate Rosemary Hall, Wallingford, Connecticut,USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; D.J. SMEENK, Zaltbommel, the Netherlands; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. There were two incorrect solutions. The proposer comments: I am unable to establish the existence of such a point in a general triangle. If we replace perpendicular" by parallel" then the problem is easy and yields the unique point centroid of a triangle." 1996: 274 Proposed by Sefket Arslanagi c, Berlin, Germany. Prove, without the aid of the di erential calculus, the inequality, that in a right triangle

2167.

a2 b + c + b2a + c 2 + p2; abc where a and b are the legs and c the hypotenuse of the triangle.

Solution by Mihai Cipu, Institute of Mathematics, Romania Academy, Bucharest, Romania, and CICMA, Concordia University, Montreal Quebec. Since a2 b + c+ b2a + c = ca2 + b2 + aba + b the given inequality is equivalent to

In an isosceles triangle this relation holds trivially, while in the general p case it is equivalent to 2c + a + bc ab, a simple consequence of c2 ab. Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; CON AMORE PROBLEM GROUP, Royal Danish School of Educational Studies, Copenhagen, Denmark; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; JOHN G. HEUVER, Grande Prairie Composite High School, Grande Prairie, Alberta; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI LAU, Hong Kong; VEDULA N. MURTY, Andhra University, Visakhapatnam, India; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; BOB

382 PRIELIPP and JOHN OMAN, University of Wisconsin Oshkosh, Wisconsin, USA; JUAN-BOSCO ROMERO MARQUEZ, Universidad de Valladolid, Valladolid, Spain; HEINZ-JURGEN SEIFFERT, Berlin, Germany; TOSHIO SEIMIYA, Kawasaki, Japan; D.J. SMEENK, Zaltbommel, the Netherlands; PANOS E. TSAOUSSOGLOU, Athens, Greece; EDWARD T.H. WANG, Wilfrid Laurier University, Waterloo, Ontario; and the proposer. There were four incorrect solutions. From the proof above it is obvious that equality holds if and only if a = b. Both Konepy and Wang pointed out that a weaker version of this cn problem with 2 + 2 replaced by appeared as problem No. 238 in the January, 1983 issue of the College Mathematics Journal. Wang remarked that in the published solution CMJ 15 4, 1984; 352 353 Walter Blumberg and Marshall Fraser independently proved the more general result that

a2b + c + b2a + c 2 + cscC=2 abc where a, b, and c are the sides of an arbitrary triangle with C being the largest angle. The present problem is the special case when C = =2. a2b + c + b2a + c p2c abc a+b,c holds. The triangle with a = 3, b = 4, and c = 5 provides a simple counterexample. Janous remarked that the given inequality could be considered as the special case when n = 1 of the problem of nding the minimum value of 2n n n 2n n n Tn = a b + c + bn a + c abc where a, b, c are the legs and hypotenuse of a right triangle and n 0 is a real number. He proposed the conjecture that Tn 2 + 22,n=2 for all n n0 where n0 is the solution of the equation 2n+4=2 + n = 2.

e 2168?. 1996: 274 Proposed by Jan Ciach, Ostrowiec Swi tokrzyski, Poland. Let P be a point inside a regular tetrahedron ABCD, with circumradius R and let R1 ; R2 ; R3 ; R4 denote the distances of P from vertices of the tetrahedron. Prove or disprove that and that the maximum value of R1 R2 R3 R4 is attained. Klamkin gave a proof for this more general result. Romero M
rquez asked a whether the stronger inequality

383 Solution by Murray S. Klamkin, University of Alberta, Edmonton, Alberta. Ed: First, we give Klamkin's proof for a triangle, which was not published as a solution to 2073? 1995: 277; 1996: 282 ~ ~ ~ ~ Let P be given by the vector P = x1 A1 + x2 A2 + x3 A3 , where x1 + x2 + x3 = 1 and x1, x2, x3 0 barycentric coordinates. Then

~ ~ 2 PA2 = P , A1 1

~ ~ ~ ~ 2 = x2 A2 , A1 + x3 A3 , A1 , = 3 x2 + x2 x3 + x2 ; 2 3 ~ ~ p etc. We have taken R = 1, so that the side of the triangle A2 , A1 = 3.

The given inequality now takes the form

, 2

or in homogeneous form

64 ,x2 + x2 x3 + x2 ,x2 + x3 x1 + x2 ,x2 + x1 x2 + x2 2 3 3 1 1 2 3 x1 + x2 + x36 1 where only x1 , x2 , x3 0. We assume without loss of generality that x1 x2 x3 0 so that we can let x3 = c, x2 = b + c and x1 = a + b + c with a, b, c 0 and a + b + c 0. On substituting back into 1, we get 3a6 + 36a5b + 54a5c + 116a4b2 + 348a4bc + 213a4c2 + 160a3b3 +816a3b2c + 1128a3bc2 + 468a3c3 + 80a2b4 + 864a2b3 c +2232a2b2c2 + 2232a2bc3 + 765a2 c4 + 480ab4 c + 2208ab3c2 +3888ab2c3 + 3060abc4 + 918ac5 + 192b5c + 1104b4c2 +2592b3c3 + 3060b2c4 + 1836bc5 + 459c6 0

since all terms on the left side are non-negative this expansion was conrmed using Mathematica Ed: and using DERIVE . There is equality only if a = c = 0, so that if x1 + x2 + x3 = 1, x1 = x2 = 0:5 and x3 = 0, then the point P must be a mid-point of a side. For a regular tetrahedron, we proceed as before: let P be given by the ~ ~ ~ ~ ~ vector P = x1 A1 + x2 A2 + x3 A3 + x4 A4 , where x1 + x2 + x3 + x4 = 1 and x1 , x2 , x3 , x4 0. Then

~ ~ PA1 = P , A1

~ ~ ~ ~ ~ ~ = x2 A2 , A1 + x3 A3 , A1 + x4 A4 , A1 ;

384 so that

PA2 = a2 ,x2 + x2 + x2 + x3x4 + x4x2 + x2x3 ; 1 2 3 4 etc., where a is an edge of the tetrahedron. So if we take R = 1, we have a2 = 8 . the desired inequality then becomes in homogeneous form 3 9 x1 + x2 + x3 + x4 8 28F1 F2F3 F4; 2

where

F1 = x2 + x2 + x2 + x3x4 + x4 x2 + x2x3 ; 2 3 4 and the other Fi's are obtained by cyclic interchange of the indices 1, 2, 3, 4. Assuming without loss of generality that x1 x2 x3 x4 , we take x4 = d, x3 = d + c, x2 = d + c + b, x1 = d + c + b + a, where a, b, c, d 0 and x1 0. On substituting back into 2 and expanding

out using Mathematica, we get a polynomial Ed: we have omitted this polynomial, since it would cover two whole pages of CRUX with MAYHEM which is non-negative since all the terms are non-negative. There is equality only if a = c = d = 0. Hence x1 = x2 = 0:5 and so P must be the mid-point of an edge. I also conjecture for the correponding result for a regular n dimensional simplex: the product of the distances from a point within or on a regular simplex to the vertices is a maximum only when the point is a mid-point of an edge. Analogously to inequality 2, the conjecture is that

3n,1 x0 + x1 + : : : + xn2n+2 22n+2 F0F1 : : : Fn x0 , x1 , : : : , xn 0, where Fi is the complete symmetric homogeneous polynomial of degree 2 with unit coe cients of all the variables x0 , x1 , : : : ,

xn , except xi, and there is equality only if two of the variables are equal and

the rest are zero. Also solved by CON AMORE PROBLEM GROUP, Royal Danish School of Educational Studies, Copenhagen, Denmark; and RICHARD I. HESS, Rancho Palos Verdes, California, USA.

Crux Mathematicorum

Mathematical Mayhem

385

No. 14 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7 Christopher Small writes: I notice that in the Hints 2 section of the Bernoulli Trials, the statement that the hint does not work for question 9 has been interpolated. It seems to me that the statement is correct as I originally gave it to you. A counterexample is easily found with a = c. For example, a = c = 1 and b = 1=2 is a counterexample. This month, we present solutions to some of the problems in a university entrance scholarship examination paper from the 1940's, which appeared in the April 1997 issue of CRUX with MAYHEM.

1 , x + 22x , 15 , 8x :

2

ax + b + cx + d: There are, of course, two square roots, being this quantity. So we have

Solution. First we note that the only way to generate the given expression as a square, is to square p p

p 2

2 2

gives

a + c = ,1; 1 b + d = 1; 2 ac = ,2; 3 4 ad + bc = ; bd = , : 5 Solving 1 and 2 for c and d respectively, and substituting in 3 and 5

11 2 15 4 2 2 15 4 5 2 3 2

a + a , 2 = a + 2a , 1 = 0; b , b , = b , b + = 0: so that a = ,2; 1 and b = ; , , giving the corresponding values of c = 1; ,2 and d = , ; .

We must now substitute these into 4, and this leads to the solution that the square roots of the given expression are

3 2 5 2 5 2 3 2

,2x + + x ,

5 2

3 2

2 2 2

3 2

We also note that

x + y + z , x + y + z = xy + yz + zx: 2

2 2 2 2

xy + yz + zx = ,5:

Thus, the solution of the given equations is the set of roots of the cubic equation

P , 2P , 5P + 6 = 0:

3 2

P , 1P + 2P , 3 = 0; giving that the other two roots are P = ,2 and P = 3.

Thus, the solution set of the given equations is any permutation of 1; ,2; 3. 3. Suppose that n is a positive integer and that Ck is the coe cient of xk in the expansion of 1 + xn . Show that

n X k=0

2 2

k=0 n X, k=0

!

n X

k=0

k + 1Ckxk

n X

The right member of this product is determine the left member: for example,

Ck xk

+1

x1 + xn =

Ckxk ;

n X k=0

1

k + 1Ckxk :

2 1

1

1 + xn, 1 + n + 1x 1 + xn = 1 + n + 1x1 + x n, : 2n , 1! n + 2 2n , 1! 2n , 1! n , 1! n! n + 1 + n! n , 1! = n! n , 1! :

388

No. 185 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. To begin this number, we give the ten problems of the Seventh Irish Mathematical Olympiad written May 7, 1994. My thanks go to Richard Nowakowski for collecting the problems when he was Canadian Team leader at the IMO in Hong Kong.

Second Paper | 7 May 1994

Time: 3 hours

2

2 4 2 2 4

2. Let A, B, C be three collinear points with B between A and C . Equilateral triangles ABD, BCE , CAF are constructed with D, E on one side of the line AC and F on the opposite side. Prove that the centroids of the triangles are the vertices of an equilateral triangle. Prove that the centroid of this triangle lies on the line AC . 3. Determine with proof all real polynomials f x satisfying the equation

Determine the number of such matrices with the property that the number of 1"s in each row and in each column is even. 5. Let f n be de ned on the set of positive integers by the rules

f x = f xf x , 1: 4. Consider the set of m n matrices with every entry either 0 or 1.

2

2

1 , 2 1, n

2

1 , 21n :

2

389

x =2

1 1

and

nxn = 22n , 1xn, ; n = 2; 3; : : : : Prove that xn is an integer for every positive integer n. 7. Let p, q, r be distinct real numbers which satisfy the equations q = p4 , p r = q4 , q p = r4 , r: Find all possible values of p + q + r. 8. Prove that for every integer n 1 n

X 2k + 1 nn + 1 =n , 1 n 1 , n, = n, + 4: i i

2 2 1 =1 2

9. Let w, a, b, c be distinct real numbers with the property that there exist real numbers x, y , z for which the following equations hold:

x+y+z xa + yb + zc xa + yb + zc xa + yb + zc Express w in terms of a, b, c.

2 3 4 2 3 4 2 3 4

= = = =

w w w:

2 3 4

10. If a square is partitioned into n convex polygons, determine the maximum number of edges present in the resulting gure. You may nd it helpful to use a theorem of Euler which states that if a polygon is partitioned into n polygons, then v , e + n = 1 where v is the number of vertices and e is the number of edges in the resulting gure .

Next we turn to the o cial" results of the 38th IMO which was written in Mar del Plato, Argentina, July 24 and 25, 1997. My source this year was the contest WEB site. I hope that I have made no serious errors in compiling the results and transcribing names. This year a total of 460 students from 82 countries took part. This is somewhat up from last year. Sixty- ve countries sent teams of 6 the number invited to participate in recent years. But there were 13 teams of smaller size, 3 of ve members, 2 of size four, 7 of size three, and 1 with two members.

390 The contest is o cially an individual competition and the six problems were assigned equal weights of seven marks each the same as the last 16 IMO for a maximum possible individual score of 42 and a total possible of 252 for a national team of six students. For comparison see the last 16 IMO reports in 1981: 220 , 1982: 223 , 1983: 205 , 1984: 249 , 1985: 202 , 1986: 169 , 1987: 207 , 1988: 193 , 1989: 193 , 1990: 193 , 1991: 257 , 1992: 263 , 1993: 256 , 1994: 243 , 1995: 267 and 1996: 301 . There were 4 perfect scores. The jury awarded rst prize Gold to the thirty-nine students who scored 35 or more. Second Silver prizes went to the seventy students with scores from 25 to 34, and third Bronze prizes went to the one hundred and twenty-two students with scores from 15 to 24. Any student who did not receive a medal, but who scored full marks on at least one problem, was awarded honourable mention. This year there were seventy-eight honourable mentions awarded. The median score on the examination was 14. Congratulations to the Gold Medalists, and especially to Ciprian Manolescu who scored a perfect paper last year as well.

Eftekhari, Eaman Manolescu, Ciprian Bosley, Carleton Do Quoc Anh Frenkel, P
ter e Pap, Gyula Ivanov, Ivan Terpai, Tam
s a Maruoka, Tetsuyuki Curtis, Nathan Najnudel, Joseph Dourov, Nikolai Rullg ard, Hans Gyrya, Pavlo Lam, Thomas Han, Jia Rui Ni, Yi Zou, Jin Woo, Jee Chul Hornet, Stefan Laurentiu Summers, Bennet Tchalkov, Rayko An, Jin Peng Sun, Xiao Ming Salmasian, Hadi Leptchinski, Mikhail Tcherepanov, Evgueni

Name

Iran Romania United States of America Vietnam Hungary Hungary Bulgaria Hungary Japan United States of America France Russia Sweden Ukraine Australia China China China Republic of Korea Romania United Kingdom Bulgaria China China Iran Russia Russia

Country

Score

42 42 42 42 41 41 40 40 40 40 39 39 39 39 38 38 38 38 38 38 38 37 37 37 37 37 37

391

Herzig, Florian Lippner, G
bor a Bahramgiri, Mohsen Battulga, Ulziibat Farrar, Stephen Zheng, Chang Jin Podbrdsk
, Pavel y Holschbach, Armin Bayati, Mohsen Merry, Bruce Grechuk, Bogdan Kabluchko, Zajhar

Name

Austria Hungary Iran Mongolia Australia China Czech Republic Germany Iran Republic of South Africa Ukraine Ukraine

Country

Score

36 36 36 36 35 35 35 35 35 35 35 35

Next we give the problems from this year's IMO Competition. Solutions to these problems, along with those of the 1997 USA Mathematical Olympiad will appear in a booklet entitled Mathematical Olympiads 1997 which may be obtained for a small charge from: Dr. W.E. Mientka, Executive Director, MAA Committee on HS Contests, 917 Oldfather Hall, University of Nebraska, Lincoln, Nebraska, 68588, USA.

First Day | Time: 4.5 hours

1. In the plane the points with integer coordinates are the vertices of unit squares. The squares are coloured alternately black and white as on a chessboard. For any pair of positive integers m and n, consider a right-angled triangle whose vertices have integer coordinates and whose legs, of lengths m and n, lie along edges of the squares. Let S be the total area of the black part of the triangle and S be the total area of the white part. Let

1 2

f m;n = jS , S j :

1 2 1 2

a Calculate f m;n for all positive integers m and n which are either both even or both odd. b Prove that f m;n maxfm; ng for all m and n. c Show that there is no constant C such that f m;n C for all m and n. 2. Angle A is the smallest in the triangle ABC . The points B and C divide the circumcircle of the triangle into two arcs. Let U be an interior point of the arc between B and C which does not contain A.

392 The perpendicular bisectors of AB and AC meet the line AU at V and W , respectively. The lines BV and CW meet at T . Show that

1 2

AU = TB + TC:

2

jx + x + + xnj = 1

1

and

jxi j n + 1 for i = 1; 2; : : : ; n: 2 Show that there exists a permutation y ; y ; : : : ; yn of x ; x ; : : : ; xn such that jy + 2y + + nynj n + 1 :

1 2 1 2 1 2

4. An n n matrix square array whose entries come from the set S = f1; 2; : : : ; 2n , 1g, is called a silver matrix if, for each i = 1; : : : ; n, the ith row and the ith column together contain all elements of S. Show that a there is no silver matrix for n = 1997; b silver matrices exist for in nitely many values of n. 5. Find all pairs a; b of integers a 1, b 1 that satisfy the equation a b = ba : 6. For each positive integer n, let f n denote the number of ways of representing n as a sum of powers of 2 with nonnegative integer exponents. Representations which di er only in the ordering of their summands are considered to be the same. For instance, f 4 = 4, because the number

2

4 can be represented in the following four ways: 4; 2 + 2; 2 + 1 + 1; 1 + 1 + 1 + 1: Prove that, for any integer n 3: 2n = f 2n 2n = :

2 4 2 2

As the IMO is o cially an individual event, the compilation of team scores is uno cial, if inevitable. These totals and the prize awards are given in the following table.

393

Rank Country Score Gold Silver Bronze Total

1. 2. 3. 4. 5. 4. 5. 6. 7. 8. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 20. 21. 22. 23. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 30. 31. 32. 33. 32. 33. 34. 35. 34. 35. 36. 37. 38. 37. 38. 39. 40. 41. 42. 41. 42. 43. 44. 45.

China Hungary Iran Russia United States of America Ukraine Bulgaria Romania Australia Vietnam Republic of Korea Japan Germany Republic of China Taiwan India United Kingdom Belarus Czech Republic Sweden Poland Yugoslavia Israel Latvia Croatia Turkey Brazil Colombia Georgia Canada Hong Kong Mongolia France Mexico Armenia Finland Slovakia Argentina The Netherlands Republic of South Africa Cuba Belgium Singapore Austria Norway Greece

223 219 217 202 202 195 191 191 187 183 164 163 161 148 146 144 140 139 128 125 125 124 124 121 119 117 112 109 107 106 106 105 105 97 97 96 94 94 93 91 88 88 86 79 75

6 4 4 3 2 3 2 2 2 1 1 1 1 1 1 1

2 2 2 4 3 3 3 3 5 4 3 3 4 3 2 2 2 3 2 2 1 1 1 1 1 1 2

1 1 1 1 1 1 2 2 3 2 4 2 2 3 5 4 4 4 4 6 3 2 5 3 1 3 3 4 2 3 2 2 3 4 1 3

1 1

1 1

1 1

2 1

6 6 6 6 6 6 6 6 6 6 6 5 6 6 6 5 6 5 4 4 5 6 5 5 5 5 6 4 4 5 4 2 4 3 4 3 3 2 3 3 3 4 2 3 1

394

46. 47. Kazakhstan 46. 47. Former Yugoslav Republic of Macedonia 48. 49. Italy 48. 49. New Zealand 50. Slovenia 51. Lithuania 52. Thailand 53. 54. Estonia 53. 54. Peru 55. Azerbaijan 56. Macao 57. 59. Denmark 57. 59. Moldova team of 3 57. 59. Switzerland team of 5 60. 61. Iceland 60. 61. Morocco 62. Bosnia and Herzegovina team of 5 63. Indonesia 64. Spain 65. Trinidad and Tobago 66. Chile 67. Uzbekistan team of 3 68. Ireland 69. 70. Malaysia 69. 70. Uruguay 71. 72. Albania team of 3 71. 72. Portugal team of 5 73. Philippines team of 2 74. Bolivia team of 3 75. Kyrgyztan team of 3 76. 78. Kuwait team of 4 76. 78. Paraguay 76. 78. Puerto Rico 79. Guatemala 80. Cyprus team of 3 81. Venezuela team of 3 82. Algeria team of 4

Rank Country Score Gold Silver Bronze Total

73 73 71 71 70 67 66 64 64 56 55 53 53 53 48 48 45 44 39 30 28 23 21 19 19 15 15 14 13 11 8 8 8 7 5 4 3

1 3 1 2 2 1 1 2 2 1 1 2 2 1

1 3 1 2 2 2 1 2 2 1 1 2 2 1 1

395 This year the Canadian Team slid to 29th place from 16th last year and 19th the previous year. The Team members were:

Byung Kyu Chun Adrian Chan Mihaela Enachescu Sabin Cautis Jimmy Chui Adrian Birka 29 25 21 16 10 6 Silver Silver Bronze Bronze Honourable Mention

The Canadian Team Leader was Richard Nowakowski, of Dalhousie University, and the Deputy Team Leader was Naoki Sato, currently a student at the University of Toronto and former Canadian Silver medalist. The Chinese Team placed rst this year. Its members were:

Jia Rui Han Yi Ni Jin Zou Jin Peng An Xiao Ming Sun Chang Jin Zheng 38 38 38 37 37 35 Gold Gold Gold Gold Gold Gold

Congratulations to the Chinese Team!! Now we turn to solutions to problems of the Czechoslovakia Mathematical Olympiad 1993 1996: 109 .

Solutions by Mansur Boase, student, St. Paul's School, London, England; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. No such n exists. Suppose n is a natural number for which 6n , 1 j 7n , 1. Since 6n 1 mod 5 we have 5 j 7n , 1. From 7 2; 7 ,1, 7 3 and 7 1 mod 5, we see that 7n , 1 0 mod 5 if and only if 4 divides n. In particular, n must be even, which implies, since 6 1 mod 7 that 6n 1 mod 7; that is, 7 j 6n , 1. However, obviously 7 6 j 7n , 1, which is a contradiction. 2. A 19 19 table contains integers so that any two of them lying on neighbouring elds di er at most by 2. Find the greatest possible number of mutually di erent integers in such a table. Two elds of the table are considered neighbouring if they have a common side.

2 3 4 2

CZECHOSLOVAK MATHEMATICAL OLYMPIAD 1993 Final Round 1. Find all natural numbers n for which 7n , 1 is a multiple of 6n , 1.

396 land. Solution by Mansur Boase, student, St. Paul's School, London, Eng-

We shall rst prove that the value 71 for the number of di erent integers is attainable. We can assume, without loss of generality, that the number in the top left hand square is 0. We can then form the following array:

0 2 4 6

. . .

1 3 5 7

. . .

3 5 7 9

. . .

5 7 9 11

. . .

31 33 35 37

. . .

33 35 37 39

32 33 35 37 34 35 37 39 35 37 39 41

63 65 66 65 67 68 67 69 70

. . .

34 36 38 40

. . .

The di erence in the values of opposite corners of the array cannot exceed twice the number of moves to get from one to the other passing through adjacent squares. This equals

2 36 = 72:

Thus there can be at most 73 di erent values since every square in the array can be reached from the top left square in at most 36 moves. We need to prove that there is no array with 72 or 73 di erent numbers. The value 73 can only occur if the di erence between every pair of adjacent squares is exactly 2, for otherwise one of the shortest paths from opposite corners can pass through the pair of adjacent squares whose value is not 2, giving a contradiction. If the number of distinct values is 72, then the bottom right hand square must have value 71, so in any shortest path, there is a pair of adjacent squares with di erence only 1. To have 72 values, all the even and odd numbers less than or equal to 71 must be in the table. There is a possibly broken dividing line separating the odd and even numbers, all numbers on the side of 71 being odd. If there is a gap on the line, then there is a shortest path from 71 to 0 without crossing the line, which is impossible. Considering 1 and 71 we see that the shortest distance must be 35, so that one of the squares adjacent to 0 must contain 1. The broken line separating even and odd entries cannot have the form

397

or

for otherwise these would be a shortest path from 0 to 71 with more than one di erence of 1. It follows that the even entries are con ned to the rst row or the rst column, contradicting that there are 36 of them. 4. A sequence fang1 of natural numbers is de ned recursively by n a = 2 and an = the sum of 10th powers of the digits of an , for all n1 1. Decide whether some numbers can appear twice in the sequence fan gn . Solution by Mansur Boase, student, St. Paul's School, London, England. Let an have dn digits, so dn 1 + log an . Then an dn 9 1 + log an 9 an for an su ciently large, as x ! 1 as x ! 1. Thus an an if an an 9 . x Let K be the rst natural number for which K K 9 . Then if ai K , the sequence decreases until there is a term K . Hence the sequence has in nitely many terms K , and there must be a term repeated in nitely often. 5. Find all functions f : Z! Zsuch that f ,1 = f 1 and

=1 1 +1 =1 +1 10 10 10 10 1+log +1 1+log10 10 1+log10 10

land.

f 1 + f y = f 1 + 2y + f ,y 1 f y + f ,1 = f ,y + f ,1 + 2y 2 f 1 = f ,1 and f y = f y, so equating 1 and 2 f 1 + 2y + f ,y = f ,y + f ,1 + 2y: Hence f 2y + 1 = f 2y , 1 for all integers y . ? Also f y + f 1 = f 3y + f 1 , 2y and since f 1 = f 1 , 2y making use of ? f y = f 3y .

Also, equating this with equation 1

f 3y = f ,y: Thus f y = f 3y = f ,y and f y = f ,y for all y . If y is odd, then f y = f y , 2xy so f x = f x + 2xy . Thus f 2a = f 2a1 + 2y .

Thus an odd multiple of a number and that number give the same value. Therefore if n = 2k a, a odd, then f n = f 2k. Therefore all functions must be such that f 2ka = f 2k, k 0 where a is odd and f 2k for each k can take any value as can f 0. These functions always satisfy the conditions since f ,1 = f 1 and

For the remainder of this number of the Corner we turn to readers' solutions to 10 of the problems of the Baltic Way | 92 Contest given in the May 1996 number of the Corner 1996: 157 159 .

MATHEMATICAL TEAM CONTEST BALTIC WAY | 92" Vilnius, 1992 | November 5 8 1. Let p, q be two consecutive odd prime numbers. Prove that p + q is a product of at least 3 positive integers 1 not necessarily di erent. Solutions by Sefket Arslanagi
, University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA; by Michael Selby, University of Windsor, Windsor, Ontario; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. Since p and q are odd, p + q is even and has a factor of 2. The corresponding factor p + q lies strictly between p and q and is not prime since p and q are consecutive prime numbers. It must therefore have two factors at least. Hence p + q is a product of at least 3 positive integers greater than 1. 2. Denote by dn the number of all positive divisors of a positive integer n including 1 and n. Prove that there are in nitely many n such that d n is an integer. n

1 2

399 Solutions by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA; by Michael Selby, University of Windsor, Windsor, Ontario; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Bradley's solution. Let p be a prime. Then pp, has factors 1; p; p ; : : : ; pp, , which are p in number. Hence, for such n, pp, =dpp, = pp, which is integral. Hence there are in nitely many n such that n=dn is an integer. 3. Find an in nite non-constant arithmetic progression of positive integers such that each term is neither a sum of two squares, nor a sum of two cubes of positive integers. Solutions by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Michael Selby, University of Windsor, Windsor, Ontario; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Godin's solution. Looking at squares mod 4 we see

1 2 1 1 1 2

x x mod 4

0 1 2 3 0 1 0 1

2

thus if x 3 mod 4, it is impossible to express x as a sum of two squares. Similarly, looking at cubes mod 7 we see

x x mod 7

0 1 2 3 4 5 6 0 1 1 6 1 6 6

3

and again if x 3 mod 7 it is impossible to express x as a sum of 2 cubes. Thus the sequence s = 3, sn = sn + 28 has all sn 3 mod 4 and sn 3 mod 7 so all the terms are not the sum of 2 squares or cubes. 4. Is it possible to draw a hexagon with vertices in the knots of an integer lattice so that the squares of the lengths of the sides are six consecutive positive integers? Solutions by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, Clifton College, Bristol, UK; and by Shawn

0 +1

400 Godin, St. Joseph Scollard Hall, North Bay, Ontario. We give Bradley's solution. No. It is not possible. Six consecutive positive integers must contain three odd numbers and three even numbers. To form them as the sums of squares must involve an odd number of odd squares. The sum of all the numbers whose squares are made is therefore odd. But to move from 0; 0; 0 to 0; 0; 0 involves a total number which is even going out and coming back to put it loosely. A pentagon, on the other hand, can be made, for example,

0; 0; 0 ! 0; 1; 1 ! 1; 2; 2 ! 1; 2; 4 ! 1; 1; 2 ! 0; 0; 0 involving sides whose squares are 2; 3; 4; 5; 6 | with two odd numbers. 5. Given that a + b + a + b = c + d + c + d , prove that a + b + a + b = c + d + c + d .

2 2 2 2 2 2 4 4 4 4 4 4

x + y + x + y = 2 ,x + 2x y + 3x y + 2xy + y , 1 = 2 x + xy + y = 2 x + y + x + y for all x, y . 6. Prove that the product of the 99 numbers k , , k = 2; 3; : : : ; 100, k

4 4 4 4 2 3 2 2 3 4 2 2 2 2 2 2 3 2 3 1 3 +1

Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Michael Selby, University of Windsor, Windsor, Ontario; by Panos E. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Wang's solution. This follows immediately from the fact that

is greater than . Solutions by Sefket Arslanagi
, University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Michael Selby, University of Windsor, Windsor, Ontario; by Panos E. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Wang's solution and comment. Q Let P n = n k , where n 2. We show that in general k k

3 =2 1 3 +1

2

n P n = 23n+ n + 1 n + 1

2 2 3

k + 1 , k + 1 + 1 = k + k + 1;

2

. Since

401 we have

P n =

Remark: It is easy to see that the sequence fP ng, n = 2; 3; : : : is strictly decreasing and from the result established above we see that limn!1 P n = . This result is well known and can be found in, for example, Theory and Application of In nite Series, by K. Knopp Ex. 852 on p. 28. 7. Let a = p1992. Which number is greater:

2 3 1992

q

n Y

2 2 =2 2 =0 =2 =2 1 =1 2 2 2 2

a9

= ;

q q

1992 or 1992?

Solutions by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Michael Selby, University of Windsor, Windsor, Ontario; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Godin's solution. Let f x = ax . Clearly p q if and only if f p f q; that is, f is strictly increasing. Similarly if f n x is de ned by f x = f x and f n x = f f nx, so f nx = f f :z: : f x then p q if and only |

1 +1

if f np f nq for all n. Now 1992 a. Thus f 1992 f a. But f 1992 = 1992, so f 1992 = 1992. Now f a is the expression in question so 1992 is the larger. Editor's Note. Selby points out that if xk = f ka then limk!1 xk = L where a = L =L or L = 1992. 8. Find all integers satisfying the equation

1992 1992 1992 1992 1

2x 4 , x = 2x + 4:

Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin,

402 St. Joseph Scollard Hall, North Bay, Ontario; by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA; by Michael Selby, University of Windsor, Windsor, Ontario; by Panos E. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Tsaoussoglou's solution. Checking

+ 2x = 24x, x2

0; so , 2 x 4:

1 6= 2,1 + 4 = 2 2 4 , ,1 5 + 1 = 20, 02 is a solution 4 21 + 2 is a solution 2= 4,1 + 4 = 22, 22 is a solution 4 23 + 2 is not a solution 8= 4,3

3

Solutions by Christopher J. Bradley, Clifton College, Bristol, UK; by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA; and by Michael Selby, University of Windsor, Windsor, Ontario. We give Selby's solution. Suppose a = 0. Then c = 0 and f x = x + bx. Therefore there are p p three roots: x = 0, x = ,b, x = , ,b. If a 0, then c = ab 0, since b 0. Now f 0 = c 0 and since limx!1 f x = 1, there is some r in 0; 1 such that f r = 0. Also f ,a = ,a + a , ab + c = , ab 0. Since f 0 0 and f ,a 0, there is a root r in the interval ,a; 0. Finally, since f x ! ,1 as x ! ,1 and f ,a 0 there must be a root r in ,1; ,a. If a 0, c = ab 0. Hence f 0 = c 0 while f x ! ,1 as x ! ,1. Therefore we have a root t in ,1; 0. f ,a = ,a + a , ab + c = , ab 0. Hence there must be a root t in 0; ,a. Finally f x ! 1 as x ! 1. Since f ,a 0 there need be a root t in ,a; 1. In all cases we have three distinct roots.

3 9 1 1 3 3 8 9 2 3 9 1 3 3 8 9 2 3

ab = 9c. Prove that the polynomial has three di erent real roots.

9. A polynomial f x = x

+ ax + bx + c is such that b

2

0 and

403

10. Find all fourth degree polynomials px such that the following four conditions are satis ed: i px = p,x, for all x, ii px 0, for all x, iii p0 = 1, iv px has exactly two local minimum points x and x such that jx , x j = 2. Solutions by Christopher J. Bradley, Clifton College, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; and by Michael Selby, University of Windsor, Windsor, Ontario. We give Selby's solution. Condition i implies px is even.

1 2 1 2

px = ax + bx + cx + dx + e; p,x = ax , bx + cx , dx + e: Hence we have 2bx + 2dx = 0 for all x. Thus b = d = 0. Also p0 = 1. Therefore px has the form px = ax + cx + 1: c Now p0 x = 4ax + 2cx. The critical points are x = 0, x = ,a . Hence

4 3 2 4 3 2 3 4 2 3 2

Further we want px 0. Since px ! 1 as jxj ! 1 then since p0 = 1, we need at x q ,ac , px =q ca +c , ,ac +1 0. So ,c +1 0 = a q a ,c , x = , ,c , jx , x j = 2 ,c = 1 or or 4a c . Also x = a a a ,c = 2a. Since 4a c , we have 4a 4a or a1 , a 0. Therefore since a 0, 1 , a 0 and we have 0 a 1, c = ,2a. The polynomials are of the form ax , 2ax + 1 where 0 a 1.

2 2 2 2 4 2 2 4 2 1 2 2 2 1 2 2 2 2 4 2

a 0.

2 c we must have ,a 0. 2 p00 x = ,c ax02 +2c. Since,c want exactly two local minima, we must 12 , we have at x2 = , p x = 12a + 2c = ,4c 0. Therefore c 0 and 2

That completes the Corner for this issue. Send me your nice solutions and contest materials.

404

BOOK REVIEWS

Edited by ANDY LIU

144 Problems of the Austrian-Polish Mathematics Competition 1978 1993, compiled by Marcin Emil Kuczma, University of Warsaw, published by the Academic Distribution Center, 1993, 1216 Walker Road, Freeland, Maryland 21053, USA, ISBN 0-9640959-0-4, softcover, 157+ pages, US$20 plus handling. 40th Polish Mathematics Olympiad 1989 90, edited by Marcin Emil Kuczma, University of Warsaw, published by Science, Culture, Technology Publishing, AMK Central Post O ce, Box 0581, Singapore 915603, no ISBN, softcover, 49+ pages, US$10 plus handling. Reviewed by Andy Liu, University of Alberta. Both books under review are by Marcin Kuczma, one of the world's leading problem proposers. In IMO95 in Canada, two of his problems made it and a third nearly did. He is responsible for a substantial number of problems in these two books, which come with the highest recommendation. While originality can never be guaranteed since great minds tend to think alike across space and time, the author strived to come up with something new and exciting, and has largely succeeded. The rst book contains all the problems of the Austrian-Polish Mathematics Competition since its inception in 1978, up to 1993. It is one of the world's oldest regional mathematics competitions, attesting to the close friendship of the mathematical communities in these two nations. Apart from six problems given over two days in the IMO format, there is a team competition in which the six members collaborate to solve three problems in three hours. These students are usually those ranked immediately below the IMO team members. While the APMC may be considered a consolation for a graduating high school student, it is a wonderful experience and excellent preparation for those who have further aspirations in making the IMO team in future years. The second book is somewhat of an anomaly in publishing, in that it contains only the problems of one competition in one year. There are 24 problems in all, consisting of 12 from the First Round of the 1989 90 Polish Mathematics Olympiad, and 6 from each of the Second and the Third Rounds. Discounts are o ered for orders of multiple copies. Contact the publishers for details.

405 The Introduction in each of these two books provides valuable information about the respective competitions, but of course the main value lies in the problems. We give below a sample from each book. Both should be on the shelf of anyone serious about mathematics competitions. Problem 5, Austrian-Polish Mathematics Competition, 1985. We are given a certain number of identical sets of weights; each set consists of four di erent weights expressed by natural numbers of weight units. Using these weights we are able to weigh out every integer mass up to 1985 inclusive. How many ways are there to compose such a set of weights given that the joint mass of all weights is the least possible? Problem 21, Third Round, Polish Mathematical Olympiad, 1989 90. The edges of a cube are numbered 1 through 12. a Show that for every such numbering, there exist at least eight triples of integers i;j; k, with 1 i j k 12, such that the edges labelled i, j and k are consecutive sides of a polygonal line. b Give an example of a numbering for which a ninth triple with these properties does not exist.

406

K.R.S. Sastry

18 = 9; 2 = 1. For example, 9 is a unitary divisor of 18 because 9; 9 , But, 3 is not a unitary divisor of 18 because 3; = 3; 6 = 3 6= 1. This

A positive integral divisor d of a natural number n is called unitary dia n are relatively prime; that is d; n = 1. visor of n if and only if d and

novel de nition of divisibility produces interesting analogues and contrasts with the results of ordinary divisibility. See 2, 3, 4 . In this paper we consider the solutions of two more new unitary divisor problems. BACKGROUND MATERIAL: Let n = p p pk k denote the prime decomposition of n. Let d n denote the number of unitary divisors of n. Then, see 2, 3, 4 , we have 1 = 1; d n = 2k for n 1: 1 The Euler function counts the number n of natural numbers that are less than and relatively prime to n. Then, see 1 , we have

1 1 2 2

18 3

1 = 1; n =

k Y i=1

1

2

The rst problem asks us to determine the positive integers n for which d n = n. The second asks us to establish a curious result concerning the number of unitary divisors of each unitary divisor of n. THE FIRST PROBLEM: Determine the set S = fn : d n = ng.

1 1 1 1 2 2 2 1 1

Solution: In view of equations 1 and 2, we have to solve the equation p , 1 p , p , 1 p , pk , 1 pk k , = 2k : 3 The right hand side of equation 3 is a power of 2, so each factor on its left hand side is to be necessarily a power of 2. Two cases arise because of the even prime 2. I p = 2 and pi are distinct odd primes for 2 i k. Then , 1 = , 1 = = k , 1 = 0 and p , 1 = 2 ; p , 1 = 2 ; ; pk , 1 = 2 k . Thus pi = 2 i + 1 are distinct odd primes for 2 i k: 4 II pi are all odd primes for 1 i k. Then as in the preceding, i = 1 and pi = 2 i + 1 are distinct odd primes for 1 i k: 5

1 2 3 2 2 3 3

407 First we note the obvious solution n = 1 that follows from d 1 = 1 and 1 = 1. B k = 1. This implies that n is formed from a single prime. I k = 1, p = 2. So n = 2 . This yields 2 , = 2 ; = 2. Hence n = 2 = 4. It is easily veri ed that d 4 = 4 = 2. II k = 1, p an odd prime. This yields p , 1 = 2 ; p = 3. Hence n = 3. Again d3 = 3 = 2. C k = 2. This implies that n is formed from powers of two distinct primes p ;p . I k = 2, p = 2 and p an odd prime. Hence n = 2 p . This yields 2 , 2 = 2 , , 1 + = 2. This equation has two solutions: , C = 1; = 2 = n = 2 2 + 1 = 10; , C = 2; = 1 = n = 2 2 + 1 = 12: II k = 2, p , p are both odd primes. Hence n = p p , 2 2 = 2 , + = 2. Now p and p are distinct odd primes so + = 2 are A

2 1 1 1 1 1 1 1 1 1 1 1 2 1 1 2 1 2 2 1 2 1 2 1 1 2 1 2 2 1 2 1 2 1 2 1 2 1 2 2

distinct natural numbers. Hence + 2 and there is no solution in this case. D k = 3. In this case, n is the product of powers of three distinct primes. I k = 3, p = 2, and p , p are distinct odd primes. Hence n = 2 p p , 2 , 2 2 = 2 , , 1 + + = 3. Since is at least 1 and only one of and can equal 1, we have the single solution = 1, = 1, = 2. This gives n = 2 ,2 + 1 ,2 + 1 = 30. II k = 3, p , p , p are distinct odd primes. This leads to the equation + + = 3 that has no solution in natural numbers, as explained above. E k 3, n = p p pk k . I k 3, p = 2 yields , 1 + + + + k = k, which has no solution for the reason explained above in D. II k 3 yields + + + k = k, and this equation too does not have a solution. Combining A, , E we have determined S = f1; 3; 4; 10; 12; 30g. The veri cation that if n 2 S then d n = n is left to the reader. THE SECOND PROBLEM: The fascinating property of the natural numbers that 1 + 2 + + n = 1 + 2 + + n motivates us to look for a collection of integers with the similar property. For instance the collection of the integers 1, 2, 2, 2, 4, 4, 4, 8 exhibit that property:

1 2 1 2 3 1 1 1 2 3 2 3 3 1 2 3 1 2 3 1 2 3 1 1 2 1 2 3 1 2 3 1 1 2 2 1 1 2 3 1 2 3 3 3 2

1 + 2 + 2 + 2 + 4 + 4 + 4 + 8 = 1 + 2 + 2 + 2 + 4 + 4 + 4 + 8 :

3 3 3 3 3 3 3 3 2

408 How to generate collections of such integers exhibiting the above property? Here is an algorithm: A Start with any integer n. Say n = 30. A Write down the unitary divisors of n. The unitary divisors of 30 are 1, 2, 3, 5, 6, 10, 15, 30. A Now write down the number of unitary divisors of each unitary divisor of n. In view of 1 each of these integers will be a power of 2. In the present case we have respectively

1 2 3

Lo and behold! We have generated a collection of integers having the mentioned property. Intrigued? Try this on n = 24 or n = 420 or any other value. In general we have the following result: Let a , a , , a denote the unitary divisors of an integer n. Let d ai denote the number of unitary divisors of ai. Then

1 2

1; 2; 2; 2; 4; 4; 4; 8:

X

Proof: Let n = p p pk k denote the prime decomposition of n. Then its 2k = unitary divisors are:

1 1 2 2

i=1

dai 3 =

"

X

i=1

dai

2

a ; a ; ; a = 1; p ; p ; ; pk k ; k, p p ; p p ; ; pk, pk k ;

1 1 1 1 1 2

. . .

2 2

1 1

Observe that the unitary divisors have been put together, for convenience, in collections containing

,

p p pk k :

1 1 2 2

terms respectively. Here k = k k, k,r denotes the binomial coe r r cient for 0 r k. We now use 1 to write down d ai for 1 i 2k :

1 ! +1

k ; k ; k ; ; k
0 1 2 k

2 2 2 3 3

Observe that these collections contain, respectively,, k term equalling 1: ,k , terms equalling 2; k terms equalling 2 ; ; k term equalling 2k . k Hence
X ai = 1 + 2 + 2 + k terms

1 2 2 0 3 3 3 3

1; 2; 2; ; 2; 2 ; 2 ; ; 2 ; 2 ; 2 ; ; 2 ; ; 2k:

3

,

k terms + + 2 k : + 2 + 2 + 2

6 6 3

,

1+2

k

= 9k = 3 k:

2

Also

X

ai = 1 + 2 + 2 +

2 2

It is easy to see that the assertion follows. Finally we invite the reader to state and prove an analogous result for the ordinary positive integral divisors of positive integers n. For other problems on cubes of natural numbers see 5, 6 . References 1 L.E. Dickson, History of the Theory of Numbers, Vol. I, Chelsea Publications, 1971, pp. 113 114. 2 R.T. Hanson and L.G. Swanson, Unitary Divisors, Mathematics Magazine, 52 September 1979, pp. 217 222. 3 K.R.S. Sastry, Unitary Divisor Problems, Crux Mathematicorum, 22 February 1996, pp. 4 9. 4 K.R.S. Sastry, Unitary Divisor Analogues, Mathematics and Computer Education, 30 Fall 1996, pp. 300 311. 5 K.R.S. Sastry, Fermat-Pell: An Observation and an Application, Mathematics and Computer Education, 28 Winter 1994, pp. 24 35. 6 K.R.S. Sastry, Cubes of Natural Numbers in Arithmetic Progression, Crux Mathematicorum, 18, 1992, pp. 161 164. K.R.S. Sastry Jeevan Sandhya Doddakalsandra Post Raghuvanahalli Bangalore 560 062, India

410

No. 25 R.E. Woodrow

This number we give the problems of the 1997 Alberta High School Mathematics Prize Exam, second round, written last February by students invited on the basis of the rst round results from November. My thanks go to Ted Lewis, Chair of the Alberta High School Mathematics Prize Exam Board for forwarding the contest, which is partially supported by the Canadian Mathematical Society.

Second Round 1. Find all real numbers x satisfying jx , 7j jx + 2j + jx , 2j. Remark. Note that jaj is called the absolute value of the real number a. It has the same numerical value as a but is never negative. For example, j3:5j = 3:5, while j , 2j = 2. Of course, j0j = 0. 2. Two lines b and c form a 60 angle at the point A, and B is a point on b. From B , draw a line perpendicular to the line b meeting the line c at the point C . From C draw a line perpendicular to c meeting the line b at B . Continue in this way obtaining points C , B , C , and so on. These points are the vertices of right triangles AB C ; AB C ; AB C ; : : : . If area AB C = 1, nd

1 1 1 1 2 2 3 3 1 1 2 2 3 3 1 1

3. A and B are two points on the diameter MN of a semicircle. C , D, E and F are points on the semicircle such that CAM = EAN = DBM = FBN . Prove that CE = DF . 4. a Suppose that p is an odd prime number and a and b are positive integers such that p divides a + b and p also divides aa + b . Prove that p also divides aa + b. b Suppose that p is an odd prime number and a and b are positive integers such that p divides a + b and p also divides aa + b . Show by an example that p does not necessarily divide aa + b.

4 2 2 4 2 4 5 2 2 5 2 5

5. The picture shows seven houses represented by the dots, connected by six roads represented by the lines. Each road is exactly 1 kilometre long. You live in the house marked B . For each positive integer n, how many

411 ways are there for you to run n kilometres if you start at B and you never run along only part of a road and turn around between houses? You have to use the roads, but you may use any road more than once, and you do not have to nish at B . For example, if n = 4, then three of the possibilities are: B to C to F to G to F ; B to A to B to C to B; and B to C to B to A to B.

D A

s

B

s

C

s

Next we give the solutions to the 1995 Concours Math matique du e Qu bec which comes to us from Th r se Ouellet, secretary to the contest. e ee We give the solutions in French, the language of the competition.

February 2, 1995

Time: 3 hours 1. LA FRACTION A SIMPLIFIER Simpli ez la fraction Solution.

1 358 024 701 = 11 123 456 791 = 11 : 1 851 851 865 15 123 456 791 15

2. LA FORMULE MYSTERE

xy = p; x + y = s; x + y = t; x + y = u: En faisant appel aux lettres p, s, t, u mais pas aux lettres x, y , donnez une

1993 1993 1994 1994

1995

+y

1995

1995 1995 1995

su = x + yx + y = x + xy + x y + y = x + y + xy x + y = x + y + pt:

1994 1994 1994 1994 1995 1995 1993

1995 1993

Lorsque la circonf rence d'un cercle est divis e en dix parties egales, e e les cordes qui joignent les points de division successifs forment un d cagone e r gulier convexe. En joignant chaque point de division au troisi me suivant, e e on obtient un d cagone r gulier etoil . Montrer que la di erence entre les e e e c^ t s de ces d cagones est egale au rayon du cercle. oe e Solution. On consid re le cercle divis en dix parties egales. On joint les e e points CD et DE , par des segments egaux aux c^ t s du d cagone convexe, oe e les points BE et CF , par des segments egaux aux c^ t s du d cagone etoil , oe e e et les diam tres AF et BG. Alors CD k BE k AF et DE k CF k BG. En e vertu des propri t s des parall logrammes, on a ee e

3. LA DIFFERENCE ETONNANTE

1995

+y

1995

= su , pt:

BE , CD = BE , HE = BH = OF = r: D E

s s

C B

s

H r O

F

s

Abel Belgrillet est membre du Club des a rocervidophiles amateurs de e cerfs-volants du Qu bec. Il dispose de quatre tron ons de cl^ ture rectilignes e c o AB, BC , CD, DA pour d limiter un terrain en forme de cerf-volant, voir e gure sur lequel il s'adonnera a son activit favorite cet et . Sachant que les e e

413 tron ons AB et DA mesurent 50 m chacun et que les tron ons BC et CD c c mesurent 120 m chacun, d
terminez la distance entre les points A et C qui e maximisera l'aire du terrain. Solution. D
coupons le terrain selon AC : e D D l'aire de A

50 50 120 120

= l'aire de A

50 120

120 50

Mais, l'aire d'un parall logramme de c^ t s donn s est maximale lorsque e oe e ce parall logramme est un rectangle car dans ce cas, la hauteur sera maxie b male. On doit donc avoir que l'angle B = 90 . Le triangle ABC est donc rectangle en B . Ainsi

q

2 2 2 2

a 2 points L'in
galit
x + 2y 3xy est-elle vraie pour tous les e e entiers? b 8 points Montrez que l'in
galit
x + 2y xy est valide pour e e tous r
els x et y . e Solution. a Non. Voici quelques couples qui fournissent un contreexemple:

2 2 14 5

x y

3 4 5 5 6 2 3 3 4 4

b 1ere solution. Consid
rons l'in
galit
x , y 0, qui est vraie e e e pour tout couple de r
els x, y . Elle est equivalente a x + y 2 xy . e
p2, on trouve x +2y 2p2 xy = 2; 828 : : : xy xy. En posant = p On peut aussi montrer que 2 2 en elevant au carr
de chaque c^ t
.
e oe i me solution. Montrer que x + 2y xy revient a d
montrer e 2 e l'in
galit
5x + 10y , 14xy 0. Or, e e

2 2 2 2 2 2 14 5 14 5 2 2 2 2 14 5

2 2 2 2 2 2 2

414 la derni re in galit r sultant du fait qu'une somme de carr s est toujours e e e e e sup rieure ou egale a z ro. e e 6. L'ECHIQUIER COQUET Trouvez l'unique fa on de colorier les 36 cases d'un echiquier 6 6 en c noir et blanc de sorte que chacune des cases soit voisine d'un nombre impair de cases noires. Note: deux cases sont voisine si elles se touchent par un c^ te-ou par o un coin. On ne demande pas de d montrer que la solution est unique. e Solution. Ayant une solution, chacune des quatre symm tries possie bles les deux diagonales, la verticale et l'horizontale engendre une nouvelle solution. Or, puisque la solution est unique, elle doit n cessairement e etre sym trique selon ces quatre axes de sym tries. Il s'ensuit que les cases ^ e e num rot es 1 ci-dessous sont toutes de la m^ me couleur. De m^ me pour les e e e e cases num rot es 2, num rot es 3; : : : ; num rot es 6. e e e e e e

Pour que les cases 1 touchent a un nombre impair de cases noires, les cases 4 doivent n cessairement etre noires, puisque chacune d'elles est voie ^ sine de deux cases 2 et d'une case 4. De plus, les cases 4 etant voisines d'une case 1, d'une case 6, et de deux cases 2, 3 et 5, il est clair que les cases 1 et 6 doivent etre de couleurs di erentes. De plus, les cases 4 etant noires, ^ les cases 6 sont n cessairement blanches, puisqu'elles sont voisines chacune e d'une case 4, de deux cases 5 et de trois cases 6. Les cases 1 sont donc noires, puisque nous avons d j etabli qu'elles sont de couleurs di erentes que les ea cases 6. En consid rant maintenant les cases 3, et ce qu'on sait d j , on e ea conclut que les cases 2 et 3 doivent etre de m^ me couleur. Maintenant, en ^ e consid rant les cases 2, sachant que 1 et 4 sont noires et que 2 et 3 sont de e m^ me couleur, on d duit que 5 doit etre noir. En consid rant la position 5, e e ^ e maintenant, on conclut nalement que les cases en 2 et en 3 sont blanches, ce qui nous donne nalement:

1 2 3 2 1

2 4 5 4 2

3 5 6 5 3

3 5 6 5 3

2 4 5 4 2

1 2 3 2 1

415

ii Supposons que = 0:d d d : : : . Alors t est egal a la partie enti re de t . Donc d = t.
e

1 3 1 2 3 +1 3 3 1

En base 10, = 0:333 : : : . Ecrivons 0: pour ces d
cimales r
p
t
es. 3 e e ee Comment ecrit-on dans une base b, ou b est de la forme
i b = 3t trois points, ii b = 3t + 1 trois points, iii b = 3t + 2 quatre points, ou t est un entier positif quelconque? Solution. i Notons = tt , d'ou = 0:t en base 3t.

1 3 1 3 1 3 3 1 3 3 +1 3

= d :d d : : : et d

1 2 3

Soustrait d = t de t . On obtient

1 3 +1 3

3t + 1 , t = 3t + 1 , 3t = 1 = 0:d d : : : : 3 3 3 3

2 3

2 3 1 3

3 +2 2 1 3 1 2 3 1

3 +2 3

= d :d d : : : :

1 2 3

3t + 2 , 3t = 2 = 0:d d : : : : 3 3 3

2 3

On multiplie encore par 3t + 2. On obtient d :d d : : : = t = t , dont la partie enti re est 2t +1. Donc d = 2t +1. On soustrait d = 2t +1 e et on obtient

2 3 4 23 +2 3 2 6 +4 3 2

3 4

1 3 5 2 4 6

416 V ri cation e

2 2 4 2 2

2 2 2 2 2 2

1 3 +22

That completes the Skoliad Corner for this issue. Please send me suitable contest materials at this level, as well as your comments and suggestions for future columns.

417

MATHEMATICAL MAYHEM

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, Yale University, PO Box 208283 Yale Station, New Haven, CT 06520 8283 USA. The electronic address is still mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

Factorial Fanaticism

If you've seen one too many math contests, then the following factorial problem will be old hat: How many factors of 2 are there in 100!?" For those who don't recognize !" as a mathematical symbol, here is its meaning: n! is the product of all the integers from n down to 1, or

So how many factors of 2 are there in 100!? Well, there are = 50 even numbers giving 50 factors of 2. But every multiple of 4 gives = 25 of them. Continuing, each an additional factor of 2. There are multiple of 8 gives another factor of 2, and there are b c = 12 of them, and so on for multiples of 16, 32, and 64. This is enough, as the next power of 2, that is 128, is greater than 100, so there are no multiples of it which are less than 100. The total number of factors of 2 is then 50 + 25 + 12 + 6 + 3 + 1 = 97:

100 2 100 4 100 8

Ed.: Coincidence? Now try and nd how many factors of 5 there are 100!. Find a general formula for nding the number of primes p in n! for given integers p and n. A similar problem to the one above is to calculate the number of consecutive zeros at the end of 100!. It is equal to the number of factors of 5

418 in 100! Why?. Once you have braved this question, you can easily gure out a method for nding the number of factors of m in n! for given integers m and n. In fact, it has been shown and is an excellent exercise for the reader to show that the number of factors of a prime number p in n! is

1 1 2 2 1

A natural question to ask, after knowing all the zeros at the end of n!, is What is the last non-zero digit in n!?" One way, perhaps not the most elegant, is to write n! in the form p p pr r , where the pi are all the distinct primes dividing n. The , : : : , r , are calculated by the method above. Since we don't care about the trailing zeros, say k of them, remove a factor of 10k and then take the quotient modulo 10. For those who are not familiar with modular arithmetic, all this does is nd the units digits. For example, 6! = 720 = 2 3 5. Removing a factor of 10 to get rid of the trailing zeros gives 72 = 2 3 . Then 2 3 is congruent to 2 modulo 10, that is, the units digit is 2. Thus, the last non-zero digit of 6! is 2. Now for some more interesting questions. 1. How many digits does n! have? 2. What is the initial digit of n!, or more generally its rth digit? 3. How many digits are zeros in n!? How many are 1's? Likewise for the other digits.

4 2 3 2 3 2

419

Most senior high school students are familiar with the general solution to the quadratic equation ax + bx + c = 0. Either it is derived or given as a mere fact in class, and the notorious solution is

2

p x = ,b 2b , 4ac : a

2

It is rarely the case, however, that the solution to the general cubic equation ax + bx + cx + d = 0 is ever derived much less even mentioned. Here we do not tread this path, but refer the reader to 1 and 2 for its treatment. Instead, we go one step further and give the process of solving the general quartic fourth degree equation ax + bx + cx + dx + e = 0. Readers are encouraged to read 1 and 2 to learn or refresh their memories on solving the cubic equation. This is because we wish to reduce the quartic equation into that of a cubic equation. The process we give here is a variant of the solution credited to Lodovico Ferrari 3 . Motivations Readers who are familiar with solving cubic equations know that the rst step is to reduce the general cubic into the depressed cubic equation x + px + q = 0. This may be of some value in the quartic case as well. Also, if the quartic equation could be written as a di erence of squares, that is x + p , qx + r = 0, then solving the original quartic becomes an exercise in solving two quadratic equations | namely, solving x + p + qx + r = 0 and x + p , qx , r = 0: To this end, we try to convert the general quartic equation into this form somehow. Supposing we have reduced ax + bx + cx + dx + e = 0 into the form x + ux + vx + w = 0. How do we do this? See the method below. Then we compare coe cients in

3 2 4 3 2 3 2 2 2 2 2 4 3 2 4 2

x + ux + vx + w = x + p , qx + r = x + 2p , q x + ,2qrx + p , r to solve for p, q , and r in terms of the known u, v , and w. How is this done?

4 2 2 2 2 4 2 2 2 2 4 3 2

See the method below. Voil ! The solution falls apart. a Method for Solving the General Quartic Equation Step 1: Reduce ax + bx + cx + dx + e = 0 to the form x + ux + vx + w = 0. To do this, simply divide through by a. We must have a 6= 0; else the equation would no longer be a quartic. Next, make the substitution x = t , ba to get t + ut + vt + w = 0.

4 2 4 4 2

420 Step 2: Convert the reduced quartic from Step 1 to a di erence of squares as described above. To do this, we need to solve for p, q , and r in terms of the known u, v , and w. By comparing coe cients, we have three equations in three unknowns:

equation in p, which can be solved. Step 3: Take the di erence of squares found in Step 2 and solve for the two quadratic equations to get the four solutions of the quartic equation t + ut + vt + w = 0. Remember,bthese are not the desired solutions. Make the substitution x = t , a for each of the four solutions to get the four solutions of the original quartic equation. Why didn't we multiply by a? Afterword This seems quite tedious, and is thus one reason why it is not taught in classrooms. However, note how simple solving the quartic is if a black-box was given to automatically solve a cubic. The quartic is solved by using this black-box once and solving an additional two quadratic equations. The best way to learn a technique is to use it. Here is a problem where the reader is encouraged to apply the above algorithm. Although there are more elegant ways to solve this, by using Ferrari's method the reader will gain a greater understanding of solving polynomial equations. Solve the equation

4 2 4

2 2 2 2 2 2 2

1992 CMO Problem 4 We end with a note that polynomial equations of degree ve or higher cannot be solved, so readers can be relieved that there are not longer processes which reduce polynomials one degree at a time to reach a solution. References 1 Hlousek, Daniela and Lew Dion, Cardano's Little Problem", Mathematical Mayhem, Volume 6, Issue 3, March April 1994, pp. 15-18. 2 Dunham, William, Journey Through Genius, Penguin Books, New York, 1990, pp. 142-149. 3 Dunham, William, Journey Through Genius, Penguin Books, New York, 1990, p. 151.

x x + x + 1 = 3:

2 2 2

421

Shawn Godin

The following is an excerpt from a television commercial for a certain unnamed pizza chain:

Customer: So what's this new deal? Pizza Chef: Two pizzas. Customer: Towards four-year-old Math Whiz Two pizzas. Write that down. Pizza Chef: And on the two pizzas choose any toppings - up to ve from the

list of 11 toppings . Older Boy: Do you... Pizza Chef: ...have to pick the same toppings on each pizza? No! Math Whiz: Then the possibilities are endless. Customer: What do you mean? Five plus ve are ten. Math Whiz: Actually, there are 1 048 576 possibilities. Customer: Ten was a ballpark gure. Old Man: You got that right. At this point, the camera fades to a picture of hot pizzas; the announcer's voice and a very small Roman who says Pizza! Pizza!"

This simple advertisement caused an uproar in the mathematics community 1 , 2 , 3 , 4 , 5 . The question is, should a four year old be trusted with higher mathematics? To answer the question, we should rst do a little analysis. Before jumping into the problem, let us state some assumptions: i Each pizza may have up to ve toppings on it given. ii Both pizzas do not have to have the same toppings given. iii A pizza may have no toppings although a boring choice, it seems reasonable since most pizza places include a price for sauce and cheese" as the basic no item" pizza. iv The order that the items are put on the pizza does not matter. So a pizza with ham and bacon is the same as a pizza with bacon and ham it seems obvious, but this decision will a ect our solution. v The order that you order the pizzas, or the order that they are put in the box, or handed to you, does not matter. That is, ordering a pizza with ham and a second pizza with mushrooms is the same as ordering a pizza with mushrooms and another with ham again, it seems obvious, but this decision will a ect our solution.

422 vi Double items are not allowed although it is allowed in most pizza places, we will consider this simpler problem rst then extend it. Now o to the solution. First, we will look at the number of ways that one pizza can be made. Our pizza may have zero, one, two, three, four, or ve toppings, so the total number of pizzas available to us is:

11 + 11 + + 11 = 1024: 5 4 0

Thus, if we are to choose two pizzas we have two possibilities: Case 1: Both pizzas are the same. In this case, there are 1024 ways to pick the rst pizza and, having picked the rst one, we are locked in for our second one it must be the same as the rst so there are 1024 ways to pick two pizzas if they must be the same. Case 2: Both pizzas are di erent. In this case, there are 1024 pizzas to choose from and I want to pick two, so the number of ways to do this is:

which does not agree with the four year old. Now, as luck would have it, if we disregard our assumption v, the number of ways to create pizzas in Case 2 is P 1024; 2 = 1 047 552, giving a total of 1024 + 1 047 552 = 1 048 576, which is the four year old's claim. It would seem that the child regards the order that the pizzas are ordered in as important. Indeed, Jean Sherrod of Little Caesars Enterprises explained in a letter to Mathematics Teacher 3 that that is indeed what they assumed. If they are assuming this, that is disregarding our assumption v, would not it also make sense to regard the order that the toppings were asked for as important? How many pizzas would be possible if we rewrote assumption iv so that order was important? Let us pursue the truth even further. As is well known to pizza connoisseurs, and as is admitted by Sherrod 3 , a pizza may have a multiple selection of an item. Double pepperoni would count as two choices, both of the same topping. Weber and Weber 4 consider the multiple topping question with an interesting technique. Suppose our 11 toppings are as follows: pepperoni P, bacon B, sausage S, ham H, anchovies A, mushrooms M, green peppers GP, tomatoes T, green olives GO, black olives BO, and hot peppers HP. When you order a pizza, the order is processed on an order form that lists all

423 possible toppings separated by vertical lines. The order form may look like this: P j B j S j H j A j M j GP j T j GO j BO j HP and the person taking the order just marks an X over the symbol for each topping you order. If you wanted double pepperoni, two X's would be placed in the P slot, counting as two toppings. If we allow multiple toppings, we can calculate the total number of pizzas possible by considering the total number of ways that the order form can be lled out. For example, if you ordered your own favourite pizza, the Cardiac Conspiracy", which has double bacon, double pepperoni, and ham, the order form if we just look at the lines and X's would look like this: XX j XX j j X j j j j j j j Similarly, if you ordered a Trip To The Sea" pizza quintuple anchovies, the order form would look like this: j j j j XXXXX j j j j j j Thus, each 5 item pizza will be represented by an arrangement of 5 X's and 10 lines. The number of ways to arrange these 15 symbols is: This is in fact the binomial coe cient C 15; 5, or C 15; 10. This result makes more sense if we think of the problem as picking 5 of the 15 positions to mark with an X or alternately, pick 10 of the 15 spaces to mark with a line. To account for all possible pizza choices, we need to consider pizzas with zero, one, two, three, four, or ve toppings. If we do this we get:

15! 14! 10! 10!5! + 14!4! + + 10!0! = 4368: So, the number of choices for two pizzas is then C 4368; 2 + 4368 = 9 541 896. So now we have a lot of numbers to deal with. In our rst calculation, we saw that there are 1024 possible pizzas allowing no multiple toppings. In our latest calculation, we saw that there are a total of 4368 pizzas if multiple toppings are allowed. Thus, since the original 1024 has been accounted for in the 4368, it would seem that 4368 , 1024 = 3344 pizzas have multiple toppings. Our next problem to consider is to classify these 3344 pizzas.

Consider the case where a double topping is allowed and is used. Then a ve item pizza could be made up of a double item and three singles, or two double items and a single. The method of Weber and Weber for enumerating pizza choices here becomes too cumbersome to work with. For example, if I marked a double item with a D and a single with an X, then arranging 10

424 lines, a D and 3 X's to get our rst case does not take into account X's beside the D more than a double or even two or three X's together which means we recount later cases. So to solve the problem, we will have to go back to the fundamental counting theorem. First, we will consider the pizza made up of a double item and three singles. Our rst task is to select the item that will be double. This can be done in C 11; 1 = 11 ways. Next, pick the three singles from the other remaining toppings. This can be done in C 10; 3 = 120 ways. So the total number of pizzas with a double item and three singles is C 11; 1C 10; 3 = 1320. Continuing in this manner, we can account for all pizzas with at least one double topping and no topping is allowed more than twice can you identify each term with the case it represents?:

possible single pizzas. At this point, the reader should have enough ammunition to attack the remaining problem. The following questions are still unanswered. 1. How many pizzas are possible if triple quadruple, quintuple toppings are allowed? pick your cases carefully! 2. How many choices of two pizzas do you have if you are allowed to pick an item at most twice three, four, ve times? 3. Using local pizza company choices, how many pizzas or pairs of pizzas are possible from each pizza place? 4. Who in town makes the best pizza? Have fun trying to solve these and other problems of your creation. Mathematics is a demanding endeavour, so if you feel hungry you may want to pick up the phone... References 1. N. Kildonan, problem 1946, Crux Mathematicorum, 20:5 1994 137. 2. M. Woltermann, Pizza Pizza", Mathematics Teacher, 87:6 1994 389. 3. J. Sherrod, Little Caesars Responds", Mathematics Teacher, 87:6 1994 474. 4. G. Weber and G. Weber, Pizza Combinatorics", The College Mathematics Journal, 26:2 1995 141-143. 5. S. Godin, Solution to problem 1946, Crux Mathematicorum, 21:4 1995 137-139.

11 10 + 11 9 + 11 10 + 11 + 11 10 + 11 = 2486: 1 3 2 1 1 2 2 1 1 1 Now we have accounted for 1024 + 2486 = 3510 of the total 4368

425

Nicholae Gusita

Problem 1. Find the minimum and maximum values of

1

y = sin x + cos x;

1

p y = sin x + sin90 , x = 2 sin45 cos x , 45 = 2 cos x , 45 : p Then the minimum of , 2 occurs when x , 45 = 180 , so that x = 225 , and the maximum of p2 occurs when x , 45 = 0, so that x = 45 .

Problem 2. Find the minimum and maximum values of

2

y = 3 sin x + 4 cos x;

2 1

,4

3

, then

But so that

cos

1 = 1 + tan

9 = 25 ;

cos = 3 ; 5 since 0 90 . Then y = 5 sin x + . It is clear now that the minimum of ,5 occurs when x + = 270 , so that x = 270 , , and the maximum of 5 occurs when x + = 90 , so that x = 90 , .

2

3

y = a sin x + b cos x; for 0 x 360 , a, b 2 Rnf0g. ,b Solution. Let = tan, a , ,90 90 . Assume a 0. Then sin cos x
= a sin x + : y = a sin x + tan cos x = a sin x +

1 3

cos

cos

cos

so that

1 = 1 + tan

=a a b ; +

2 2 2 2 2

cos = p a : a +b pa + b sinx + . Therefore, y = p b The minimum of , a + p occurs when x + = 270 , so that x = 270 , , and the maximum of a + b occurs when x + = 90 , so that x = 90 , . If a 0, then using similar reasoning, we nd the minimum occurs when x = 90 , , and maximum when x = 270 , . Problem 4. Given two positive angles a and b whose sum is 150 , prove p that the maximum value of sin a + cos b is 3.

3 2 2 2 2 2 2

y = sin a cos b = sin a + 90 , b
+ sin
= 2 sin a , b + 45 cos a + b , 45 2 p2 sina , 30 : = 2 sin a , 30 cos 30 = 3 p The maximum of 3 occurs when a , 30 = 90 , so that a = 120 , b = 30 .

4

Solution. We have

5 2 2

y = a sin x + b sin x cos x + c cos x; 0 x 360 , a, b, c 2 R. Solution. Since sin x = 1 , cos 2x, cos x = 1 + cos 2x, and sin x cos x = sin2x, b c y = a 1 , cos 2x + 2 sin2x + 2 1 + cos 2x 2 a + c + 1 b sin2x + c , a cos 2x : =

2 1 2 1 2 2 1 2 5

a + c , b + a , c

2

respectively.

and

a + c + b + a , c

2

427

1. Sand is being poured on the ground forming a pile in the shape of a cone whose altitude is of the radius of its base. The sand is falling at the rate of 20 L s. How fast is the altitude of the pile increasing when it is 42 cm high? 2. Solve:

2 3

tan,1

1 1

3. A cylinder is inscribed in a cone, the altitude of the cylinder being equal to the radius of the base of the cone. Find the measure of angle , if the ratio of the total surface area of the cylinder to the area of the base of the cone is 3 : 2.

6

R

-?

2x

y 3x

= 6y = 3 2y

+1

6. A xed circle of radius 3 has its centre at 3; 0. A second circle has its centre at the origin, its radius is approaching zero. A line joins the point of intersection of the second circle and the y -axis to the intersection of the two circles. Find the limit of the point of intersection of this line with the x-axis.

428

Mayhem Problems

The Mayhem Problems editors are: Richard Hoshino Mayhem High School Problems Editor, Cyrus Hsia Mayhem Advanced Problems Editor, Ravi Vakil Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only problems | the next issue will feature only solutions. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions from this issue be submitted by 1 December 1997, for publication in the issue 5 months ahead; that is, issue 4 of 1998. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions from others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

Editor: Richard Hoshino, 17 Norman Ross Drive, Markham, Ontario, Canada. L3S 3E8 rhoshino@undergrad.math.uwaterloo.ca H229. Here's a simple way to remember how many books there are in the Bible. Remember that there are x books in the Old Testament, where x is a two-digit integer. Then multiply the digits of x to get a new integer y, which is the number of books in the New Testament. Adding x and y , you end up with 66, the number of books in the Bible. What are x and y ? H230. Dick and Cy stand on opposite corners on the squares of a 4 by 4 chessboard. Dick is telling too many bad jokes, so Cy decides to chase after him. They take turns moving one square at a time, either vertically or horizontally on the board. To catch Dick, Cy must land on the square Dick is on. Prove that: i If Dick moves rst, Cy can eventually catch Dick. ii If Cy moves rst, Cy can never catch Dick. Can you generalize this to a 2m 2n chessboard? H231. Let O be the centre of the unit square ABCD. Pick any point P inside the square other than O. The circumcircle of PAB meets the circumcircle of PCD at points P and Q. The circumcircle of PAD meets the circumcircle of PBC at points P and R. Show that QR = 2 OP .

429

H232. Lucy and Anna play a game where they try to form a ten-digit number. Lucy begins by writing any digit other than zero in the rst place, then Anna selects a di erent digit and writes it down in the second place, and they take turns, adding one digit at a time to the number. In each turn, the digit selected must be di erent from all previous digits chosen, and the number formed by the rst n digits must be divisible by n. For example, 3, 2, 1 can be the rst three moves of a game, since 3 is divisible by 1, 32 is divisible by 2 and 321 is divisible by 3. If a player cannot make a legitimate move, she loses. If the game lasts ten moves, a draw is declared. i Show that the game can end up in a draw. ii Show that Lucy has a winning strategy and describe it.

Advanced Problems

Editor: Cyrus Hsia, 21 Van Allan Road, Scarborough, Ontario, Canada. M1G 1C3 hsia@math.toronto.edu A205. Find all functions f : R ! R such that f x x and f x + y f x + f y for all x, y 2 R. A206. Let n be a power of 2. Prove that from any set of 2n , 1 positive integers, one can choose a subset of n integers such that their sum is divisible by n. A207. Given triangle ABC , let A00, B00 , and C 0 be points on sides BC , CA, and AB respectively such that 40A 0B 0C 0 4ABC . Find the locus of the orthocentre of all such triangles A B C . A208. Let p be an odd prime, and let Sk be the sum of the products of the elements f1; 2; : : : ; p , 1g taken k at a time. For example, if p = 5, then S = 1 2 3 + 1 2 4 + 1 3 4 + 2 3 4 = 50. Show that p j Sk for all 2 k p , 2.

3

Editor: Ravi Vakil, Department of Mathematics, Princeton University, Fine Hall, Washington Road, Princeton, NJ 08544 1000 USA

vakil@math.princeton.edu

1

430

PROBLEMS

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 "11" or A4 sheets of paper. These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 May 1998. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

1 2

There has been an increase in the number of solutions sent in by FAX, either to the Editor-in-Chief's departmental FAX machine in St. John's, Newfoundland, or to the Canadian Mathematical Society's FAX machine in Ottawa, Ontario. While we understand the reasons for solvers wishing to use this method, we have found many problems with it. The major one is that hand-written material is frequently transmitted very badly, and at times is almost impossible to read clearly. We have therefore adopted the policy that we will no longer accept submissions sent by FAX. We will, however, continue to accept submissions sent by email or regular mail. We do encourage email. Thank you for your cooperation.

Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. Quadrilateral ABCD is cyclic with circumcircle ,0; R. Show that the nine-point Feuerbach circles of 4BCD, 4CDA, 4DAB and 4ABC have a point in common, and characterize that point.

2276.

431

n Gomez Rey, IES Luis Bu~ uel, Alcorc n on, Madrid, Spain. For n 1, de ne

where the square brackets and the parentheses denote the least common multiple and greatest common divisor respectively. For what values of n does the identity un = n , 1un, hold? 2278. Proposed by Joaqu

n Gomez Rey, IES Luis Bu~ uel, Alcorc n on, Madrid, Spain. Determine the value of an , which is the number of ordered n tuples k ; k ; : : : ; kn ; kn of non-negative integers such that

1 2 3 +1

2k + 3k + : : : + nkn + n + 1kn

2 3

+1

= n + 1:

2279. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. With the usual notation for a triangle, prove that

sin A cos B cos C = 4sr 2R , s + 2R + r : R cyclic

X

3

Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is a triangle with incentre I . Let D be the second intersection of AI with the circumcircle of 4ABC . Let X , Y be the feet of the perpendiculars from I to BD, CD respectively. Suppose that IX + IY = AD. Find BAC . 2281. Proposed by Toshio Seimiya, Kawasaki, Japan. ABC is a triangle, and D is a point on the side BC produced beyond C , such that AC = CD. Let P be the second intersection of the circumcircle of 4ACD with the circle on diameter BC . Let E be the intersection of BP with AC , and let F be the intersection of CP with AB . Prove that D, E , F , are collinear. 2282. Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. A line, `, intersects the sides BC , CA, AB , of 4ABC at D, E , F respectively such that D is the mid-point of EF . Determine the minimum value of jEF j and express its length as elements of 4ABC .

1 2

2280.

432

2283. Proposed by Waldemar Pompe, student, University of Warsaw, Poland. You are given triangle ABC with C = 60 . Suppose that E is an interior point of line segment AC such that CE BC . Suppose that D is an interior point of line segment BC such that

AE = BC , 1 : BD CE Suppose that AD and BE intersect in P , and the circumcircles of AEP and BDP intersect in P and Q. Prove that QE k BC .

Proposed by Toshio Seimiya, Kawasaki, Japan. ABCD is a rhombus with A = 60 . Suppose that E, F , are points on the sides AB , AD, respectively, and that CE , CF , meet BC at P , Q respectively. Suppose that BE + DF = EF . Prove that BP + DQ = PQ . 2285. Proposed by Richard I. Hess, Rancho Palos Verdes, California, USA. An isosceles right triangle can be 100 covered by two congruent tiles. Design a connected tile so that two of them maximally cover a nonisosceles right triangle. The two tiles must be identical in size and shape and may be turned over so that one is the mirror image of the other. They must not overlap each other or the border of the triangle. What coverage is achieved for a 30 60 90 right triangle?

2 2 2 2 2 2

2284.

Proposed by Zun Shan and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. It is well known and easy to show that the product of any four consecutive positive integers plus one, is always a perfect square. It is also easy to show that the product of any two consecutive positive integers plus one is never a perfect square. It is possible that the product of three consecutive integers plus one is a perfect square. For example: 234+1=5 and 4 5 6 + 1 = 11 : a Find the next largest natural number n such that nn + 1n + 2 + 1 is a perfect square. b? Are there any other examples?

2 2

2286.

433

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 2090. 1995: 307 Proposed by Peter Iv
ady, Budapest, Hungary. For 0 x =2 prove that

sin x

,x : +x

2 2 2 2

Essentially the same solution was sent in by Murray S. Klamkin, University of Alberta, Edmonton, Alberta; V
clav Kone n
, Ferris State Univera c y sity, Big Rapids, Michigan, USA; and Heinz-Jurgen Sei ert, Berlin, Germany. For 0 x , we have

2

1 sin x
= Y 1 , x x n n

2 2 =1

2

2

x 1,

2 2

,x : +x

2 2 2 2

Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; LUIS V. DIEULEFAIT, IMPA, Rio de Janeiro, Brazil; PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; KEE-WAI LAU, Hong Kong; DAVID E. MANES, SUNY at Oneonta, Oneonta, NY, USA; CHRIS WILDHAGEN, Rotterdam, the Netherlands; and the proposer. Two incomplete solutions were received. Most solvers proved a better inequality, and some commented that the interval could be extended to ,; . Klamkin and Manes both point out the complimentary inequality which is not as easy to prove: See American Mathematical Monthly, 76 1969, pp. 1153-1154, R. Redheffer, problem 5642. Janous gave the extension to: what is the value of that gives the best inequality of the type

1,t sin t 1 + t t

2 2

x which is valid for all x 2 0; =2? We leave this as a challenge to our other

2 2

sin x

,x +x

readers!

434 erlands.

1

2169.

AB is a xed diameter of circle , 0;R. P is an arbitrary point of its circumference. Q is the projection onto AB of P . Circle , P PQ intersects , at C and D. CD intersects PQ at E . F is the midpoint of AQ. FG ? CD, where G 2 CD. Show that: 1. EP = EQ = EG, 2. A, G and P are collinear.

Solution by Toshio Seimiya, Kawasaki, Japan. 1. Let H be the second intersection of PQ with , . Since PH ? AB , AB is the perpendicular bisector of PH , so thatPQ = QH and PAQ = HAQ. Since PC = PQ = PD, we get PHC = PDC = PCD, so that 4PHC 4PCE, from which we have

1 2 2

PH : PC = PC : PE: Thus we have PH PE = PC = PQ . As PH = 2PQ, we have 2PQ PE = PQ , so that 2PE = PQ; thus, PE = EQ. Since FG ? CD and PQ ? AB , we have GFQ = PEC . As 4PHC 4PCE we get PEC = PCH = PAH = 2 PAQ. Thus GFQ = 2 PAQ. Since F; E are midpoints of AQ; PQ, we get FE jjAP , so that PAQ = EFQ. Thus GFQ = 2 EFQ, so that GFE = EFQ. Hence we have 4GFE 4QFE , so that EG = EQ. Therefore EP = EQ = EG. 2. Since 4GFE 4QFE we have FG = FQ = AF , so that GAF = GFQ = EFQ. Thus we have AGjjFE. Since AP jjFE; A; G and P are collinear.

2 1 2

Also solved by Francisco Bellot Rosado, I.B. Emilio Ferrari, Valladolid, Spain; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; GOTTFRIED PERZ, Pestalozzigymnasium, Graz, Austria; CRISTOBAL SANCHEZ RUBIO, I.B. Penyagolosa, Castellon, Spain; and the proposer.

435

2170. 1996: 274 Proposed by Tim Cross, King Edward's School, Birmingham, England. Find, with justi cation, the positive integer which comes next in the sequence 1411; 4463; 4464; 1412; 4466; 4467; 1413; 4469; : : : . Ed.: the answer is NOT 4470. Editor's summary based on the solutions and comments submitted by the solvers whose names appear below. Most solvers felt and the editors agree that the answer could be anything, as stated in the following comment by Murray Klamkin: Any number can be the next term! A set of numbers is a sequence mathematically if and only if a rule of formation is given. The given set of numbers is not a sequence and so the problem is meaningless. Given any nite set of n numbers, one can always nd an in nite number of formulae which agree with the given n terms, and such that the n +1th term is completely arbitrary.

However, some solvers did come up with interesting formulae or reasonings to justify" the answer that they gave. Some examples: I. Diminnie Let gn = n , 3 n , and let

3

bn=3 xn = 3 1487+ 1g n c + 1 + ,1g n gn + 76 ,1g n , 1 : 2, , Then x , x , : : : , x agree with the given terms, and x = 4470. In general, if k is any number and if we de ne yn = xn + bn=9ck , 4470; then y , y , : : : , y agree with the given terms, and y = k.

1 2

II. Hurthig and the proposer Squaring each of the given terms reveals

2

and the given numbers an n = 1, 2, : : : , 8, are the least positive integers whose squares begin with the digits 1990, 1991, : : : , 1997. That is, an is the smallest positive integer k such that k begins with the same digits as 1989 + n. This leads to a = 447. III. Bradley The given numbers are the integer parts of the square roots of

9

3 4 4 4 4 3 3 4

j j

p1999 10 k, or 4471.

4 1 3

with n = 1411. Thus the next term is f n + 3 = f 1414 = 4471. Other submitted answers include 4479 Konen and 44610 Ortega c y and Guti rrez. e Solved by HAYO AHLBURG, Benidorm, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; RICHARD I. HESS, Rancho Palos Verdes, California, USA; PETER HURTHIG, Columbia College, Burnaby, BC; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; SOLEDAD ORTEGA and JAVIER GUTIERREZ, students, University of La Roija, Logro~ o, Spain; and n the proposer.

2171. 1996: 274 Proposed by Juan-Bosco Romero M
arquez, Universidad de Valladolid, Valladolid, Spain. Let P be an arbitrary point taken on an ellipse with foci F and F , and directrices d , d , respectively. Draw the straight line through P which is parallel to the major axis of the ellipse. This line intersects d and d at points M and N , respectively. Let P 0 be the point where MF intersects NF .

1 2 1 2 1 2 2 1

1 2

Does the result also hold in the case of a hyperbola? Solution by Richard I. Hess, Rancho Palos Verdes, California, USA, modi ed by the editor. I: The Ellipse: x + y = 1. a b

2 2 2 2 1 2 2

,a , a Let p ,F , F be ; 0 , , ; 0 , respectively, where b = a. Let P be a sin ; b cos and M be a;b cos . By symmetry, P 0 is on the y axis. Let P 0 be 0; ,d.

1

1, and

437

6

q q

C

q

q p

F d

Thus so that d =

2

2

q

P0

d

1

1 2

b cos . ,1

2

+ d =

2

so that giving

a + ;

2 2 2 2

2 b cos + b cos = a = b ; , 1 , 1 ,1

2 2 2 2 2 2 2

b = 2 cos , 2bcos 1 : ,

2

, b cos + a = sin =

2 2 2

or or or

b + cos ; ,1

2

2 2

2 2 2 2 2 2 2 2 2 2

2 2 2 2 2 2 2 2 2 2 2 2 2 2 2

,1 = 1 ; ,1 ,1

2 2 2

438 which is clearly true. Thus C is the centre of the cyclic quadrilateral PF P 0 F . II: The Hyperbola: x , y = 1. a b ,a , a Let p ,F , F be ; 0 , , ; 0 , respectively, where 0 1, and b = a. Let P be a sinh ; b cosh and M be a;b cosh . By symmetry, P 0 is on the y axis. Let P 0 be 0; d. Choose C to be the point 0; such that CF = CF = CP 0 .

1 2 2 2 2 2 1 2 1 2

60 P

q q

N F

q

M

q

P

q

Follow the procedure in case I to show that C is the centre of the cyclic quadrilateral PF P 0 F . Also solved by FRANCISCO BELLOT ROSADO, I.B. Emilio Ferrari, Valladolid, Spain; CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; TOSHIO SEIMIYA, Kawasaki, Japan; D.J. SMEENK, Zaltbommel, the Netherlands; and the proposer for the ellipse only. Smeenk notes that it is easy to verify that PP 0 is a normal to the ellipse. Bellot Rosado refers to E.A. Maxwell's Elementary Coordinate Geometry, Oxford University Press, 1952, which contains the two following related problems: 1. P , Q are two points on an ellipse with foci S , S 0 , such that PQ is perpendicular to SS 0 . Prove that PS , QS , PS 0 , QS 0 touch a circle, and identify its centre. 2. Tangents TP , TQ are drawn to an ellipse with foci S , S 0 . A line through S parallel to TQ meets S0 T in U , and a line through S0 parallel to TP meets ST in V . Prove that S , S 0 , U , V lie on a circle.

1 2

439

2172. 1996: 274 Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let x; y;z 0 with x + y + z = 1. For xed real numbers a and b, determine the maximum c = ca; b such that a + bxyz cyz + zx + xy . Solution by Mihai Cipu, Institute of Mathematics, Romanian Academy, Bucharest, Romania. The answer is

provided that a 0. For x = y = 1=2, z = 0 one obtains c 4a, while by substituting x = y = z = 1=3 it follows that c 3a + b=9. Thus ca; b min4a; 3a + b=9. Now to nish the proof we shall show that for all real numbers a 0 and b, for all x; y;z 0, x + y + z = 1. To this end we shall use the fact that for any such triple x; y; z there exists a Euclidean triangle whose sides have lengths 1 , x; 1 , y; 1 , z . The triangle is degenerate if xyz = 0. Let us denote by r, resp. R, the radius of the incircle, resp. circumcircle, of the associated triangle. Using well-known formulae and the hypothesis, one easily nds xyz = r and xy + yz + zx = r + 4Rr: 2 Here r and R have non-negative values subject to the restrictions 16Rr , 5r 1 and R 2r. Editor's note. The hypothesis x + y + z = 1 means that the associated triangle has semiperimeter s = 1. Thus 2 follows from the known identities X s , a s , a s , a = r s and s , a s , a = r + 4Rr

2 2 2 1 2 3 2 1 2 2

1

which hold for any triangle with sides a ; a ; a | see for example equations 15 and 16, page 54 of Mitrinovi
, Pe ari
and Volenec, Recent Advances c c c in Geometric Inequalities. And the restriction 16Rr , 5r 1 is just the known inequality 16Rr ,5r s ; see 3.6 on page 166 of Recent Advances, or item 5.8 of Bottema et al., Geometric Inequalities. We note that for x = y = 0, z = 1 one gets a 0 else there is no solution for c . Using this fact, in the case b 9a we have

1 2 3 2 2 2

min4a; 3a + b=9 = 4a

2 2

and

2

2 2 2

a1 , 3r , 12Rr a4Rr , 8r 4Rr , 8r b=9 since 4Rr , 8r = 4rR , 2r 0 , or equivalently a + br 3a + b=9r + 4Rr;

2 2 2

which is 1 again. Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; and the proposer. One incorrect solution was sent in. Most solvers noted that a solution exists only if a 0.

2173. 1996: 275, 1997: 169 Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let n 2 and x ; : : : ; xn 0 with x + : : : + xn = 1. Consider the terms

1 1

ln =

and where

2

n X k=1

1 + xk 1 , xk xk

n Y k=1

rn = Cn

1 k p1+ xxk ,

1

2

+1

I. Solution to Part 1 by Richard I. Hess, Rancho Palos Verdes, California, USA. For n = 2, we get C = 2=3 and since x + x = 1

2 1 2

r r x l = 1 + x x + 1 + x x = x + px+ 2x x ; x x x 2 1 + x
1 + x
: r = 3 px px

2 1 2 1 2 1 2 1 2 1 2 1 2 2 1 2 2 1

441 Thus

1 2 2 2 1 2 1 2 1 2 1 1 2 1 2 2 1 2 1 2 2 2 2 1 2

II. Partial solution to Part 2 by the proposer. We show that ln rn in the case n = 3 which indeed was the starting point for the whole problem. Putting x = x, x = y , x = z , the desired inequality l r reads

1 2 3 3 3

1 + x 1 , x + 1 + y 1 , y + 1 + z 1 , z x y z

r r

1 1 1 3 4 3 p1+ xxp1+ yyp1+,zz , , where x; y;z 2 0; 1 such that x + y + z = 1.

1

We now recall the di cult Crux problem 2029 of Jun-hua Huang, solved by Kee-Wai Lau on 1996: 129 : 2 where wa ; wb; wc; F are the angle bisectors and the area of a triangle. We claim that this inequality is equivalent to inequality 1. Indeed, let us apply the transformation a = y + z , b = z + x, c = x + y where x; y;z 0, converting any triangle inequality into an algebraic inequality valid for positive numbers. Then it's not di cult to see that x + y + z = s the semiperimeter of the triangle, whence x = s , a, y = s , b and z = s , c. Furthermore, due to homogeneity we may and do put s = 1, p whence F = ss , as , bs , c = pxyz. Also, by the known formula

ab , 2 p wc = 2ab cosC=2 = a2+ b ssab c = a + b ss , cab a+b for example, see 1995: 321 we get using x + y + z = 1 p 2 2 p wc = x + y + z + z zy + zz + x = 1 + z z1 , x1 , y;

X

which is equivalent to 1. Since 2 is true, so is 1. For n 4 I do not have any idea of how to settle whether the inequality ln rn is true. It may be interesting and useful to see a purely algebraic proof of inequality 1. Part 1 also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; and the proposer. The proposer did Part 2 only in the case n = 3 given above. One other reader sent in a solution to Part 2 which the editor considers to be faulty. Readers are invited to try nishing o this problem completely, or even just the special case n = 4.

2174. 1996: 275 Proposed by Theodore Chronis, student, Aristotle University of Thessaloniki, Greece. Let A be an n n matrix. Prove that if An = 0 then An = 0. Solution by John C. Tripp, Southeast Missouri State University, Cape Girardeau, Missouri. We consider A as a linear transformation on an n-dimensional vector space. We assume that An = 0. Let x be any element of the vector space. The set of vectors

+1 +1

has n + 1 elements, so it is linearly dependent. Let k be the smallest nonnegative integer such that Ak x is a linear combination of the other vectors in V . We have

2

Ak x = c Ak x + c Ak x + c Ak x + + cn,k Anx; for some scalars c ; c ; c ; : : : ; cn,k , and Anx = An,k Akx = An,k c Ak x + c Ak x + c Ak x + + cn,k An x = c An x + c An x + c An x + + cn,k A n,k = An c x + c Ax + c A x + + cn,k An,k, x = 0: Since x was arbitrary, we have An = 0.

1 +1 2 +2 3 +3 1 2 3 1 +1 2 +2 3 +3 1 +1 2 +2 3 +3 2 +1 1 2 3 2 1

Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; MIHAI CIPU, Romanian Academy, Bucharest, Romania; CON AMORE PROBLEM GROUP, Royal Danish Schoolof Educational Studies, Copenhagen, Denmark; LUZ M. DeALBA, Drake University, Des Moines, Iowa; F.J.

443 FLANIGAN, San Jose State University, San Jose, California, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; KEE-WAI LAU, Hong Kong; WALDEMAR POMPE, student, University of Warsaw, Poland; E. RAPPOS, University of Cambridge, England; HEINZ-JURGEN SEIFFERT, Berlin, Germany; SKIDMORE COLLEGE PROBLEM GROUP, Saratoga Springs, New York, USA; DIGBY SMITH, Mount Royal College, Calgary, Alberta; EDWARD T.H. WANG, Wilfrid Laurier University, Waterloo, Ontario; and the proposer. Most solvers used the Cayley-Hamilton Theorem. Wang comments that this problem is a special case of a more general and well-known result which states that if A is an n n complex matrix such that Ak = 0 for some k 1 that is, A is nilpotent, then An = 0". Indeed, some solvers proved this more general result.

2175. 1996: 275 Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. 1 The fraction 6 can be represented as a di erence in the following ways:

1 = 1 , 1; 1 = 1 , 1; 1 = 1 , 1 ; 1 = 1 , 1 : 6 2 3 6 3 6 6 4 12 6 5 30 1 = 1 , 1; 2175 x y

1 In how many ways can the fraction 2175 be expressed in the form

where x and y are positive integers? Solution by D. Kipp Johnson, Valley Catholic High School, Beaverton, Oregon, USA. Notice that so that

1 1 1 2175 = x , y

x = y 2175y = 2175 , y 2175 : + 2175 + 2175 Thus x will be an integer if and only if y + 2175 is a factor of 2175 , and x will be positive whenever y is, since then 2175 =y + 2175 2175, and y will be positive whenever y + 2175 2175, so we seek factors of 2175 which exceed 2175. But 2175 = 3 5 29 has 2 + 14+ 12+ 1 = 45

2 2 2 2

positive factors, one of which is its square root, 2175. Since the factors of 2175 come in pairs whose product is 2175 , exactly half of the other 44 factors exceed 2175, giving 22 solutions in positive integers. The smallest is x = 300;y = 348. This immediately generalizes to the solution in positive

2 2

444 integers of 1=n = 1=x , 1=y . Since n the number of divisors of n is odd for a perfect square, there will be n , 1=2 solutions to the equation 1=n = 1=x , 1=y. Also solved by HAYO AHLBURG, Benidorm, Spain; SAM BAETHGE, Nordheim, Texas, USA; THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; TIM CROSS, King Edward's School, Birmingham, England; CHARLES R. DIMINNIE, Angelo State University, San Angelo, TX, USA; KEITH EKBLAW, Walla Walla, Washington, USA; HANS ENGELHAUPT, Franz Ludwig Gymnasium, Bamberg, Germany; F.J. FLANIGAN, San Jose State University, San Jose, California, USA; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California,
USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; VACLAV
KONECNY, Ferris State University, Big Rapids, Michigan, USA; KEE-WAI LAU, Hong Kong; J.A. MCCALLUM, Medicine Hat, Alberta; ROBERT P. SEALY, Mount Allison University, Sackville, New Brunswick; DAVID R. STONE, Georgia Southern University, Statesboro, Georgia, USA; PANOS E. TSAOUSSOGLOU, Athens, Greece; LAMARR WIDMER, Messiah College, Grantham, PA, USA; KENNETH M. WILKE, Topeka, Kansas, USA; and the proposer. There were 4 incorrect solutions. Flanigan refers the interested reader to problem 10501 of the American Mathematical Monthly, volume 103, number 2, February 1996, page 171.

2 2 2

2176. 1996: 275 Proposed by Sefket Arslanagi
c, University of Sarajevo, Sarajevo, Bosnia and Herzegovina. Prove that

v u n uY n t

k=1

1 2

ak + bk

v u n uY n t

k=1

ak +

v u n uY n t

k=1

bk

where a ; a ; : : : ; an 0 and n 2 N. Solution by Sai C. Kwok, San Diego, CA, USA. Using the arithmetic-geometric mean inequality, we have

k=1 ak + bk

n Y

ak

!1

1 n 1 n

k=1 ak + bk

n X

ak

and

k=1 ak + bk

n Y

bk

1 !n

k=1 ak + bk

n X

bk

445 Also solved by THEODORE CHRONIS, student, Aristotle University of Thessaloniki, Greece; yMIHAI CIPU, Romanian Academy, Bucharest, Romania, and Concordia University, Montreal, Quebec; ROBERT GERETSCHLAGER, Bundesrealgymnasium, Graz, Austria; FLORIAN HERZIG, student, Perchtoldsdorf, Austria; RICHARD I. HESS, Rancho Palos Verdes, California, USA; JOHN G. HEUVER, Grande Prairie Composite High School, Grande Prairie, Alberta; yWALTHER JANOUS, Ursulinengymnasium, Inns
bruck, Austria; VACLAV KONECNY, Ferris State University, Big Rapids, Michigan, USA; MITKO KUNCHEV, Baba Tonka School of Mathematics, Rousse, Bulgaria; yCAN ANH MINH, student, University of California Berke
ley, Berkeley, CA, USA; ySOLEDAD ORTEGA and JAVIER GUTIERREZ, students, University of La Rioja, Logro~ o, Spain; WALDEMAR POMPE, stun
dent, University of Warsaw, Poland; JUAN-BOSCO ROMERO MARQUEZ, Universidad de Valladolid, Valladolid, Spain; yHEINZ-JURGEN SEIFFERT, Berlin, Germany; PANOS E. TSAOUSSOGLOU, Athens, Greece; GEORGE TSAPAKIDIS, Agrinio, Greece; and the yproposer. A proof for the case n = 4 was submitted by V.N. Murty. The symbol y before a solver's name indicates that the solver's solution was virtually the same as the one highlighted above. Clearly, the condition that b ; b ; : : : ; bn 0 was inadvertantly left out from the original statement. All solvers assumed, explicitly or implicitly, that this was the case. However, only Hess gave a simple example to show that the inequality need not be true without the aforementioned condition: take n = 2, a = a = 1 and b = b = ,1. Janous pointed out that equality holds if and only if the vectors a ; a ; : : : ; an and b ; b ; : : : ; bn are proportional. Klamkin commented that the given inequality is an immediate special case of Jensen's generalization of Holder's Inequality, and referred readers to D.S. Mitrinovi
et. al., Recent Advances in Geometric Inequalities, Kluwer c Academic Publishers, 1989, pp. 50 54. Kone n
remarked that it is known that if A and B are n n positive c y semi-de nite Hermitian matrices, then

1 2 1 2 1 2 1 2 1 2

n detA + B

n n pdet A + pdet B

see, for example, Inequalities: Theory of Majorization and Its Application by Albert W. Marshall and Ingram Olkin, Academic Press Inc., 1979, p. 475. If we let A and B be the n n diagonal matrices with diagonal entries ak 's and bk's respectively i = 1, 2, : : : , n, then the proposed inequality follows

immediately. Sei ert pointed out that the proof given above can be found on p. 178 of the book Classical and New Inequalities in Analysis, Kluwer Academic Publishers, 1992.

446

ABCD is a convex quadrilateral, with P the intersection of its diagonals and M the mid-point of AD. MP meets BC at E . Suppose that BE : EC = AB : CD . Characterize quadrilateral ABCD.

2 2

2177.

D

dP; CD

P A

whence

dP; AB

C E B

Then, applying the Sine Rule to the triangles 4APM and 4DPM , we get

3

Applying the law of sines to the triangles 4CPE , and 4BPE , we get

whence

sin = CE sin CEP ; CP sin = BE sin180 , CEP = BE sin CEP ; BP BP sin = CE BP = CD BP : sin BE CP AB CP

2 2

4

From 1, 2 follows that quadrilateral ABCD has the desired property if and only if

AB = AP BP = ABP = AB dP; AB CD CP DP CDP CD dP; CD where XY Z denotes the area of 4XY Z and dU; V W the distance of U from V W ; that is, if AB : CD = dP; AB : dP; CD:

2 2

447 This implies that ABCD is characterized by the fact that in the triangles 4ABP and 4CDP , having APB = CPD in common ABCD is convex!, the ratio of the side opposite to P and the altitude passing through P is the same, which means that 4ABP and 4CDP are directly or inversely similar. In the rst case, we have BAP = DCP ; that is, ABCD is a trapezoid with parallel sides AB and CD. In the second case, we have BAP = BAC = PDC = BDC , whence ABCD is an inscribed quadrilateral A and D are at the same side of BC . Also solved by CHRISTOPHER J. BRADLEY, Clifton College, Bristol, UK; SABIN CAUTIS, student, Earl Haig Secondary School, North York, Ontario; CON AMORE PROBLEM GROUP, Royal Danish School of Educational Studies, Copenhagen, Denmark; RICHARD I. HESS, Rancho Palos Verdes, California, USA; MICHAEL LAMBROU, University of Crete, Crete, Greece; WALDEMAR POMPE, student, University of Warsaw, Poland; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. Four incomplete or incorrect solutions were received.

2178. 1996: 318 Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. If A; B; C are the angles of a triangle, prove that

sin A sin B sin C 8 sin A cos B cos C + sin B cos C cos A + sin C cos A cos B 3p3 ,cos A + cos B + cos C :

,

3 3 3 2 2 2

Solution by Florian Herzig, student, Perchtoldsdorf, Austria. I shall prove a stronger version with 6 sin A sin B sin C of the left side. We use the following known identities and inequalities:

3 3 3 2

sin 2A + sin 2B + sin2C = 4 sin A sin B sin C cos A + cos B + cos C = 1 p 2 cos A cos B cos C , sin A sin B sin C 3 8 3 cos A cos B cos C 1 8

2 2 2

sin A cos B cos C + sin B cos C cos A + sin C cos A cos B = sin A1 , cos A cos B cos C + sin B 1 , cos B cos C cos A + sin C 1 , cos C cos A cos B

2 2

448

2

= , cos A cos B cos C sin A cos A + sin B cos B + sin C cos C + sin A cos B cos C + cos Asin B cos C + sin C cos B = , 1 cos A cos B cos C sin2A + sin2B + sin2C 2 + sin Acos B cos C + cos A = ,2 cos A cos B cos C sin A sin B sin C + sin A sin B sin C = sin A sin B sin C 1 , 2 cos A cos B cos C = sin A sin B sin C cos A + cos B + cos C :

2 2 2

3 3

2 2 3

as we wanted to show. Equality holds as in 3 and 4 if and only if A = B = C = 60 . Also solved by SEFKET ARSLANAGIC, University of Sarajevo, Sarajevo, Bosnia and Herzegovina; RICHARD I. HESS, Rancho Palos Verdes, California, USA; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MURRAY S. KLAMKIN, University of Alberta, Edmonton, Alberta; MICHAEL LAMBROU, University of Crete, Crete, Greece; HEINZ-JURGEN SEIFFERT, Berlin, Germany; PANOS E. TSAOUSSOGLOU, Athens, Greece; and the proposer. Janous, in his solution, used a new identity, which is presented as a problem 2279 in this issue.

6 sin A sin B sin C 8sin A cos B cos C + sin B cos C cos A + sin C cos A cos B = 8p A sin B sin C cos A + cos B + cos C sin 3 3cos A + cos B + cos C

2 2 2 2 2 2

Crux Mathematicorum

Mathematical Mayhem

449

No. 15 Bruce Shawyer

All communications about this column should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7

Answer as many questions as you can. Complete solutions carry more credit than scattered comments about many problems. 1. Determine whether or not the following system has any real solutions. If so, state how many real solutions exist.

2. The surface area of a closed cylinder is twice the volume. Determine the radius and height of the cylinder given that the radius and height are both integers. 3. Prove that

1 x + x = y;

1 y + y = z;

1 z + z = x:

1 1 1 + 4 + 1 + : : : + n2 2: 9 4. Describe the set of points x; y in the plane for which sinx + y = sin x + sin y:

5. In a parallelogram ABCD, the bisector of angle ABC intersects AD at P . If PD = 5, BP = 6 and CP = 6, nd AB . 6. Show that, where k + n m,

n X
i=0

n m = m + n : i k+i n+k

450

No. 186 R.E. Woodrow

All communications about this column should be sent to Professor R.E. Woodrow, Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada. T2N 1N4. This number we give the 24 problems proposed to the jury, but not selected for the 37th International Mathematical Olympiad in July 1996 at Mumbai, India. My thanks go to Ravi Vakil, Canadian Team Leader to the 37th IMO for collecting this and other contest material and forwarding it to me.

PROBLEMS PROPOSED TO THE JURY BUT NOT USED AT THE 37th INTERNATIONAL MATHEMATICAL OLYMPIAD

July 1996 | Mumbai, India ab bc ca a5 + b5 + ab + b5 + c5 + bc + c5 + a5 + ca 1:

that

When does equality hold? 2. Let a1 a2 an be real numbers such that for all integers k 0,

ak + ak + + ak 0: 1 2 n Let p = maxfja1 j; : : : ; jan jg. Prove that p = a1 and that x , a1 x , a2 x , an xn , an 1 for all x a1 . 3. Let a 2 be given, and de ne recursively: ! a2 , 2 a : n a0 = 1; a1 = a; an+1 = a2 n n,1 Show that for all integers k 0, we have

1 + 1 + 1 + + 1 a0 a1 a2 ak

1 2 + a , pa2 , 4: 2

451 a Prove that xn , a1 xn,1 , , an,1 x , an = 0 has precisely one positive real root. P P b Let A = n=1 aj , and B = n=1 jaj and let R be the positive real root j j of the equation in a. Prove that AA RB . 5. Let P x be the real polynomial, P x = ax3 + bx3 + cx + d. Prove that if jP xj 1 for all x such that jxj 1, then

1 2

6. Let n be an even positive integer. Prove that there exists a positive integer k such that

k = f xx + 1n + gxxn + 1 for some polynomials f x, g x having integer coe cients. If k0 denotes the least such k, determine k0 as a function of n. 7. Let f be a function from the set of real numbers R into itself such that for all x 2 R, we have jf xj 1 and

Prove that f is a periodic function that is, there exists a non-zero real number c, such that f x + c = f x for all x 2 R. 8. Let the sequence an, n = 1; 2; 3; : : : ; be generated as follows: a1 = 0, and for n 1,

13
+ f x = f x + 1
+ f x + 1
: f x + 42 6 7

an = abn=2c + ,1nn+1=2: Here btc is the greatest integer less than or equal to t. a Determine the maximum and minimum value of an over n 1996 and nd all n 1996 for which these extreme values are attained. b How many terms an, n 1996, are equal to 0? 9. Let triangle ABC have orthocentre H , and let P be a point on its circumcircle, distinct from A, B , C . Let E be the foot of the altitude BH , let PAQB and PARC be parallelograms, and let AQ meet HR in X . Prove that EX is parallel to AP . 10. Let ABC be an acute-angled triangle with jBC j jCAj, and let O be the circumcentre, H its orthocentre, and F the foot of its altitude CH . Let the perpendicular to OF at F meet the side CA at P . Prove that FHP = BAC .

452

11. Let ABC be equilateral, and let P be a point in its interior. Let the lines AP , BP , CP meet the sides BC , CA, AB in the points A1, B1, C1 respectively. Prove that

A1B1 B1C1 C1A1 A1B B1C C1A:

12. Let the sides of two rectangles be fa; bg and fc; dg respectively, with a c d b and ab cd. Prove that the rst rectangle can be placed within the second one if and only if

b2 , a22 bc , ad2 + bd , ac2:

13. Let ABC be an acute-angled triangle with circumcentre O and circumradius R. Let AO meet the circle BOC again in A0 , let BO meet the circle COA again in B 0 and let CO meet the circle AOB again in C 0 . Prove that

When does equality hold? 14. Let ABCD be a convex quadrilateral, and let RA , RB , RC , RD denote the circumradii of the triangles DAB , ABC , BCD, CDA respectively. Prove that RA + RC RB + RD if and only if A + C B + D. 15. On the plane are given a point O and a polygon F not necessarily convex. Let P denote the perimeter of F , D the sum of the distances from O to the vertices of F , and H the sum 2 the 2distances from O to the lines of containing the sides of F . Prove that D , H P 2 =4. 16. Four integers are marked on a circle. On each step we simultaneously replace each number by the di erence between this number and the next number on the circle, moving in a clockwise direction; that is, the numbers a, b, c, d are replaced by a , b, b , c, c , d, d , a. Is it possible after 1996 such steps to have numbers a, b, c, d such that the numbers jbc , adj, jac , bdj, jab , cdj are primes? 17. A nite sequence of integers a0; a1; : : : ; an is called quadratic if for each i in the set f1; 2; : : : ; ng we have the equality jai , ai,1 j = i2 . a Prove that for any two integers b and c, there exists a natural number n and a quadratic sequence with a0 = b and an = c. b Find the smallest natural number n for which there exists a quadratic sequence with a0 = 0 and an = 1996. 18. Find all positive integers a and b for which

a2 + b2 = a2 + b2 + ab; b a ab

453 where, as usual, btc refers to the greatest integer which is less than or equal to t. 19. Let N0 refer to the set of non-negative integers. Find a bijective function f from N0 into N0 such that for all m; n 2 N0 ,

2 2

unit squares in the usual manner. Each of the n vertices of these squares is to be coloured red or blue. Find the number of di erent colourings such that each unit square has exactly two red vertices. Two colouring schemes are regarded as di erent if at least one vertex is coloured di erently in the two schemes. 21. Let k, m, n be integers such that 1 n m , 1 k. Determine the maximum size of a subset S of the set f1; 2; 3 : : : ; k , 1; kg such that no n distinct elements of S add up to m. 22. Determine whether or not there exist two disjoint in nite sets A and B of points in the plane satisfying the following conditions: a No three points in A B are collinear, and the distance between any two points in A B is at least 1. b There is a point of A in any triangle whose vertices are in B, and there is a point of B in any triangle whose vertices are in A. 23. A nite number of beans are placed on an in nite row of squares. A sequence of moves is performed as follows: at each stage a square containing more than one bean is chosen. Two beans are taken from this square; one of them is placed on the square immediately to the left while the other is placed on the square immediately to the right of the chosen square. The sequence terminates if at some point there is at most one bean on each square. Given some initial con guration, show that any legal sequence of moves will terminate after the same number of steps and with the same nal con guration. 24. Let U be a nite set and f , g be bijective functions from U onto itself. Let and

S = fw 2 U : f f w = ggwg

T = fw 2 U : f gw = gf wg; and suppose that U = S T . Prove that, for m 2 U , f w 2 S if and only if g w 2 S .

As always we welcome your nice original solutions which di er from the o cial solutions provided by the proposers and the selection committee.

454 As an example of an Olympiad which may not be as widely circulated, and for which you may not have already seen solutions, we give the four problems of the 4th Class for the Croatian National Mathematical Competition of May 13, 1994 and the three problems of the Croatian Mathematical Olympiad of May 14, 1994. My thanks go to Richard Nowakowski, Canadian Team Leader at the 35th IMO in Istanbul for collecting these problems.

Fourth Class

May 13, 1994

1. One member of an in nite arithmetic sequence in the set of natural numbers is a perfect square. Show that there are in nitely many members of this sequence having this property. 2. For a complex number z let w = f z = 2 .

w , 1 = z , 1: w,2 z,2 c Let z0 = 1 and the sequence fzn g be de ned recursively by 2 zn = 3 , 2 ; n 1: z

n,1

a Determine the set fw : z = 2 + iy; y 2 Rg in the complex plane. b Show that the function w can be written in the form

3,z

Using the property b calculate the limit of the sequence fzng. 3. Determine all polynomials P x with real coe cients such that for some n 2 N we have xP x , n = x , 1P x, 8 x 2 R. 4. In the plane ve points P1, P2, P3, P4, P5 are chosen having integer coordinates. Show that there is at least one pair Pi; Pj , for i 6= j such that the line PiPj contains a point Q, with integer coordinates, and is strictly between Pi and Pj . .

May 14, 1994

1. Find all ordered triples a; b;c of real numbers such that for every three integers x; y; z the following identity holds:

jax + by + czj + jbx + cy + azj + jcx + ay + bzj = jxj + jyj + jzj:

455

2. Construct a triangle ABC if the lengths jAOj, jAU j and radius r of the incircle are given, where O is the orthocentre and U the centre of the incircle. 3. Let P be the set of all lines of the plane M . Does there exist a function f : P ! M having the following properties: a the function f is an injection: b f p 2 p, 8 p 2 P ?

That should provide some problems for your puzzling pleasure over the next couple of months. Now we return to readers' solutions to problems featured in earlier numbers of the Corner. First, an apology. Somehow, in shifting my les around we misplaced solutions by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain, to two problems that we discussed in the October number of the Corner. His name should be added as a solver of problems 6 and 7 of the Telecom 1993 Australian Mathematical Olympiad in the solutions given 1997: 324 325 . Last number we gave solutions by the readers to the rst ten problems of the Baltic Way | 92" contest given in the May 1996 number 1996: 157 159 .

Let Q+ denote the set of positive rational numbers. Show that there exists one and only one function f : Q+ ! Q+ satisfying the following conditions:

q i If 0 q 1 then f q = 1 + f 1,2q . 2 ii If 1 q 2 then f q = 1 + f q , 1. 1 iii f q f q = 1 for all q 2 Q+. Solution by Michael Selby, University of Windsor, Windsor, Ontario. 1 e By a change of variable q = 1,2q , we have from i,

11.

1 e e f 1 + 2q = 1 + f q; 0 q 1; or f 1 + 2 = 1 + f 1 : 1 e q e q e Calling t = 1 and using iii we have q e 1 = 1 + 1 ; 0 t 1; t 2 Q+: 1 f t + 2 f t

e q

!

456 Then

Hence, we can evaluate f t + 2k, k 0, k an integer, if we know f t. Observe that condition ii can be rewritten as f 1 + t = 1 + f t, t 2 Q+, 0 t 1. We can now evaluate f 2k + 1 + q as follows: Since

1 1 1 1 f t + 4 = f t + 2 + 2 = 1 + f t + 2 = 1 + 1 + f t 1 = 2 + f t :

1 1 = 1 + 1 ; we have = 1 + f 1 1 q : f 2 + q f q f 2 + 1 + q + 1 = 1 + 1 . Hence f 3 + q , 0 q 1 If 0 q 1, then f 3 + q 1 + f q can be evaluated if f q is known. Once f 3 + q is known, we obtain 1 = 1 = 1 + f 31 q ; f 5 + q f 2 + 3 + q +

and Therefore, we can now evaluate

1 1 + 1 + f 2k , 1 + q ; 1 q 0: f 2k + 1 + q

f 2k + q; f 2k + 1 + q 0 q 1; 2 for all k 0, k an integer, if we know f q . Furthermore, we can evaluate f n, n 1. First f 1 = 1 since putting q = 1 in iii gives f 12 = 1. Now f 2 = 1 + f 1 = 2 from ii. We follow recursively, f 3:

1 = 1+ 1 =2 f 3 f 1 1 1

and Similarly

f 2k + 1 = 1 + f 2k , 1 :

1 1 = 1 + f 2k and f 2 = 2: f 2k + 2

Thus any such function is uniquely de ned on the integers. Finally, we can evaluate the function at any q from the values on the positive integers. Let q = a , where a; b = 1. b

457 Write a = bq1 + r1 where q1 is a non-negative integer, and 0 r1 b is an integer. If r1 = 0, f q = f q1 which is determined. If a r1 b, we apply f a = f q1 + rb1 . This is determined if the b value of f rb1 is known using 2. Now 0 rb1 1. We now compute f rb1 . b = r1q2 + r2, r2 r1. Continuing, since 0 rk+1 rk, rj = 0 for some j , and we will have an expression for which f is evaluated at an integer. Hence f exists and is uniquely determined. 12. Let N denote the set of positive integers. Let ' : N ! N be a bijective function and assume that there exists a nite limit What are the possible values of L? Solution by Michael Selby, University of Windsor, Windsor, Ontario. We claim L must be 1. Consider maxf'1;: : : ; 'ng = jn . We note that jn n, since ' is one-to-one. Let in 2 f1; 2; : : : ; ng be such that 'in = jn . Then Since

nlim !1

'n = L: n

'in 1: in

'n = L; lim 'in = L 1: 1 n!1 in n Now consider Sn = fn 2 N : 'n ng. Sn must be in nite. First Sn 6= ; for if Sn = ; then 'k k for all k and there is no k0 with 'k0 = 1. Suppose Sn is nite, with k the largest value in the set. Then 'n n for n k + 1. Consider f1; 2; : : : ; k + 1g. Since 'n k + 1 for n k + 1, the only integers which can be pre-images of f1; 2; : : : ; k + 1g are f1; 2; : : : ; kg. This is not possible, since ' is one-to-one and onto. Therefore Sn = fn 2 N : 'n ng is in nite. Choose a sequence, nk 2 Sn with nk ! 1. We now have klim 'nk = L. However !1 n

nlim !1

'nk 1: nk L 1:

458 equality

n X

holds. Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Christopher J. Bradley, Clifton College, Bristol, UK; by Michael Selby, University of Windsor, Windsor, Ontario; by Bob Prielipp, University of Wisconsin Oshkosh,Wisconsin,USA; by PanosE. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We feature Bradley's solution. Now,

i=1 i i

1 xy

Pn

n X

n 4 1 X 2 i=1 xi + yi i=1 xi yi Lemma. a1 + a2 + + an a2 a3 an + a1 a3 a4 an + a1 a2 a4 an + + a1a2 an,1 n2a1a2 an .

This follows from separate applications of the AM GM inequality to the two terms on the left. It follows that

a1 + a2 + + an

Now put and then

1 1 1 a1 + a2 + + an

n2

1 ai = x + y 2 ; i i

i = 1; : : : ; n

Pn

n X

i=1 i i

n2 : i=1xi + yi2

1 xy

Pn

14. There is a nite number of towns in a country. They are connected by one direction roads. It is known that, for any two towns, one of them can be reached from the other one. Prove that there is a town such that all the remaining towns can be reached from it.

459 Solutions by Mansur Boase, student, St. Paul's School, London, England; and by Christopher J. Bradley, Clifton College, Bristol, UK. We give the solution by Boase. We prove the result by induction on the number, n, of towns. If n 2 the result is immediate. Label the towns A1 ; A2 ; : : : ; Ak . We shall prove that if the statement holds for all n k, then it is also true for n = k, so by induction it will be true for all n. We can split up the towns excluding A1 into two sets M and N , M containing those towns which can be reached from A1 and N those which cannot be reached from A1. Thus, every town in N can reach A1 , and there is no route from a town in M to a town in N . If N is empty, then A1 is the desired town. If this is not the case, then, since for any two towns in N , one of them can be reached from the other, and there is no route from outside N into N , the routes in question must pass through towns in N . By the induction hypothesis, since jN j k, there is a town in N which can reach all other towns in N . It can also reach A1 , and thus all towns in M . Therefore, this is the town which can reach all the other towns in the country, and the result is proved. 15. Noah has 8 species of animals to t into 4 cages of the ark. He plans to put species in each cage. It turns out that, for each species, there are at most 3 other species with which it cannot share the accommodation. Prove that there is a way to assign the animals to their cages so that each species shares with compatible species. Solution by Mansur Boase, student, St. Paul's School, London, England. Let the animals be vertices of a graph. Join two animals by an edge if they are compatible. Now we have a graph with 8 vertices, and each vertex is joined to at least 4 others. So, by Dirac's theorem on Hamiltonian cycles, there must be a Hamiltonian cycle, and if we take consecutive pairs of animals in this cycle, we can put them in the same cage, and we have the required solution. 17. Quadrangle ABCD is inscribed in a circle with radius 1 in such a way that one diagonal, AC , is a diameter of the circle, while the other diagonal, BD, is as long as AB . The diagonals intersect in P . It is known that the length of PC is 2 . How long is the side CD? 5 Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; and by Christopher J. Bradley, Clifton College, Bristol, UK. We give the solution of Arslanagi . c

460

C P O B

A The triangle ABD is isosceles because AB = BD. Let O be the centre of the circumcircle. Then BO ? AD. Because CD ? AD AC is a diameter, we get CDkBO; that is, 4PCD 4POB , and it follows that

18. Show that in a non-obtuse triangle the perimeter of the triangle is always greater than two times the diameter of the circumcircle. Solutions by Sefket Arslanagi
, University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, Clifton College, Bristol, UK; by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. We give Prielipp's solution. In this solution R; r; s will denote the circumradius, inradius and semiperimeter of a triangle. We shall show that in a non-obtuse triangle the perimeter is always greater than or equal to 22R + 2r. Lemma. If A is an angle of triangle ABC , then cos A is a root of the equation

4R2t3 , 4RR + rt2 + s2 + r2 , 4R2 t + 2R + r2 , s2 = 0 Proof. Since a = 2R sin A, and s , a = r cot A , 2

s = a + s , a = 2R sin A + r cot A 2 p s

CD = PC ; that is OB PO 2 CD = OB PC = 1 3 5 = 2 : PO 3 5

461 Thus so

4R21 , cos A21 + cos A + 4Rr1 + cos A1 , cos A +r2 1 + cos A , s21 , cos A = 0:

Hence

rR2 cos3 A , 4RR + r cos2 A + s2 + r2 , 4R2 cos A +2R + r2 , s2 = 0 making cos A a root of the equation . Corollary 1. If A, B , and C are the angles of triangle ABC , then cos A, cos B , and cos C are the roots of the equation . Corollary 2. If A, B , and C are the angles of triangle ABC , then 2 R 2 cos A cos B cos C = s , 2R2 + r : 4 Corollary 3. If A is the largest angle of triangle ABC , then s 2R + r if A 90 s = 2R + r if A = 90 and s 2R + r if A 90 :

Corollary 4. In a non-obtuse triangle the perimeter of the triangle is always greater than or equal to 22R + 2r. Proof. If the triangle is an acute triangle, then s 2R + r, and 2s 22R + 2r. If the triangle is a right triangle, then s = 2R + r. Thus 2s = 22R + 2r. Corollary 5. In a non-obtuse triangle the perimeter of the triangle is always greater than twice the diameter of the circumcircle. 19. Let C be a circle in the plane. Let C1 and C2 be nonintersecting circles touching C internally at points A and B respectively. Let t be a common tangent of C1 and C2 , touching them at points D and E respectively, such that both C1 and C2 are on the same side of t. Let F be the point of intersection of AD and BE . Show that F lies on C .

462 Solution by Christopher J. Bradley, Clifton College, Bristol, UK. Let SA be the tangent to C1 and C at A and TB be the tangent to C2 and C at B , as shown. S F t D A 90 ,

'

C1 C

G O

90

, '' B

C2

Let SAD = and TBE = '. Let O be the centre of C . AO meets C1 again at G and since it is a common radius, AG is a diameter of C1. BO meets C2 again at H and BH is likewise a diameter of C2. We have DAG = 90 , and DGA = . By the alternate segment theorem GDE = 90 , and since ADG = 90 angle in a semicircle it follows that FDE = . Similarly FED = ' and so DFE = 180 , , '. Also EBH = 90 , '. Considering the angles of the re-entrant quadrilateral FAOB we have re ex AOB = 360 , 90 , , 90 , ' , 180 , , ' = 2 + 2'. So AOB = 360 , 2 , 2' = 2 DFE . But O is the centre of circle C , and AB is an arc of C , so F lies on C . Converse of the angle at the centre

20. Let a b c be the sides of a right triangle, and let 2p be its perimeter. Show that pp , c = p , ap , b = S the area of the triangle. Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; by Mansur Boase, student, St. Paul's School, London, England; by Christopher J. Bradley, CliftonCollege, Bristol, UK; by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario; by Bob Prielipp, University of Wisconsin Oshkosh, Wisconsin, USA; by Michael Selby, University of Windsor, Windsor, Ontario; by Panos E. Tsaoussoglou, Athens, Greece; and by Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. b Since the triangle is a right triangle we have c2 = a2 + b2 , p = a+2+c , and S = ab . 2

463 Then

4 2

and

p , ap , b =

a + b + c , a
a + b + c , b

2 2

as required.

We conclude this number of the Corner with solutions to some of the problems of the 8th Iberoamerican Mathematical Olympiad, September 14 15, 1993 Mexico which we gave last year 1996: 159 160 .

8th IBEROAMERICAN MATHEMATICAL OLYMPIAD September 14 15, 1993 Mexico 1. Argentina Let x x xi xi be all the

palindromic natural numbers, and for each i, let yi = xi+1 , xi . How many distinct prime numbers belong to the set fy1; y2 ; y3; : : : g ? Solutions by Mansur Boase, student, St. Paul's School, London, England; and by Shawn Godin, St. Joseph Scollard Hall, North Bay, Ontario. We give Boase's solution. The rst few palindromic numbers are We shall show that these are the only two prime values which a yi term can take. If xi and xi+1 have di erent numbers of digits, then xi will be of the form 99 : : : 9 and xi+1 of the form 10 : : : 01, so yi = xk+1 , xi = 2. We can consider, without any loss of generality only yi where xi has more than two digits since yi can only be prime if yi = 2 or 11 for xi with one or two digits from the above list of the rst xi . If xi and xi+1 end in the same digit, then 10 divides yi, so yi cannot be prime. If xi and xi+1 end in di erent digits, say r and s, then s = r + 1,

1 2 +1

464

xi is of the form r999 : : : 9r, and xi+1 is of the form r + 10 : : : 0r + 1. Then yi = xi+1 , xi = r + 1 , 10 , r = 11. Thus only two distinct primes belong to the set fy1; y2 ; : : : g.

2. Mexico Show that for any convex polygon of unit area, there exists a parallelogram of area 2 which contains the polygon. Solution by Mansur Boase, student, St. Paul's School, London, England. We shall show more generally that there exists a rectangle of area 2 containing the polygon. The result is obviously true for a triangle. To prove this, construct a rectangle on the longest side of the triangle and circumscribing the triangle. If the area of the triangle is 1, then the rectangle will have area 2. A

B C If the polygon has more than three vertices, then choose the two vertices of the polygon which are furthest apart. Call them B and C . Draw perpendiculars to the line BC at B and at C to give lines l1 and l2 , respectively. D B l1 E l2 All the vertices of the polygon must lie between these two lines. Otherwise there would be two vertices further apart than jBC j. Now consider the smallest rectangle which circumscribes the polygon and with one pair of opposite sides lying on l1 and l2 . Suppose this polygon touches the polygon again at D and E . R B D U S E C T Let the vertices of the rectangle be R, S , T and U with D on UR and E on ST . Then it is easy to see that C

RUCB = 2 BCD

465 and

BSTC = 2 BEC since BC kRU and BC kST . RSUT = 2 CDBE 2area of polygon= 2

since the polygon is convex. We can nd an even larger rectangle of area 2 containing the polygon. 4. Spain Let ABC be an equilateral triangle, and , its incircle. If D and E are points of the sides AB and AC , respectively, such that DE is tangent to ,, show that Solutions by Sefket Arslanagi , University of Sarajevo, Sarajevo, Bosnia c and Herzegovina; and by Mansur Boase, student, St. Paul's School, London, England. We give Arslanagi 's solution. c C

AD + AE = 1: DB EC

a E A D

,

p

B a Let AB = AC = BC = a and BD = p; that is, AD = a , p, and CE = q; that is, AE = a , q. The circle , is inscribed in the quadrilateral and we get

or or

ED + BC = BD + CE ED + a = p + q

ED = p + q , a: By the law of cosines for the triangle ADE , it follows that ED2 = AE2 + AD2 , 2AE AD cos 60 ;

so, from and from this we obtain Now, we have

pq a = p3+ q : AD = a , p = p2q+,qp p

as required. 6. Argentina Two non-negative integer numbers, a and b, are cuates" friends in Mexican if the decimal expression of a + b is formed only by 0's and 1's. Let A and B be two in nite sets of non-negative integers, such that B is the set of all the numbers which are cuates" of all the elements of A, and A is the set of all the numbers which are cuates" of all the elements of B . Show that in one of the sets A or B there are in nitely many pairs of numbers x, y such that x , y = 1. Solution by Mansur Boase, student, St. Paul's School, London, England. Suppose an integer of A ends with the digit `r'. Then all integers in B must have a last digit the same as for 10 , r or 11 , r in order that they are all cuates" of A. If B contains elements with last digits the same as for 10 , r and 11 , r, then every element of A must end in the last digit r to be cuates" with integers of B of both last digits. Thus either set A or set B has all integers ending in the same digit. Without loss, assume that all elements of A end in `r'. Now consider an element of B which is a cuate" of all the integers of A. Let us say it is of type i if it ends with the last digit 10 , r and of type ii if it ends with the last digit of 11 , r. If we change the last digit we obtain another number which is a cuate" of all the elements of A, and hence in B. The di erence between these pairs is 1. It follows therefore that there are equal numbers of each type in B , and as B is in nite, there are in nitely many pairs x; y in B such that x , y = 1. That completes the Corner for this month. Send me your Olympiad contest materials and your nice solutions to problems in the Corner.

467

BOOK REVIEWS

Edited by ANDY LIU

Learn from the Masters! edited by Frank Swetz, John Fauvel, Otto Bekken, Bengt Johansson, Victor Katz, published by the MAA, Classroom Resource Materials Series, 1995, ISBN 0-88385-703-0, softcover, 312+ pages, $23.00. Reviewed by Maria de Losada, Bogot
, Colombia. a A rich and varied collection of thoughts directed primarily toward the use of the history of mathematics for e ective and enriched teaching and learning, these are papers given at the Kristiansand Norway Conference" of 1988. The areas and topics cover a broad range corresponding to di erent tastes and personal interests, divided in sections on school and higher mathematics. Frank Swetz's Using Problems from the History of Mathematics in Classroom Instruction is a superb example of history transcending anecdotal information and grasping the relationship between problem solving and the gradual construction of meaning especially clear in the section Illustrating the growth of mathematical pro ciency, an essential component of each individual student's coming to grips with mathematical concepts. The choice of problems and the orientation involving the speci c ways in which they can be used to enrich instruction is excellent. Other papers that focus on mathematical thinking explore algorithms and analogies, modelling and heuristic reasoning, as well as Man-Keung Siu's Mathematical Thinking and History of Mathematics. In the latter section, amidst the very ne selection o ered, the article by Israel Kleiner The Teaching of Abstract Algebra: An Historical Perspective stands out. Kleiner describes his approach as genetic, but notes that he tries to show how attempts to solve the problems give rise to the abstract theory. This is, of course, the historical sequence of events." He further addresses the question of how history provides the opportunity to raise a number of general issues about the nature of mathematics". It is most unfortunate that the random sprinkling of photographs of notable mathematicians throughout the book should place that of Emmy Noether opposite the title In Hilbert's Shadow. De nitely of interest to those who lean toward using history as a resource for enriching their teaching and the mathematical thinking of their students, as well as to those whose interest in historical subjects is just beginning to be awakened.

468

student, D. S. McKenzie Junior High School, Edmonton students, Grandview Heights Junior High School, Edmonton

Frank Chen

The First Problem

A domino is de ned to be a 1 2 or 2 1 rectangle. The rst one is said to be horizontal and the second vertical. In our Mathematics Club, we learned to count the number gn of di erent ways of dissecting a 3 2n strip into dominoes. The sequence fgn g satis es the recurrence relation gn = 4gn,1 , gn,2; 1 for all n 2, with initial conditions g0 = 1 and, as shown in Figure 1, g1 = 3.

Figure 1 The generating function Gx for the sequence is de ned to be the formal power series It is easy to deduce from 1 that

2

In examining the dissections of the 3 2n strip, we observed that they fall into two kinds. A dissection of the rst kind can be divided by a vertical line into two substrips without splitting any dominoes. Such a line is called a fault line. A dissection of the second kind, called a fault-free dissection, has no fault lines. Figure 2 shows an example of each, using 3 4 strips.

469

Figure 2 Let fn be the number of fault-free dissections of the 3 2n strip. From Figure 1, f1 = 3. For all n 2, a fault-free dissection cannot start with three horizontal dominoes. It must start o as shown in Figure 3, and continue by adding horizontal dominoes except for a nal vertical one.

Figure 3 It follows that fn = 2 for all n 2, and the sequence satis es a trivial recurrence relation

to

fn = fn,1 for all n 3, with initial conditions f0 = 1; f1 = 3 and f2 = 2. Let F x = f0 + f1x + f2x2 + be the generating function2 for the sequence. Then F x = ,1 + x + 21 + x + x2 + = ,1 + x + 1,x . This simpli es x F x = 1 +12, , x : x

2

3

Having solved the simpler problem of counting fault-free dissections of the 3 2n strip, we make use of our result to nd an alternative solution to the general problem of nding all dissections of this strip. They can be classi ed according to where the rst fault line is. This is taken to be the right end of the strip if the dissection is fault-free. Then the strip is divided into a 3 2k substrip on the left and a 3 2n , k substrip on the right, where 1 k n. Since the rst substrip is dissected without any fault lines, it can be done in fk ways. The second substrip can be dissected in gn,k ways as we do not care whether there are any more fault lines. Hence

4

470 From the values of fn, gn = 3gn,1 + 2gn,2 + 2gn,3 + + 2g0 . If we subtract from this expression gn,1 = 3gn,2 + 2gn,3 + + 2g0 , we have gn , gn,1 = 3gn,1 , gn,2, which is equivalent to 1. We now derive 2 in another way. It follows from 4 that for all n 1,

2gn = f0gn + f1gn,1 + f2 gn,2 + + fng0 : 5 Multiplying F x and Gx yields F xGx = f0 + f1x + f2x2 + g0 + g1x + g2x2 + = f0g0 + f0g1 + f1g0 x + f0g2 + f1 g1 + f2 g0x2 + : In view of 5, this becomes F xGx = g0 +2g1x +2g2x2 + = 2Gx , 1

so that

6

Substituting 3 into 6 yields 2. Let gn be the number of ways of dissecting a 4 n strip into dominoes. Then g0 = 1; g1 = 1 and, as shown in Figure 4, g2 = 5. It is not hard to verify that g3 = 11. We wish to determine the in nite sequence fgn g via recurrence relations and generating functions.

Figure 4 Let fn be the number of fault-free dissections of the 4 n strip. We have f0 = 0; f1 = 1 and from Figure 4, f2 = 4. For odd n 3, the only fault-free dissections are the extensions of the second and third ones in Figure 4, with horizontal dominoes except for a nal vertical one. Hence fn = 2. For even n 4; fn = 3 since we can also include similar extensions of the fourth dissection in Figure 4. As in the solution of the First Problem, we have

gn = gn,1 + 5gn,2 + gn,3 , gn,4 7 for all n 4, with initial conditions g0 = 1; g1 = 1; g2 = 5 and g3 = 11. F x = 1 + x + 4x2 + 2x3 + 3x4 + 2x5 + 3x6 + = ,2 , x + 2x2 +31 + x2 + x4 + x6 + + 2x1 + x2 + x4 + = ,2 , x + x2 + 3 + 2x 1 , x2 2 + x3 , x4 3 : 8 = 1 + x + 1 x x2 ,

We now give an alternative solution to the Second Problem, along the line of the solution to the First Problem we learned at the Mathematics Club. We classify the dissections of the 4 n strip into ve types according to how they start. These correspond to those in Figure 4 if we ignore the vertical dominoes in the second column. Call these Types A, B, C, D and E, and let their numbers be an ; bn ; cn ; dn and en , respectively. By symmetry, we have bn = cn so that gn = an + 2bn + dn + en 10 for all n 1. In a Type A dissection, we are left with a 4 n , 2 strip, which can be dissected in gn,2 ways. Hence an = gn,2 11 for all n 3, with a1 = 0 and a2 = 1. In a Type B dissection, if we complete the second column with a vertical domino, the remaining 4 n , 2 strip can be dissected in gn,2 ways. The only alternative is to ll the second column with two horizontal dominoes. The remaining part can be dissected in bn,1 ways, so that bn = gn,2 + bn,1 12 for all n 3, with b1 = 0 and b2 = 1. In a Type D dissection, the situation is similar except that if we ll the second column with two horizontal dominoes, we must then also ll the

, 2 Gx = 1 , x , 1 x2 x x3 + x4 : 5 ,

9

472 third column with two more horizontal dominoes. The remaining part can be dissected in dn,2 ways, so that dn = gn,2 + dn,2 13 for all n 3, with d1 = 0 and d2 = 1. Finally, in a Type E dissection, after lling the rst column with two vertical dominoes, we are left with a 4 n , 1 strip which can be dissected in gn,1 ways. Hence en = gn,1 14 for all n 2, with e1 = 1. Now 7 follows from 10, 11, 12, 13 and 14 since

gn = an + 2bn + dn + en = gn,2 + 2gn,2 + 2bn,1 + gn,2 + dn,2 + gn,1 = gn,1 + 4gn,2 + 2gn,3 + bn,2 + dn,2 = gn,1 + 4gn,2 + 2gn,3 + 2bn,2 + dn,2 = gn,1 + 4gn,2 + 2gn,3 + gn,2 , an,2 , en,2 = gn,1 + 5gn,2 + gn,3 , gn,4: Using 7, 1 , x , 5x2 , x3 + x4 Gx simpli es to 1 , x2 . Hence 9 also

follows.

Supplementary Problem

Let fn denote the number of fault-free dissections of the 4 n strip. Find a recurrence relation for the sequence ffn g with initial conditions.

Acknowledgement

This article has been published previously in a special edition of delta-k, Mathematics for Gifted Students II, Vol. 33, 3 1996, a publication of the Mathematics Council of the Alberta Teachers' Association and in AGATE, Vol. 10, 1, 1996, the journal of the Gifted and Talented Education Council of the Alberta Teachers' Association. It is reprinted with permission of the authors and delta-k.

473

No. 26 R.E. Woodrow

This number we give the 30 problems of the Kangourou Des Math matie ques, Epreuve Europ enne, which was given Friday March 22, 1996 to about e 500,000 students in 16 European countries, and in 8 African countries, without counting French schools around the world. My thanks go to Ravi Vakil, Canadian Team leader to the 37th IMO in Mumbai, India, who collected a great deal of contest material and forwarded it to me. My copy is in French, and we give it in that language. The contestants are given 75 minutes, and no calculators are allowed.

March 22, 1996

Time: 75 minutes 1. Les repr esentants de 12 pays ont choisi pour vous ces 30 questions. Chaque question a et discut e 10 minutes. Quelle a et la dur e totale de e e e e la discussion? 3 points A. 360 min B. 300 min C. 120 min D. 52 min E. 40 min.

2.

A. 3 cm2

B. 4 cm2

C. 6 cm2 B. 19 9 6

D. 9 cm2

E. 12 cm2 . C. 1 99 6

A. 1 9 9 6

D. 1 9 96

3 points

E. 19 96.

4. En utilisant une et une seule fois chacun des chi res 1; 2; 3 et 4, je peux ecrire di erent nombres. Je peux ecrire par exemple 3241. Quelle est le di erence entre le plus grand et le plus petit nombre ainsi fabriqu s? e 3 points A. 2203 B. 2889 C. 3003 D. 3087 E. 3333.

474

5. Un cercle et un rectangle s'aimaient d'amour tendre, Mais malheureusement, dit le cercle, que nous croissions ou r
tr
cissions, nous ne e e pourrons jamais avoir plus de n points communs!" A votre avis, combien vaut n? 3 points A. 2 B. 4 C. 5 D. 6 E. 8.

3 A. 1110

6. Le nombre 7. La

3 B. 1000

1 10

D.

111 1110

3 points 3 E. 111 .

gure ci-contre repr sente un grand carr d'aire 1 m2 . Une diage e onale est partag e en trois segments de m^ me longueur. Le segment m dian e e e est une diagonale du petit carr gris. Quelle est l'aire de ce petit carr ? e e 3 points

1 A. 10 m2

B. 1 m2 9

1 C. 6 m2

D. 1 m2 4

1 E. 3 m2 .

8. La salle d'un th
ea^ tre comporte 26 reng
ees de 24 places chacune. Toutes les places sont num
rot
es, en commen ant par le premier rang. Dans e e c quelle rang
e se trouve le si ge num
rot
375? e e e e 3 points A. 12e
me B. 13e
me C. 14e
me D. 15e
me E. 16e
me.

1La somme de deux nombres n
gatifs est toujours n
gative. e e 2La somme d'une nombre positif et d'un nombre n
gatif est toujours pose itive. 3La somme d'une nombre n
gatif et de deux nombres positifs est toujours e positive. A. aucune B. la 1 seule C. le 1 et la 2 D. la 2 et la 3 E. toutes les trois.

9. Parmi les phrases ci-dessous, quelles sont les phrases vraies?3 points

10. a est un nombre de deux chi res, b est le nombre obtenu en ecrivant deux fois, c^ te a c^ te, les deux chi res de a. Quel est le quotient de o o b par a? 3 points A. 10 B. 11 C. 99 D. 100 E. 101.

475

11. Un triangle e quilat eral et un hexagone sont inscrits dans un m^ me e cercle. Si l'on divise l'aire de l'hexagone par l'aire du triangle, quel est le quotient obtenu? 4 points

A. 1:5

B. 2

C. 3

D. 4

E. .

12. Un kangourou a dans sa poche 3 chaussettes blanches, 2 chaussettes noires et 5 chaussettes grises. Sans regarder, il veut en prendre une paire. Quel nombre minimum de chaussettes lui faut-il sortir pour etre s^ r ^ u qu'il en a bien deux de la m^ me couleur? e 4 points A. 2 B. 3 C. 4 D. 7 E. 10.

e 13. A la f^ te foraine, une llette a achet
e cinq e
chettes. Chaque fois qu'elle touche la cible, elle a deux echettes gratis. Elle a lanc
en tout 17
e echettes. Combien de fois a-t-elle touch
la cible.
e 4 points A. 4 B. 6 C. 7 D. 12 E. 17.

14. Les bissectrices de deux angles d'un triangle font entre elles un angle de 110 . Combien vaut le troisi me angle de ce triangle? 4 points e

110

A. 30

B. 40

C. 45

D. 55

E. 70 .

15. Une vieille montre retarde de 8 minutes par vingt-quatre heures. De combien de minutes dois-je l'avancer ce soir a 22 heures si j'ai absolument besoin qu'elle me donne l'heure exacte demain matin a 7 heures? 4 points A. 1 min 40 s B. 2 min 20 s C. 3 min D. 4 min 30 s E. 6 min.

476

16. La somme, en degr
es, des angles marqu
es sur la gure ci-contre est egale a:
4 points

r r r

A. 120

B. 150

C. 180

D. 270

E. 360.

17. Un bidon plein de lait p
ese 34 kg. Le m^ me bidon quand il est a e moiti
plein p se 17; 5 kg. Combien p se le bidon vide? e e e 4 points A. 1 kg B. 0; 5 kg C. 1; 5 kg D. 2 kg

E. il n'y a pas assez de donn
es. e 18. Le c^ t
es d'un triangle mesurent 8 cm, 15 cm et 17 cm. Quelle est o son aire? 4 points A. 40 cm2 B. 60 cm2 C. 68 cm2 D. 80 cm2 E. on ne peut pas la calculer. 19. Entre 6 heures ce matin et 18 heures ce soir, combien de fois les deux aiguilles de ma montre feront-elles un angle droit? 4 points A. 2 B. 6 C. 12 D. 22 E. 24.

20. Simone a un gros tas de dalles triangulaires. Toutes ces dalles ont une forme identique: ce sont des triangles equilat
raux de 1 dm de c^ t
. De
e oe combien de dalles Simone aura-t-elle besoin pour daller un grand triangle equilat
ral de 2 m tres de c^ te?
e e o 4 points A. 200 B. 300 C. 400 D. 600 E. 800. 21. En d
ecoupant un coin d'un cube en bois, on a obtenu le solide ci-contre. Maintenant on d
coupe de la m^ me fa on les sept autres coins du e e c cube. On a alors un solide qui a quatorze faces les faces triangulaires ne se touchent pas et ne se recoupent pas. Quel est le nombre s de sommets et le nombre a d'ar^ tes du solide obtenu? e 5 points

A. s = 24; a = 36 C. s = 10; a = 15 B. s = 36; a = 24 D. s = 24; a = 32 E. s = 36; a = 18.

477

22. On compte le nombre de points d'intersection de quatre droites distinctes. Quel est le nombre qu l'on est s^ r de ne pas trouver? 5 points u A. 0 B. 2 C. 3 D. 5 E. 6. 23. Combien y a-t-il de triangles, dont les c^ t
es ont pour mesures en o centim tres des nombres entiers, et dont le p
rim tre est egal a 15 cm? e e e
5 points A. 1 B. 5 C. 7 D. 19 E. 45. 24. Marine et Claire se partagent un c^ ne glac
e en le coupant a mio hauteur. Marine en a plus que Claire! 5 points

1 2 1 2

C. 3 fois plus

25. Nous sommes sur une ligne de m
etro circulaire. Vingt-quatre trains s'y d
placent dans la m^ me direction, a intervalles r
guliers et roulant e e e tous a la m^ me vitesse. Demain, on doit rajouter des trains a n de dimin e uer de 20 les intervalles entre deux trains. Combien y aura-t-il de trains suppl
mentaires demain sur la ligne? e 5 points A. 2 B. 3 C. 5 D. 6 E. 12. 26. Dans la gure ci-contre, AB est parallele^ a CD. De plus AD , DC , CB et AB = AC . Combien vaut l'angle D? 5 points

D ? A

A. 108 B. 120 C. 130 D. 150

478

27. Charles a attribu
e a tous ses livres un code de trois lettres, en util isant, l'ordre alphab
tique: AAA; AAB; AAC; : : : ; AAZ; ABA; ABB : : : e Charles a 2203 livres. Quel est le dernier code utilis
par Charles quand il a e cod
toute sa collection? e 5 points A. CFS B. CHT C. DGS D. DFT E. DGU . 28. Cinq personnes sont assises autour d'une table ronde. Chacune a rme a son tour: Mes deux voisins, de droite et de gauche, sont des menteurs". On sait que les menteurs mentent toujours et que quelqu'un qui n'est pas un menteur dit toujours la v
rit
. De plus tout le monde conna^t e e i la v
rit
en ce qui concerne ses deux voisins. Combien y a-t-il de menteurs e e a cette table? 5 points A. 2 B. 3 C. 4 D. 5 E. on ne peut pas la savoir. 29. On a coup
e quatre dr^ les de parts suivant les diagonales d'un dr^ le o o de g^ teau plat a quatre c^ t
s. J'ai mang
une part. Mes amis m
contents a oe e e ont pes
les trois restantes et ont trouv
120 g. 200 g. et 300 g. Combien e e pesait la part que j'ai mang
e? e 5 points

120

?

200

300

A. 120 g

B. 180 g

C. 280 g

D. 330 g

E. 500 g.

30. Dans la suite de chi res 122333444455555 : : : , chaque entier est ecrit autant de fois que sa valeur. Quel est le 1996e me chi re ecrit? 5 points A. 0 B. 3 C. 4 D. 5 E. 6.

479 Last issue we gave the problems of the Second Round of the Alberta High School Mathematics Competition, of February 11, 1997. The solutions we give were taken from the contest web site where more information about the contest and the solutions may be found. The solutions are selected from contestants' work. My thanks to E. Lewis, University of Alberta, Chair of the contest, for supplying us with materials.

http: www.math.ualberta.ca

~ahsmc

sample.htm

Second Round 1. Find all real numbers x satisfying jx , 7j jx + 2j + jx , 2j. Remark. Note that jaj is called the absolute value of the real number a. It has the same numerical value as a but is never negative. For example, j3:5j = 3:5 while j , 2j = 2. Of course, j0j = 0. Solution by Laura Harms, Lorne Jenken High School, Barrhead, Alberta. If x is in ,1; ,2, the inequality becomes 7 , x ,2 , x+2 , x which simpli es to x ,7. Hence all x in ,7; ,2 satisfy the inequality. If x is in ,2; 2 , then jx , 2j + jx + 2j = 4, while jx , 7j is never less than 5, so all x in ,2; 2 satisfy the inequality. If x is in 2; 7, then the inequality becomes 7 , x x , 2 + x + 2 which simpli es to x 7 . Hence all x in 2; 7 satisfy the inequality. 3 3 If x is in 7; 1, then x , 7 x , 2 x , 2 + x + 2, and the inequality is not satis ed. In summary, x satis es the inequality if and only if ,7 x 7=3. 2. Two lines b and c form a 60 angle at the point A, and B1 is a point on b. From B1 , draw a line perpendicular to the line b meeting the line c at the point C1 . From C1 draw a line perpendicular to c meeting the line b at B2 . Continue in this way obtaining points C2 , B3 , C3 , and so on. These points are the vertices of right triangles AB1 C1 ; AB2 C2 ; AB3 C3 ; : : : . If area AB1C1 = 1, nd Solution by Margaret Tong, James Fowler High School, Calgary, Alberta. Clearly, triangles ABn Cn are similar to each other. In a 30 ; 60 ; 90 triangle, the hypotenuse is twice as long as the shorter leg. Let AB1 = x. Then AC1 = 2x and AB2 = 4x. It follows that areaABn Cn = 16 areaABn,1Cn,1, so that the desired total area is given by T = 1 + 16 + 162 + + 161996. Multiplying this by 16, we have 16T =

area AB1C1 + area AB2 C2+ area AB3 C3+ + area AB1997C1997:

480

3. A and B are two points on the diameter MN of a semicircle. C , D, E and F are points on the semicircle such that CAM = EAN = DBM = FBN . Prove that CE = DF .

16 + 162 + 163 + + 161997. Subtraction yields 15T = 161997 , 1 so that 1 T = 15 161997 , 1.

Solution by Byung-Kyu Chun, Harry Ainlay High School, Edmonton, Alberta. Complete the circle. Extend EA to cut it at C 0 , and extend DB to cut it at F 0. By symmetry, AC = AC 0 so that mAC 0C = mACC 0. Similarly, mBF 0F = mBFF 0. Now mEC 0C = 180 , mCAC 0 = 180 , 2mCAM = 180 , 2mFBN = 180 , mFBF 0 = mDF 0F . Since the arcs CE and DF subtend equal angles at the circle, they have equal measure. It follows that the chords CE and DF are equal. E F D C

M C0

F0 4. a Suppose that p is an odd prime number and a and b are positive integers such that p4 divides a2 + b2 and p4 also divides aa + b2. Prove that p4 also divides aa + b. b Suppose that p is an odd prime number and a and b are positive integers such that p5 divides a2 + b2 and p5 also divides aa + b2 . Show by an example that p5 does not necessarily divide aa + b. Solution to part a by Byung-Kyu Chun, Harry Ainlay High School, Edmonton, Alberta. Note that aa+b2 = aa2 +b2 +2a2 b. Since p4 divides both aa+b2 and a2 + b2 , it must also divide 2a2 b. Since p is an odd prime, p4 divides a2 b. Suppose p2 does not divide a. Then the only powers of p that can possibly divide a2 are p or p2 . Since p4 divides a2 b, it follows that p2 must divide b. Hence p4 divides b2 . However, this contradicts p4 dividing a2 + b2 but not a2 . It follows2that we must have p2 dividing a. Then p4 divides a2 so that it also divides b . Hence p2 divides b, and it also divides a + b. It follows that

D0

481

Solutionto part b given by Byung-Kyu Chun, Harry Ainlay High School, Edmonton, Alberta; and by Jason Ding, Archbishop MacDonald High School, Edmonton, Alberta. We look for a, b and p such that p5 divides a2 + b2 , p2 divides a and b, 3 but p does not divide a + b. Setting a = p2 x and b = p2y , these conditions become p divides x2 + y 2 and p does not divide x + y . We can pick x = 2, y = 1 and p = 5. This gives a = 50 and b = 25 as an example 5. The picture shows seven houses represented by the dots, connected by six roads represented by the lines. Each road is exactly 1 kilometre long. You live in the house marked B . For each positive integer n, how many ways are there for you to run n kilometres if you start at B and you never run along only part of a road and turn around between houses? You have to use the roads, but you may use any road more than once, and you do not have to nish at B . For example, if n = 4, then three of the possibilities are: B to C to F to G to F ; B to A to B to C to B; and B to C to B to A to B.

D F

A

r

B

r

C

r

Solution by Byung-Kyu Chun, Harry Ainlay High School, Edmonton, Alberta. The number of ways to travel n = 1 kilometre is 2, the ways being B to A and B to C . For n = 2, we have 4 ways, B via A to B , B via C to B, B via C to D and B via C to F . Note that the answer is the same had we started at D or F . We guess that the number of ways for any n is exactly 2n . We now prove this by induction, in an unusual manner. We consider separately the cases n = 2k and n = 2k + 1. In the even case, the result is true for k = 0. Suppose that the number of ways for n = 2k , 1 is exactly 22k , 1. At this point, we must be at one of B , D, or F . As pointed out before, there are 4 ways to go another 2 kilometres. Hence, for n = 2k, the number of ways is 4 22k,1 = 22k . For n = 2k +1, we use the established fact that for n = 2k, the number of ways is exactly 22k . Again, after 2k kilometres, we must be at one of B , D, or F . In each2case, therekare two ways to go the extra kilometre, bringing the total to 2 2 k,1 = 22 +1 for n = 2k + 1. That completes the Skoliad Corner for this number. Please send me contest materials for use in the Skoliad as well as any comments or suggestions about what you would like to see featured here.

482

Mathematical Mayhem began in 1988 as a Mathematical Journal for and by High School and University Students. It continues, with the same emphasis, as an integral part of Crux Mathematicorum with Mathematical Mayhem. All material intended for inclusion in this section should be sent to the Mayhem Editor, Naoki Sato, Department of Mathematics, Yale University, PO Box 208283 Yale Station, New Haven, CT 06520 8283 USA. The electronic address is still mayhem@math.toronto.edu The Assistant Mayhem Editor is Cyrus Hsia University of Toronto. The rest of the sta consists of Richard Hoshino University of Waterloo, Wai Ling Yee University of Waterloo, and Adrian Chan Upper Canada College.

MATHEMATICAL MAYHEM

A Note on Convexity A function f is convex on I I an interval if f x + 1 , y f x + 1 , f y 8 x; y 2 I; 2 0; 1 ; and J convex on I see 1 if f x + y f x + f y 8 x; y 2 I: 2 2 Similarly, f is concave on I if f x + 1 , y f x + 1 , f y 8 x; y 2 I; 2 0; 1 ;

and J concave is de ned similarly. Several sources claim that J convexity is su cient for convexity see 2 , but we intend to make this more precise. First, f convex clearly implies that f is J convex. We will prove that: i If f is convex on an open interval I , then f is continuous on I , and ii If f is J convex and continuous on an interval I , then f is convex on I .

Proof. i Let a 2 I , 0. We will show that on some interval around a, f x f a + and f x f a , . Choose any b 2 I . Assume b a. Then the graph of f x on a; b lies under the chord joining a; f a and b;f b see Figure 1, which in turn lies under the line y = f a + on some interval to the right of a, including a. Applying a similar argument when b a, we nd an interval around a on which f x f a + .

483

y = f x

q

q

q

a; f a

a; f a Figure 1. b

Figure 2.

a b

Now, if f x f a for all x 2 I , then we are done, so assume f b f a for some b 2 I . Assume b a. Then f x f a for all x a by convexity, which certainly implies f x f a , . Take some c a, and consider the line joining c; f c and a; f a. Then the graph of f x to the right of a lies above this line, which in turn lies above the line y = f a , on some interval to the right of a, including a. The case b a is similar. ii Since f is J convex, it is clear that

f x + 1 , y x + 1 , f y

for = 0, 1, 1 , 1 , 3 , and by an induction argument, for any dyadic rational 2 4 4 m between 0 and 1; that is, a fraction of the form 2n . Since the dyadic rationals are dense in 0; 1 , we can nd a sequence which converges to any given real in 0; 1 . By taking a limit along this sequence, the identity is shown to be true for all 2 0; 1 . Remark. In i, I must be open, as seen in the example f x = 0 if 0 = x or 1 = 1 : 1 if x 0 x

Then f is convex, but not continuous. Hence, ii allows for an easy way to check convexity, which is useful for setting up Jensen's inequality, without resorting to the second derivative test if calculus does not appeal to you. Also, the corresponding results hold for f concave. Example 1. Show that sin x is concave on 0; . Proof.

so that

484

sin x + y sin x + sin y : 2 2

x + y
k xk + yk 2 2 for all x, y 0. The result is certainly true for k = 1. Assume it holds for some k. Assume without loss of generality that x y . Then xk , ykx , y = xk+1 , xk y , xy k + y k+1 0; so that xk y + xy k xk+1 + y k+1 . Then, x + y
k+1 = x + y
k x + y

Example 3. Let k be a positive integer. Show that xk is concave on 0; 1. Proof. We show by induction that

=

! xk + yk x + y

1. E. Lozansky and C. Rousseau, Winning Solutions, Springer-Verlag, New York, 1996. 2. D. S. Mitrinovi , Analytic Inequalities, Springer-Verlag, Berlin, 1970. c

References

485

Krishna Srinivasan

Let n circles of radius r be tangent to each other in a row, such that the centre of each lies on the x-axis, and the rst circle passes through the origin. Let l be the tangent of the nth circle passing through the origin, as shown in the diagram. What is the equation of this tangent l?

M O1

r

` x

O2

r

:::

On

r

Figure 1. Let On be the centre of the nth circle, M the point of tangency, and the angle formed between ` and the x-axis. Then the slope of ` is tan . Also, OMOn = 90 since the radius is perpendicular to the tangent. Theren fore, the value of is sin,1 MOn . Since the radius is r, MOn = r and OO OOn = 2nr,r. Consequently, the slope of the tangent is tansin,1 2n1,1 . Let us derive tansin,1 x, for 0 x 1. Let = sin,1 x. Then

p

Substituting x = 2n1,1 , we nd the value of the slope is And nally, since the tangent passes through the origin, the equation of ` is

2n , 1 , 1

2

= 2pn1 , n : 2

y = 2pnx , n : 2

1

It is interesting to note p the radius r does not appear in 1. This that shows that the line y = x=2 2 substituting n = 2 into 1, for example, is always tangent to the second circle, regardless of the radius. Ed: This makes sense geometrically. Why? Coordinatizing the plane, as we have done, can make a problem simpler, as the following problems show:

486

Problem: Circles P and Q are tangent; each has radius 1. PQ extended meets the circles at A and B , and AC and BTC are tangents to circle P , as shown in the diagram. Compute AC . 1993 ARML, Team Questions

T

q

Q

q

P

q

Solution: The slope of BC is 1=2 2, by 1. Hence, AC = AB=2p2 = p2. Problem: Three equal circles are tangent as shown. The line AD is drawn from point A on the left circle, and tangent to the circle at the right at point D. How long is the chord BC of the circle in the middle? 1996-1997 Scarborough Mathematics League

Figure 2.

D

q q

B

10

Figure 3.

Solution: Establish a coordinate system, as in Figure 1. As found above, the p equation of the tangent is y = x=2 6 and the equation of the second circle is x , 152 + y 2 = 25. Solving p these two equations gives the points for p p p6+4 72,8 6 6 6,4 of intersections, which are B 5 ; 5 and C 72+8 6 ; 6 5 . With 5 this information, the length of the chord BC can be calculated to 8 units. Ed: Knowing the slope of AD leads to a nice Euclidean solution. By secant theorem, AB AC = 10 20 = 200 and by similar triangles, AB + BC=2 = 6p6. Now nd BC .

487

Combinatorial Games

Adrian Chan

Introduction

De nition: One type of combinatorial game is a two-person game such that: i Players alternate removing counters from a nite collection according to a set of rules, and ii The last player to remove a counter wins.

The classic combinatorial game of this sort is Bouton's Nim or Nim. The game consists of some number of piles with some number of counters in each. A player, on his turn, may remove any number of counters from any one pile. Example: Say there are three piles of 1, 3, and 5 counters. The game could proceed as follows: 1 2 1 2 1 1; 3; 5 ! 1; 3; 2 ! 1; 1; 2 ! 1; 1; 0 ! 1; 0; 0 ! 0; 0; 0, and player 1 wins!

Let us look at a simple one pile game of Nim, with the restriction that a player may only remove one or two counters at a time. Consider the game where there are 7 counters to play with, denoted Nim7; 1; 2. First, try playing with a friend. You'll probably see a strategy for one of the players. The strategy can be developed by looking at the game in a di erent way. Construct a directed graph, where the vertices represent the number of counters, and the directed edges represent possible moves. Note that the graph has no cycles since positions cannot repeat. Hence, a game is represented by a path from the initial vertex 7 counters to the terminal vertex 0 counters. 7

- 5 - 4 - 2 - 1 P1 R P 1 R

PP

P R

PP q 3

PPPq 0 6

Figure 1.

488

Safe or Unsafe?

A vertex is safe if a player moving to that vertex has a winning strategy, and unsafe otherwise. We can label each vertex of our directed graph as safe or unsafe according to the following instructions: i The terminal position is safe, ii If all moves from a vertex lead to an unsafe vertex, then that vertex is safe, and iii If there is a move from a vertex to a safe vertex, then that vertex is unsafe. We can relabel our directed graph of Nim7; 1; 2 to get:

U

- U - U - U - U P1 R P 1 R

PP

P R

PP q S

PPPq S S

Figure 2.

1. A player starts on an unsafe vertex, and can move to a safe vertex iii. 2. The other player is forced to move to an unsafe vertex ii. 3. The original player can again move to a safe vertex iii. In fact, the original player can always move to a safe vertex, and after some number of moves, he will land on the terminal vertex. Since the terminal position is a safe vertex, the original player will win! Exercise: Who should win a similar Nim game with a pile of 11 counters? With 12 counters?

For any combinatorial game, we can label each vertex of the directed graph with a non-negative integer instead of the labels safe and unsafe. This number, the Grundy-Value, is found by the following process: i The terminal vertex is labelled 0. ii For every other vertex, consider the set of the labels of the vertices it points to. The label of the vertex is then the smallest non-negative integer not appearing in this set.

489

Example: Our game of Nim7; 1; 2 with Grundy-Values appears as

- 2 - 1 - 2 - 1 P1 R P 1 R

PP

P R

PP q 0

PPPq 0 0

Figure 3. Is it a coincidence that the safe positions coincide with those vertices assigned a Grundy-Value of 0? Let us investigate. Denote the sets of vertices with safe positions, unsafe positions, Grundy-Values of 0, and positive Grundy-Values as S , U , Z , and N respectively. Proposition. S = Z and U = N . Proof by Induction. The terminal position is in both S and Z by de nition. Assume that there exists some subset of vertices P in which the proposition is true; that is, for any vertex in P , it is in S if and only if it is in Z , and it is in U if and only if it is in N . Let us look at vertices that are not members of P . There exists a vertex not in P such that all of its emanating edges lead to a vertex in P to the reader: why?. Let this vertex be A, and consider all vertices that A leads to. If A leads to a vertex in P that is in S and so in Z , then A is unsafe so A is in U , and A leads to a vertex with Grundy-Value 0, so A itself must have positive Grundy-Value, and A is in N . Otherwise, A leads to vertices in P that are only in U and so in N , so A is safe and A is in S, and every vertex A leads to has a positive GrundyValue, so A itself has Grundy-Value 0 and A is in Z . Hence, the statement is true for P and A, a larger set of vertices. We can repeat the argument until we have included all vertices.

First consider a one-pile game of Nim, with no restrictions on how many counters are taken. Obviously, the rst person can take all the counters and win. If we compute the Grundy-Values for such a game, the GrundyValue of a pile of n counters is n. Now consider a game of Nim with two piles of counters. Say there are 6 in one and 7 in the other, denoted Nim6; 7. We can look at the game as a grid instead of a directed graph: You start with a marker at 6; 7 and a move is a translation going left or down, but not both. Whoever lands on 0; 0 wins. See Figure 4. Exercise: Fill the grid with Grundy-Values. Which positions are safe winning? Who will win, the rst player or the second player?

490

6; 7

0; 0

Figure 4.

De nition: The Nim Sum of a combinatorial game is the binary addition of the Grundy-Values of each independent game. However, there is the additional condition that there is no carrying. For example, the nim sum of 12 and 12 is 02 , and the nim sum of 11102 and 1012 is 10112. Example: Let us look at the game Nim4; 5; 6; 7. Notice that the game is the same as the simultaneous games of Nim4, Nim5, Nim6, and Nim7, where the player can choose which game to play in and make a move in. Grundy-Value Binary Representation Nim4 4 100 Nim5 5 101 Nim6 6 110 Nim7 7 111 Nim Sum 000 If the Nim Sum is 0, then the position is balanced. Otherwise, it is unbalanced. Problem: Prove that all balanced positions are safe positions. Hint: Look at the de nition of safe and unsafe positions. Exercise: Analyze Nimn; 1; 2; 3 and Nimn; 1; 3; 4. What are the GrundyValues? Does the rst or second player win? With this concept of the Nim Sum, you will be able to nd the strategy in any combinatorical game and determine if you will win or lose! The concept of Nim Sum is a very e ective tool not only in these games, but also other areas of mathematics.

491

Donny Cheung

The Art of Problem Solving: A Resource for the Mathematics Teacher, Edited by Alfred S. Posamentier, published by Corwin Press Inc., 2455 Teller Road, Thousand Oaks CA, 91320-2218, 1996, ISBN 0-8039-6362-9, softcover, 465 pages. The subtitle does not quite do this book justice. This wonderful collection of twenty independent contributions has brought together a diverse spectrum of professionals to cover a wide range of topics. The result is a problem solving resource which is both entertaining and informative. Having no singular theme other than problem solving in general, this book is ideal as an exposition of the many di erent aspects of problem solving. Unlike other books on problem solving, this book is not singularly interested in documenting individual problem solving techniques, teaching methods, or historical anecdotes. Rather, a good mixture has been obtained, and this is the strength of the book. The book begins with a chapter titled Strategies for Problem Exploration", which individually explores 13 powerful problem solving strategies. But also contained within the book are a chapter promoting the use of problem solving as a teaching paradigm, a chapter investigating the reasons that many students make the errors that they do, a chapter on cooperative learning, a chapter dedicated to the pigeonhole principle, and a chapter exploring mathematically gifted students from a psychological viewpoint. For the most part, this book is written in a conversational tone, and is very readable. There are problems scattered throughout the book, and there is a handy system of boxed and circled numerals which make it easy to nd speci c problems from a certain topic of mathematics, or speci c problems which highlight a certain problem solving technique. Perhaps this is not the ideal book for those looking for hundreds of problems to solve, but for anyone who is interested in problem solving in itself, and things related to problem solving, I highly recommend this book. Students! Get Ready for the Mathematics for SAT I, by Alfred S. Posamentier, published by Corwin Press Inc., 1996, ISBN 0-8039-6415-3, softcover, 206 pages. Teachers! Prepare Your Students for the Mathematics for SAT I, by Alfred S. Posamentier and Stephen Krulik, published by Corwin Press Inc., 1996, ISBN 0-8039-6416-1, softcover, 116 pages.

492 Each year, college-bound students around the world write the Scholastic Assessment Test, whose scores are used in college admissions, mostly in the United States. So for these students, preparing for this test is usually considered a very important task both in the classroom and in homes. To this end, there have been a great number of books which are aimed at helping students prepare for the SAT. The two books reviewed here are designed to help a student prepare for the Mathematics portion of the SAT, and to help a teacher prepare his or her students. Without an e ort on the part of the student, no book can help prepare anyone for the SAT. However, a well-designed book can certainly be helpful. This set of books is organized and well laid out. The book for students includes a very useful summary of basic mathematical facts, and includes both sample problems with in-depth solutions and timed sample tests for practice. Throughout the sample problems are also good tips for answering di erent types of questions that are asked on the SAT. The book for teachers details ten important problem solving strategies, with excellent illustrative problems and in-depth analyses of the problems. It also discusses some various more non-routine types of problems, and some more technical points about the test, such as e cient calculator use. And, it includes, as an appendix, the summary of mathematical facts that appears in the student's book. On the whole, I think that these books are worth looking into for anyone who is going to write the SAT, or has students who are going to.

493

1. Sum to k terms the series whose nth term is

n4 + 3n3 + 2n2 , 1 : n2 + n

2. Find all the functions of the form f x = ab+bx , where a and b are +x constants, f 2 = 2f 5, and f 0 + 3f ,2 = 0. 3. Solve for x and y :

2x 3y = 6 2x+1 = 5 3y,1

4. Perpendicular tangents are drawn to the circles represented by x2 + y2 = a2 and x2 + y2 = b2. Find the equation of the locus of the point of intersection of these tangents, and name the locus.

5. Prove that

sin x + sin y + sin z , sinx + y + z cos x + cos y + cos z + x + y + z cos x + y tan y + z tan z + x : = tan 2 2 2

6. A square sheet of tin, a inches on a side, is to be used to make an opentop box by cutting a small square of tin from each corner and bending up the sides. How large a square should be cut from each corner for the box to have as large a volume as possible?

494

Mayhem Problems

The Mayhem Problems editors are: Richard Hoshino Mayhem High School Problems Editor, Cyrus Hsia Mayhem Advanced Problems Editor, Ravi Vakil Mayhem Challenge Board Problems Editor. Note that all correspondence should be sent to the appropriate editor | see the relevant section. In this issue, you will nd only solutions | the next issue will feature only problems. We warmly welcome proposals for problems and solutions. With the new schedule of eight issues per year, we request that solutions from this issue be submitted by 1 February 1998, for publication in the issue 5 months ahead; that is, issue 4 of 1998. We also request that only students submit solutions see editorial 1997: 30 , but we will consider particularly elegant or insightful solutions from others. Since this rule is only being implemented now, you will see solutions from many people in the next few months, as we clear out the old problems from Mayhem.

Solutionby Miguel Carrion Alvarez, Universidad Complutense de Mad rid, Spain. Let a = x + 2, b = y + 2, and c = z + 2, so x, y , z 0. Then 36 + x + y + z , 8 2 + x2 + y2 + z + 2 + z implies that 18 + 3x + y + z , 8 8 + 4x + y + z + 2xy + yz + xz + xyz + 2 + z ; which implies that 10 + 3x + y + z 10 + 4x + y + z + 2xy + yz + xz + xyz + z ; which, in turn, imples that 0 x + y + 2z + 2xy + yz + xz + xyz ; and the last inequality is trivially true. H215. Consider a square EQUI . Let L, A, and T be points on the interior such that EQA and IEL are isoceles triangles with bases EQ and IE respectively. Show that UT = IL if EAL and ALT are equilateral triangles.

495 Solution.

A L T

I U We have the following facts: EA = AQ and EL = LI , since EAQ and ELI are isosceles triangles. Also, AL = LI and AT = TL = AL, since EAL and ALT are equilateral triangles. To show that UT = IL, we will show that 4ALI is congruent to 4ATU . Let = AEQ. Then LEI = , since 4AEQ 4LEI . Hence, = 90 = IEQ = 2 + LEA = 2 + 60 , so = 15 . Then ILA = 360 , ELA , ELI = 360 , 150 , 60 = 150 . Therefore, 4ALI 4ELI , and AI = EI = IU so AIU = EIU , = EIA = 90 , 30 = 60 . Therefore, 4AIU is equilateral, so AI = AU . Finally, 4ALI 4ATU since AL = AT , AI = AU , and LAI = = 60 , IAT = TAU . Hence, UT = IL as required. H216. Triangulate a square such that all edges of the triangles on the interior of the square are equal in length and this length is smaller than the length of the side of the square. Hint: See the previous problem H215. Solution. Consider the gure in the solution of problem H215. Extend EA through A to meet QU at R and extend EL through L to meet UI at S as shown. E Q A R L T I U S Now ER is the diameter of the circumcircle of 4ERQ since EQR = 90 . Further, A must be the centre of the circle since EA = AQ and A is on the diameter ER. Thus, AR = RE . Likewise, LS = LE in 4ESI .

496 Note that 4ERS is equilateral and SR = 2AL. Therefore, ST = TR and this value is equal to all the other lengths in the interior shown in the solution of problem H215. Rider. Are there other possible triangulations of the square with all the lengths in the interior equal?

Advanced Solutions

A191. Taken over all ordered partitions of n, show that
X k1k2 km = m2+ n , 1 : m,1

k1+k2 ++km =n

Additional Solution by Waldemar Pompe. Consider n soccer players. Let An; m be the number of ways they can be divided into m teams blocks such that in each team there is a goalkeeper indicated. A partition which has k1 , k2 , : : : , km players in the blocks gives k1 k2 km ways of choosing goal-keepers. Adding these products over all partitions gives An;m. On the other hand, An; m can be found as follows: Place m + n , 1 players in a row and choose 2m , 1 of them. Starting with the rst of these 2m , 1 players, we make every alternate player a goal-keeper resulting in m of them, and the remaining m , 1 are discarded, creating m , 1 gaps in our row of players. There are then m blocks, with a goal-keeper in each. It can be veri ed that there is a one to one correspondence between such formations and the formations above. Hence, the equality in question holds.

We begin with a couple of corrections. J. Chris Fisher of the University of Regina has kindly pointed out that the statement of problem C70 and hence the solution last issue is wrong. The problem was as follows: C70. Prove that the group of automorphisms of the dodecahedron is S5, the symmetric group on ve letters, and that the rotation group of the dodecahedron the subgroup of automorphisms preserving orientation is A5 . In fact, the group of automorphisms of the dodecahedron is A5 C2 , where C2 is the two-element group. The published proof showed that the rotation group was A5 , and then incorrectly described the rest of the problem as similar.

497 In fact, the isomorphism between the automorphism group of the dodecahedron and A5 C2 can be described explicitly: given a dodecahedron with edges numbered as described in the problem, any automorphism induces a permutation of the numbers which can be checked to be even and hence an element of A5 . Also, the map to C2 sends an automorphism to the identity if it is a rotation, and to the other element if it is not that is, if it is a re ection. The reverse map is similar: there is one rotation that permutes the 5 types of edge-labels in any even way, and one re ection. Chris suggests Coxeter's Introduction to Geometry especially p. 273 as a reference. One of the warning ags which tipped Chris o was that the erroneous proof implied that S5 is an isometry group of Euclidean threespace. Coxeter lists the possible nite isometry groups, and S5 does not appear and indeed S5 doesn't turn up as an isometry group until Euclidean four-space. Also, the gure accompanying the solution contained a typo: the 3" on the central line of symmetry should be a 1".

1 3 3 1 5 2 3 5 4 1 4 1 3 2 5 4 2 3 2 5 4 4

5 1 2

3 1

Thank you, Chris, for pointing out the error and explaining how to rectify it! And if any other reader is suspicious of anything written in these pages, please let us know. C71. Let L1, L2, L3, L4 be four general lines in the plane. Let pij be the intersection of lines Li and Lj . Prove that the circumcircles of the four triangles p12 p23p31 , p23 p34p42 , p34 p41p13 , p41p12 p24 are concurrent. Solution. For convenience, let C123, C234 , C341, and C412 be the circles. By symmetry, it su ces to show that the rst three are concurrent. This proof is slightly diagram-dependent, but it is short and sweet and geometric. Label the three angles as in the gure. By the exterior angle theorem, c = a + b. Let Q be the intersection of C234 with C341, other than p34. Then

498

L3 Q L4 P14 P24

r r

P23

L2

r

L1 C234

r

P13

r

P12

P34 C134

p13Qp23 =

Thus Q is on the circle C123 as well. Very rough sketch of another solution. This solution is intended to intrigue and entice the reader, rather than rigorously solve the problem. All statements made here can be made rigorous. This problem originally came to our attention because of a connection to a sophisticated result: Lemma. Let C be a degree d curve in the plane. Let A and B be degree e curves that each meet C at de distinct points say a1, : : : , ade and b1, : : : , bde respectively. Suppose that ai = bi for i = 1, : : : , de , 1. Then, if d 3, ade = bde; that is, the last points are also equal. Amazingly, this result fails if d is 1 or 2. The proof relies on the fact that there is no rational parametrization of curves of degree greater than 2, while a line such as x = 0 has the parametrization 0;t and a conic such as the circle x2 + y 2 = 1 has the parametrization

An even more sophisticated result: these deep facts are related to the fact that the diophantine equations x + y = z and x2 + y 2 = z 2 have lots of solutions in integers, while if n 2, xn + y n = z n has only a nite number of solutions even p x, y , and z are allowed to be quite general, for if example of the form r + s 2 where r and s are integers. This result, stated appropriately, is a consequence of Siegel's Theorem, and relates in an obvious way to Fermat's Last Theorem.

1 , t2 ; 2t : 1 + t2 1 + t2

499 Even the application of the lemma to this problem has some subtleties. As before, it su ces to show that C123, C234 , and C341 are concurrent. Let Q be the intersection of C234 and C341 other than p34 as before, and let P be the intersection of C123 and C234 other than p23. Let C be the cubic curve that is the union of C123 and L4 , A the cubic that is the union of C234 and L1 , and B the cubic that is the union of C341 and L2 . Then C and A intersect at the six points fp12; : : : ; p34 g, and at P . They also intersect at i two points at in nity 1 ; 0 and 1 ; ,i whatever that means!. The cubics 0 0 0 C and B intersect at the same nine points including the two strange ones!, except the P is replaced by Q. By the lemma, P = Q, and we are done. Of course, a lot of further explanation is required to even make sense of all this, but such explanation is beyond the scope of Mayhem. Comments.

1. This problem is a rst of an in nite sequence of theorems, called the Cli ord Theorems. Call the intersection of two lines in general position their Cli ord point. For three lines in general position, there are three Cli ord points of pairs of lines; call the circle through the three points the Cli ord circle of the three lines. Then, according to this problem, given four lines in general position, the four Cli ord circles of the four triples of lines are concurrent; call this point the Cli ord point of the four lines. In general, if n is odd, given n general lines, then the n Cli ord points of all n , 1-subsets of the n general lines are concyclic, and the resulting circle is called the Cli ord circle of the n general lines. Similarly, if n is even, given n general lines, then the n Cli ord circles of all n , 1subsets of the n general lines are concurrent, and the resulting point is called the Cli ord point of the n general lines. The theorems implicit in these de nitions are the Cli ord theorems. This theorem is discussed in Liang-shin Hahn's book Complex Numbers and Geometry published by the Mathematical Association of America. This is a wonderful, beautiful book, and possibly the best place to learn about how complex numbers can be used to make Euclidean plane geometry simple. Hahn proves all the Cli ord theorems in Section 2.3 using a simple lemma, which he proves using complex numbers, but which can also be proved with ordinary Euclidean geometry: Lemma. Suppose there are four circles C1 , C2 , C3 , and C4 in a plane. Let C1 and C2 intersect at z1 and w1 , C2 and C3 intersect at z2 and w2 , C3 and C4 intersect at z3 and w3 , C4 and C1 intersect at z4 and w4 . Then the points z1 , z2 , z3 , z4 are concyclic if and only if w1 , w2 , w3 , w4 are concyclic. If anyone has a slick proof of the Cli ord theorems or even the next case, we would be interested in seeing it. 2. What needs to be done to make the rst geometric proof rigorous? 1 0 3. Can you make sense of the weird points at in nity 1 ; 0 and 0 ; ,i described in the 0 i sketch of the second solution? In your way of making sense of them, can you see why they lie on every circle? 4. Without understanding the intricacies of the second sketch, can you use the sketch's lemma, with a little hand waving, to prove Hahn's lemma above? Can you use it to prove any other well-known results in Euclidean geometry? Pappus' theorem seems like a good possibility. If so, we would love to hear from you!

500

Problem proposals and solutions should be sent to Bruce Shawyer, Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, Newfoundland, Canada. A1C 5S7. Proposals should be accompanied by a solution, together with references and other insights which are likely to be of help to the editor. When a submission is submitted without a solution, the proposer must include su cient information on why a solution is likely. An asterisk ? after a number indicates that a problem was submitted without a solution. In particular, original problems are solicited. However, other interesting problems may also be acceptable provided that they are not too well known, and references are given as to their provenance. Ordinarily, if the originator of a problem can be located, it should not be submitted without the originator's permission. To facilitate their consideration, please send your proposals and solutions on signed and separate standard 8 1 "11" or A4 sheets of paper. 2 These may be typewritten or neatly hand-written, and should be mailed to the Editor-in-Chief, to arrive no later than 1 June 1998. They may also be sent by email to crux-editors@cms.math.ca. It would be appreciated if A email proposals and solutions were written in LTEX. Graphics les should be in epic format, or encapsulated postscript. Solutions received after the above date will also be considered if there is su cient time before the date of publication.

Where to send your solutions and proposals

PROBLEMS

There has been an increase in the number of solutions and proposals sent to the Canadian Mathematical Society's Head O ce in Ottawa, Ontario. Please note the instructions above and send them directly to the Editor-inChief.

There has been an increase in the number of solutions sent in by FAX, either to the Editor-in-Chief's departmental FAX machine in St. John's, Newfoundland, or to the Canadian Mathematical Society's FAX machine in Ottawa, Ontario. While we understand the reasons for solvers wishing to use this method, we have found many problems with it. The major one is that hand-written material is frequently transmitted very badly, and at times is almost impossible to read clearly. We have therefore adopted the policy that we will no longer accept submissions sent by FAX. We will, however, continue to accept submissions sent by email or regular mail. We do encourage email. Thank you for your cooperation.

501 Proposed by Victor Oxman, University of Haifa, Haifa, Israel. Let G denote the point of intersection of the medians, and I denote the point of intersection of the internal angle bisectors of a triangle. Using only an unmarked straightedge, construct H , the point of intersection of the altitudes. 2288. Proposed by Victor Oxman, University of Haifa, Haifa, Israel. In the plane are a circle without centre and ve points A, B , C , D, E, on it such that arc AB = arc BC and arc CD = arc DE. Using only an unmarked straightedge, construct the mid-point of arc AE . 2289?. Proposed by Clark Kimberling, Evansville, IN, USA. Use any sequence, fck g, of 0's and 1's to de ne a repetition-resistant sequence s = fsk g inductively as follows: 1. s1 = c1 , s2 = 1 , s1 ; 2. for n 2, let L = maxfi 1 : sm,i+2 ; : : : ; sm ; sm+1 = sn,i+2 ; : : : ; sn ; 0 for some m ng; L0 = maxfi 1 : sm,i+2 ; : : : ; sm ; sm+1 = sn,i+2 ; : : : ; sn ; 1 for some m ng: so that L is the maximal length of the tail-sequence of s1; s2 ; : : : ; sn ; 0 that already occurs in s1 ; s2 ; : : : ; sn , and similarly for L0 , and 8 0 if L L0 ; sn+1 = : 1 if L L00 ; cn if L = L :

For example, if ci = 0 for all i, then

2287.

s = 0; 1; 0; 0; 0; 1; 1; 0; 1; 0; 1; 1; 1; 0; 0; 1; 0; 0; 1; 1; 1; 1; 0; 1; 1; 0; 0; 0; 0; 0; 1; 0; 1; 0; : : :

Prove or disprove that s contains every binary word. 2290. Proposed by Panos E. Tsaoussoglou, Athens, Greece. For x; y;z 0, prove that

,

Proposed by K.R.S. Sastry, Dodballapur, India. Let a, b, c denote the side lengths of a Pythagorean triangle. Suppose that each side length is the sum of two positive integer squares. Prove that 360jabc.

2291.

502 Proposed by K.R.S. Sastry, Dodballapur, India. A convex quadrilateral Q has integer values for its angles, measured in degrees, and the size of one angle is equal to the product of the sizes of the other three. Show that Q is either a parallelogram or an isosceles trapezium. 2293. Proposed by Claus Mazanti Sorensen, student, Aarhus University, Aarhus, Denmark. A sequence, fxn g, of positive integers has the properties: 1. for all n

2292.

2294. Proposed by Zun Shan and Edward T.H. Wang, Wilfrid Laurier University, Waterloo, Ontario. For the annual Sino-Japanese Go" tournament, each country sends a team of seven players, Ci 's and Ji 's, respectively. All players of each country are of di erent ranks strengths, so that

C1 C2 : : : C7

and

1 X

J1 J2 : : : J7:

Each match is determined by one game only, with no tie. The winner then takes on the next higher ranked player of the opponent country. The tournament continues until all the seven players of one country are eliminated, and the other country is then declared the winner. For those who are not familiar with the ancient Chinese Chess" game of Go", a better and perhaps more descriptive translation would be the surrounding chess". a What is the total number of possible sequences of outcomes if each country sends in n players? b? What is the answer to the question in part a if there are three countries participating with n players each, and the rule of the tournament is modi ed as follows: The rst match is between the weakest players of two countries determined by lot, and the winner of each match then plays the weakest player of the third country who has not been eliminated if there are any left. The tournament continues until all the players of two countries are eliminated.

503 Proposed by D.J. Smeenk, Zaltbommel, the Netherlands. Find three positive integers a, b, c, in arithmetic progression with positive common di erence, such that a + b, b + c, c + a, are all perfect squares. 2296. Proposed by Vedula N. Murty, Andhra University, Visakhapatnam, India. x 2x2 for 0 x 1. Show that sin2 2 Hence or otherwise, deduce that

2295.

1+x

2297. Proposed by Bill Sands, University of Calgary, Calgary, Alberta. Given is a circle of radius 1, centred at the origin. Starting from the point P0 = ,1; ,1, draw an in nite polygonal path P0 P1 P2 P3 : : : going counterclockwise around the circle, where each Pi Pi+1 is a line segment tangent to the circle at a point Qi , such that jPi Qi j = 2jQi Pi+1 j. Does this path intersect the line y = x other than at the point ,1; 1? 2298. Proposed by Bill Sands, University of Calgary, Calgary, Alberta. The Tickle Me" Feather Company ships its feathers in boxes which cannot contain more than 1 kg of feathers each. The company has on hand a number of assorted feathers, each of which weighs at most one gram, and whose total weight is 1000001=1001 kg. Show that the company can ship all the feathers using only 1000 boxes. 2299. Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. Let x, y , z 0 be real numbers such that x + y + z = 1. Show that

1 , y1 , z
1,y1,z=x 256 : x 81 cyclic

Y

sin x x1 , x

4 for 0 x 1.

Determine the cases of equality. 2300. Proposed by Christopher J. Bradley, Clifton College, Bristol, UK. Suppose that ABC is a triangle with circumradius R. The circle passing through A and touching BC at its mid-point has radius R1 . De ne R2 and R3 similarly. Prove that

R2 + R2 + R2 27 R2 : 1 2 3 16

504

SOLUTIONS

No problem is ever permanently closed. The editor is always pleased to consider for publication new solutions or new insights on past problems. 2179?. 1996: 318 Proposed by Walther Janous, Ursulinengymnasium, Innsbruck, Austria. For real numbers a ,1, we consider the sequence

8

F a := :

Determine the sets D, respectively I , of all a, such that F a strictly decreases, respectively increases. Solution by Michael Lambrou, University of Crete, Crete, Greece. We show that the sequence F a is strictly increasing if and only if and strictly decreasing if and only if

p 1
nn+a ; n 1= : 1+ n ;

9

,1 a 1

where all logarithms here and below are natural logarithms. We approach this as follows. For a xed a, the sequence F a is strictly decreasing if and only if for all integers n 1 we have

Taking logarithms and squaring, this is equivalent since all quantities involved are positive to and so

"

p 1
n+1n+1+a 1+ n+1

2

p 1
nn+a : 1+

n

+2 n + 1n + 1 + a log n + 1 n

2 nn + a log n + 1 ; n

The quantity in square brackets on the left is negative, because the function

x + 1
2 f1x = x log x

1

x + 1 log x + 1 , 2 log x x x+