Crux v16n01 Jan
Crux v16n01 Jan
Mathematicorum
Published by the Canadian Mathematical Society.
http://crux.math.ca/
Problems 1501-1510 18
Solutions 1358-1392 20
Crux Cookies 32
GENERAL INFORMATION
Problem proposals, solutions and short notes intended for publication should
be sent to the Editor:
G.W. Sands
Department of Mathematics & Statistics
University of Calgary
Calgary, Alberta
Canada, T2N 1N4
SUBSCRIPTION INFORMATION
Crux is published monthly (except July and August). The 1989 subscription rate
for ten issues is $17.50 for members of the Canadian Mathematical Society and
$35.00 for non-members. Back issues; $3.50 each. Bound volumes with index:
volumes 1 & 2 (combined) and each of volumes 3, 4, 7, 8, 9 and 10: $10.00.
(Volumes 5 & 6 are out-of-print). All prices quoted are in Canadian dollars.
Cheques and money orders, payable to the CANADIAN MATHEMATICAL SOCIETY,
should be sent to the Managing Editor:
Graham P. Wright
Canadian Mathematical Society
577 King Edward
Ottawa, Ontario
Canada KIN 6N5
ACKNOWLEDGEMENT
cos A = * - + J :
2rs
tan 4 -
t d i l <rl —
s2 - 4R2 - 4Rr - r»
i s
^i- -H
where the sums are cyclic over the angles of the triangle. He asked if there were
similar formulae for N s*n ^ / 2 a n d / , c o s ^/2- All the solutions received were
very complicated, Murray Klamkin [3] pointed out that Anders Eager in [1] tacitly
implied that there were no known simple R - r ~ s representations for the following
symmetric triangle functions:
X s i n 1sin f' X
£ sin 4 , CSC Tf S y CSC -jy CSC -pr
(1)
cos cos cos
X 4> X 1 f ' X A
sec -K- ,
V
> sec
5
T sec
C
T
From the Law of Cosines, we can easily compute the cosines of the angles, finding
cos A = g sin A = -r
cos B = gg and sin 5 = TTF-
5 12
cos C = py sin (7 = jo •
From the half-angle formulae, we find that
. A 1 . 5 4 . ( 7 2
sm
sin Y - — ~<r = — s i n •*- = •
X . TJ-
sin A = — H1 . —4H , 2
which is irrational. This shows that N sinyl/2 cannot be a rational function of fZ,
r, and 5, for if it were, then in this particular case, its numerical value would be
rational (since Z£, r, and s are rational in this case), a contradiction. Similarly,
cos ;4/2 cannot be a rational function of Ry r, and 5, because that would be
i
contradicted by this particular case, in which
cos j - = — + — +
is also irrational. •
A similar calculation and argument shows that none of the expressions in
display (1) can be expressed as rational functions of R, r, and 5. In fact, the same
argument shows further than none of these expressions can be expressed as rational
functions of i2, r, s, a, 6, c, and if, where a, 6, and c are the lengths of the sides of
the triangle and K is its area.
In many cases, similar results can be shown using simpler examples. For
example, let raa, m\» rnc denote the lengths of the medians of a triangle. Using a
3-4-5 right triangle, I showed in [5] that there is no rational function, M, of a, 6,
and c such that each of raa, rab, mc can be expressed as rational functions of a, 6,
c, and JM.
- 3 -
As an exercise, the reader can prove that sin x/2 and cos x/2 can not be
expressed as rational functions of sin x and cos x. It is well known that tan x/2 can
be so expressed, namely
tan | = \ l i n x • .
2 1 + cos x
References:
[1] Anders Eager, A family of goniometric inequalities, Puhlikacije Elektrotehnickog
Fakulteta Univerziteia U Beogradu, Serija: Matematika i Fizika Nos. 338-352
(1971) 5-25.
[2] W.J. Blundon, Problem 652, Crux Mathematicorum 7 (1981) 179.
[3] M.S. Klamkin, Comment on Problem 652, Crux Mathematicorum 8 (1982) 189.
[4] D.S. Mitrinovic, J.E. Pecaric, and V. Volenec, Recent Advances in Geometric
Inequalities, Kluwer Academic Publishers, Boston, 1989.
[5] Stanley Rabinowitz, On the computer solution of symmetric homogeneous
triangle inequalities, Proceedings of the ACM-SIGSAM 1989 International
Symposium on Symbolic and Algebraic Computation (ISSAC J89), 272-286.
12 Vine Brook Road
Westford, MA 01886-4212
U.S.A.
Another year has passed and It is time to thank the readership for its
continued Interest and participation. One of the projects for this year will be to
present the results of the challenges thrown out in 1988 to fill in the gaps with
solutions to problems posed in the Corner. The response was very good and Pm
sure some of you are beginning to wonder what happened to the solutions you sent
me. But I also want to continue with solutions to more current problems so as to
ensure that our new solvers9 efforts are recognized. Beginning next month the
- 4 -
solutions will be split in two parts, "archival" and "current" problem solutions. I
would particularly like to thank those who have sent in problem sets, solutions, and
comments. Among those whose efforts have helped this column appear during the
year are Seung-Jin Bang, Francisco Bellot, Len Bos, Curtis Cooper, Nicos Diamantis,
George Evagelopoulos, Douglass L. Grant, the late J.T. Groenman, H.N. Gupta, R.K.
Guy, Denis Hanson, Walther Janous, Gy. Karoly, Murray S. Klamkin, Andy Liu,
Robert Lyness, Stewart Metchette, Dave McDonald, David Monk, John Morvay,
Gillian Nonay, Richard Nowakowski, J. Pataki, Bob Prielipp, M.A. Selby, Zun Shan,
Bruce Shawyer, Dimitris Vathis, and Edward T.H. Wang.
* * *
The problem sets that we present this month all come to us from Andy Liu,
The University of Alberta, who also translated the Chinese I.M.O. Selection Test
questions for us.
The next two sets were forwarded to Andy Liu by Professor Zun Shan from
Hefei in Anhtii province of the People's Republic of China.
We now continue with solutions for problems posed in the 1988 numbers of
the Corner. The first is a solution to a problem from the January number.
and
2# V (/iccos JB + /ibcos C)sin i4 = 2R V (sin B cos C + sin C cos 5)/i a
= 1R Y /lasin A
= Y afc„ = 6F ,
= 4 Sin2i4
P" X "5 •
It is a known result (see for example [1]) that for non-obtuse triangles
2 < Y sin2^ < | .
The upper bound is obtained only for the equilateral triangle and the lower bound
for right triangles. Thus for the non-obtuse case,
3 < F'/F < 4 .
Case (ii). For this case we have
2hh > 2R cos B and 2hc > 2R cos C .
To see this note that
2hh = 2c sin A = AR sin C sin A
= 2R cos(A - C) - 2R cos(^ + C)
> -2R cos(A + C) = 2iE cos 5
since cos(i4 - C) > 0. Similarly 2/ic > 2R cos (7 follows from cos(i4 - B) > 0.
Proceeding as before,
= 4 sin2A 5>
^ X "
Now ^4 > 90° and since 2^4 - B - C < 180°, A is also less than 120°. Here, due
to restrictions on the angles,
0 < F' jF < 3 .
The upper bound of 3, for example, corresponds to N sin 2 ^ < 2. To see the latter
inequality, we keep A fixed and minimize
cos 2B + cos 2C = 2 cos(7r - yl)cos((7 - 5).
This gives B = 0 and C = 7r - A These bounds are best possible since we can get
arbitrarily close to them by choosing triangles with angles (120 - 2e, 30 + e,
30° + e) for the lower bound and angles (90° + e, 2e, 90° - 3e) for the upper
bound. Note that for the case where the angles are (120°,30°,30°), F' - 0 since £ ' ,
C7, and H coincide.
Case (in). Here A - C > 90°, B - C > 90° so that J4 > 120° and
F* = [C"iL4'] + [4'tf£'] - [5'tfO] .
Proceeding as before we get the same expression except for a change of sign, i.e.
p- = 5- 4 Y sinM .
Hence
0 < F'/F < 5 .
Again these bounds are best possible since we can get arbitrarily close to them by
choosing triangles with angles (120° + 2e, 30° - e, 30° - e) for the lower bound and
- 9 -
Reference:
[1] O. Bottema et al, Geometric Inequalities, Wolters-Noordhoff, Groningen, 1969,
p. 18, #2.3.
= and
To see the claim, notice first that f!j) = (2) ° Ps* 1 ) " (2) =
* for
k > 0. Now assume that (zh° • -,^13) achieves the minimum. In this case each
Zi < 4, for if say z% > 5 then, as the remaining twelve terms sum to at most 44,
one must have Zj < 3 for some j . Decreasing Z( by 1 and augmenting zj by 1
would decrease the sum. Next we argue that in fact z* > 3 for all i Otherwise
suppose some Zi < 2. The remaining terms must sum to at least 47, but with the
observation above this gives z% = 2, eleven 4's and one 3, or z% - 1 and twelve 4's.
The values of the corresponding expressions are 70 and 72, respectively, which are
not the minimum. Consequently 3 < z\ < 4 for % = 1,2,...,13. The only possibility
J
Is to use three 3 s and ten 4's.
(ii) 13 • • • •
12 • • •
11 0 0 ® ®
10 • • • •
9 m m ® ®
8 • • ®
7 ® ® ®
6 @ • • ®
5 • G ® m
4 © ® ® ®
3 • • ®
2 ® • • Q
1 ® ® ® ®
1 2 3 4 5 6 7 8 9 10 11 12
The next solutions that we give are to problems posed in the March 1988
number of the Corner. The first are for the three problems from the Entrance
Examination of the Polytechnic of Athens (1962).
H)M<*<(-S)hS)
for all real x > 6. Then prove that
- 12 -
00
1 48
2 Y ^
£=6
CD
is equivalent to
„2 1 ^ J2 ^ J2 , X 575
4
^ 482
the first inequality is evident, and for x > 6 the second follows since
x 575 N> 1 _ 57J
575 . n
2 ?
48 " 48 :
Taking reciprocals
1 . 1 . 1
2
(x - l/2)(x + 1/2) > x > (x- 2S/48)(x + 25/48) "
Equivalently
1 1 . 1 . 1 1
2
x - 1/2 " x + 1/2 > i > x - 23/48 " x + 25/48 '
Now, summing all three quantities over all x > 6, the outside series telescope with
00
=
X (* - 23/48 " t + 25/48J j£™ (sM " N + S5/48J " SB5
i =6
As each inequality is strict,
00
2 1 48
^ V ->
> 2 >
IT 2*
i =6 T 565
Now we have
5
V i2 ~ 1.4636 , J J - 0.1818 and ^ - 0.1811
i=l
- 13 -
GO
This gives 1.6447 < V y 2 < 1.6454. Therefore, to three decimal places V ^2 is
1.645.
00
approximation.
^1 + ^2 = "I , ^1^2 = 1 -
In order to find which odd natural numbers n have the property that uj\ and
u/2 are roots of both f(x) and h(x), first observe that
fM = (wi + l) n - <A - 1 = M ) » - d\ - 1 = (-l)M11 - otf - 1
and
* M = (^1 + i)n"! - ^r1 = M) n " ! - ^r1 = (~i)nMn~2 - wr1.
Next distinguish the following cases for values of n:
(i) n = 6* + 1, *' e M. Then
f(ut) = -o;l 2fct2 - a;!**1 - 1 = -atf -• (* - 1 = -(atf + «i + 1) = 0,
& M = a>l2k- a;?* = 1 - 1 = 0.
(ii) n = 6k + 3, A e IN. Then
/(a/i) = -a;l 2fc+6 - a>!**3 - l = - l - l - l = - 3 # 0 ,
2 4 2
A M = a/1 ** - a/?** = <* --w? # 0 •
(iii) n = 6* + 5, fc e W. Then
/(a;!) = -wPfc*10 - a/?**5 - 1 = -u>x - atf - 1 = 05
- 14 -
The next solutions are from the 1986 Spanish Olympiad in Valladolid, Spain.
[Editofs note: At the bottom of the page of Bang's solution was a solution to
Kiirschak Competition problem 1983.1 [1988: 2] which should have been mentioned
among the alternate solutions found in [1989: 229]. My apologies.]
f(a2) - ai - a\ + a3 - ai ,
f(a$) = a3 - a\ + a% - a<i .
Now
&2 ~" Q>\ + ^3 ~ &i > &2 ~* &\ + &3 — ^2
and
a% — a\ + a% - a2 > ai - ^i + ^3 — #2 •
Thus the minimum occurs at £ = a*i and /(a2) = as - ai-
For n = 4,
/(ai) = a2 - ^i + as - ai + a4 - ai ,
/(a2) = a2 - ai + a3 - a2 + a4 - a2 ,
f(az) = a3 - a\ + a$ - a2 + a± - a3 ,
/(a4) = a4 — ai + a4 — a2 + a4 — a3 .
Now
/ ( a i ) > f(a2) = a4 - ai + a3 - a2
and
/ ( a 4 ) > /(a 3 ) = a4 - ai + a3 - a2 .
Hence the minimum occurs at x = a2 or x = as. Actually f(x) - a± - a\ + a$ - ai
for a2 < x < a3.
For n = 3,
a2 — ai + a3 — x , a\ < x < ai ,
! x - ai + a 3 - a2 , a2 < x < a3 ,
and for n = 4,
- 17 -
tan (A+J?] = _ a A _ b e t B
?
[ 2 ) a + b a + b
sin A + sin B 2R sin <A t a n i4 2iZ sin B t a n B
cos A + cos B " 2J? sin ,4 + 2R s i n 5 + 2i{ sin 4 + 2R s i n 5
sin A tan ^4 + sin B tan f? .
J
sin A + sin 5
sin2>l + 2 sin A sin £ + sin2B = sinM + cos A sin B tan 5
+ cos B sin J4 tan A + sin 2 B ,
o • >i • D cos A sin 2 J5 . c o s 5 s i n 2 i 4
2 on 4 sm B = c o s jj + — ^ 3 ,
sin2(,4 - J3) = 0 ,
It is known that triangles AGB, BGC, and CGA all have the same area, L,
say [see Theorem 23, p. 47 of Modern College Geometry, by Davis, Addison-Wesley,
Reading, MA, 1949]. Then 3L = K, the area of triangle ABC But as 6 divides K,
we have that L is a positive even integer.
* * *
PROBLEMS
Problem proposals and solutions should be sent to the editor, B. Sands,
Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta,
Canada, T2N 1N4- Proposals should, whenever possible, be accompanied by a
solution, references, and other insights which are likely to be of help to the editor.
An asterisk (*) after a number indicates a problem submitted without a solution.
Original problems are particularly sought. But other interesting problems may
also be acceptable provided 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 by somebody else without his or her permission.
- 19 -
SOLUTIONS
No problem is ever permanently closed. The editor will always be pleased to
consider for publication new solutions or new insights on past problems.
vertices of T.
is concave. (Indeed,
cos
y/(p) = y V ~ s i n V3 ?
V2
f»( n) = V s ^ n <p - 2<p cos y> + 2 sin y _. d(y)
and from
^'(vO = - <P2cos tp < 0
and rf(0) = 0 w e infer / ( p ) < 0 for 0 < tp < TT/2.) Thus
n n
1 /(v?i) n/ ,2
Xr =X
i=i 1=1
- { £=i
ft/ - = —sin -
?
Since the polygon contains 0, all <^i s are < TT/2. This and the concavity of /yield
(cf. [1], p.22)
n
X /(*»*) > /(I) +/(f) +(n-2)/(0) I + n- 2
7T
i= 1
[Editor's note: Other solvers noted that
( P i i V V , P > i ) « (5>J>0>"'#>0)
and applied the majorization inequality to obtain this last inequality.]
Reference:
[1] D.S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970.
Also solved (in the same way) by MURRAY S. KLAMKIN, University of
Alberta] MARGIN E. KUCZMA, Warszawa, Poland; COLIN SPRINGER, student,
University of Waterloo; and the proposer.
The given bounds are best possible, as is evident from the above proof The
proposer conjectures that if the inscribed polygon is not required to contain the centre,
- 23 -
Let d > 3 be a number that divides into a + 1; we show that d > 2 n+1 .
2n 2n
Since a is a perfect square, it is clear that 4 n does not divide into a + 1.
2
Therefore d has an odd prime divisor p, and a = - 1 mod p. Let ra be the
m
smallest natural number such that a = 1 mod p. Now
a = (a J E (-1) 2 = 1 mod p ,
so ro|2n+1. If m < 2 n + 1 write m = 2 k with Jfc < n. But then
1 = (a ) • • = a = - 1 mod p ,
a contradiction since p is odd. Thus m = 2 n+1 . But according to Fermat's small
theorem, ap'1 = 1 mod p, and therefore p - 1 > 2 n+1 , i.e.
d > p > 2nn + 1 ,
which is exactly what we set out to prove. As a byproduct we also get that
p = 1 mod 2 n+1 .
Also solved by ANDREW CHOW, student, Albert Campbell C.I., Scarborough,
Ontario; WALTHER JANOUS, Ursulinengymnasium, Innsbruck, Austria; MARGIN E.
KUCZMA, Warszawa, Poland; KEE-WAI LAU, Hong Kong; COLIN SPRINGER,
student, University of Waterloo; C WILDHAGEN, Breda, The Netherlands; and the
proposer.
* * *
1389. [1988: 269] Proposed by Derek Chang, California State University, Los
Angeles, and Raymond Killgrove, Indiana State University, Terre Haute.
Find
n
max 7 \i - 7r(i)| ,
ireSn ^
i =i
where Sn is the set of all permutations of {l,2,...,n}.
I. Solution by Friend H. Kierstead Jr., Cuyahoga Falb, Ohio.
Let
r(7r) = £ \i-m •
t =l
We will show that
max T(ir) = [jj-l , (1)
It is clear that this is the highest sum that can be obtained with these numbers,
since all of the larger numbers appear preceded by a plus sign whereas all of the
smaller numbers are preceded by a minus sign. [And the expansion of the sum T(TT)
for any % will always produce each of the numbers l,---,n twice, with n of these 2n
numbers preceded by a plus sign and n by a minus sign.] There are, of course,
other permutations that will produce the same sum. From (2) we obtain
- 26 -
\5[n + 5" + X
J " Zl1 +
2j =
2 ' n even
'
These two results may be replaced by a single expression by use of the floor function
as in (1).
II. Generalization by Murray S. Klamkin} University of Alberta.
Let ai,a2,...,on and &i,&2,—A be nonincreasing sequences; ci,C2,.-.,cn any
permutation of the 6 sequence; F(t) a convex function; and
n
5
i= 1
Then
max 5 = i^ai - bn) + F(a2 - 6n-i) + ••• + F(an - &i) ,
the maximum taken over all rearrangements ci,C2,...,cn.
To prove this we use the majorization inequality [1], [2], i.e. the conditions
X\ > X2 > • • • > En, t/i > T/2 > • ' ' > yn,
h h
2^ Xi > Y yi for k = l,2,...,n - 1,
i= 1 i= 1
and
n n
I** = X **
i= l i=l
are necessary and sufficient in order that for every convex Junction F,
n n
n = 2m + 1.
References:
[1] D.S. Mitrinovic, Analytic Inequalities, Springer-Verlag, Heidelberg, 1970.
[2] A.W. Marshall, I. Olkin, Inequalities: Theory of Majorization and its
Applications, Academic Press, N.Y., 1979.
Also solved by WALTHER J ANGUS, Ursulinengymnasium, Innsbruck, Austria;
MARGIN E. KUCZMA, Warszawa, Poland] KEE-WAI LAU, Hong Kong] COLIN
SPRINGER,, student, University of Waterloo] EDWARD T.H. WANG, Wilfrid Laurier
University] PAUL YIU, University of Hong Kong] and the proposers. Two farther
readers sent in the correct value for the maximum, one with no proof and one with
an incorrect proof
Janous, Lau, and Wang note that the proposal has appeared earlier in stronger
form as problem E2424 of the American Mathematical Monthly (co-proposed by
Wang, in fact), with solution in Vol. 81 (1974) 668-670. More recently a related
problem also appeared in the Monthly (E3175, solution in Vol 96 (1989) 59-60).
X 1
y = j-(h - x) [- 2-harmonic mean of x and h - a?].
First, P<? bisects zBPD, hence P # | | , 4 J B and so
\PQ-x = Area(PQM) = Area(P<?J9) = j P 5 - y . (1)
Other relevant identities are
PQ 2 - 0<?2 - OP 2 = (r - t/)2 - (r + x - /i)2 (2)
and
PB2 = MP 2 + <9£2 - OM2 = x2 + r2 - (A - r) 2 . (3)
Putting (2) and (3) into the square of (1) leads, after some manipulation, to the
quadratic equation
ay2 + Py + 7 = 0
where
a = h(2r - h) , /? = 2 r ^ , 7 = z 2 ^ - x)(h - x - 2r) .
The positive root is
y=^jl
(verification by substitution); the other root is negative since a > 0 and 7 < 0. (Of
course, these roots can be found without guessing, by the standard algorithm.)
[Editor's note: The editor apologizes for an unclear statement of the problem
(not in the proposer's original formulation), which misled two other readers into not
completely answering the problem. Namely, it should have been said that point M
lies on AB. L.J. HUT, Groningen, The Netherlands, and P. PENNING, Delft, The
Netherlands, both took M to be the centre of the circle I\ Hut ended up
maximizing the radius for points P on the diameter through C but outside CM, and
his result also appears to be interesting. Penning's solution (when properly
interpreted) is correct, and may be shorter than the one above. The editor invites
Hut and Penning, and other Crux readers, to find a "nice" algebraic, or perhaps
purely geometric, solution.]
Also solved by the proposer, whose proof {algebraic) also contained the lovely
"harmonic mean" relation given by Kuczma.
The problem was taken from the 1840 Japanese mathematics book Sanpo
Senmonsho.
which is the case t = - 1 . The rest follows by the general means inequality.
t > - 1 , t $ 0 we have M t > Af-i, i.e.
i/t
1 l 3r
3" 5 Pi 1
t =i t =i r
whence
> 3(3/4)V if * > 0 ,
3(3/4) V* if -1 < t< 0
i=l
For i < - 1 , Mt < M-i and so
- 31 -
.i-t
3r
JS>» r
i=l
thus
] £ pf > 3(3/4)V .
i=l
Done!
i4fao solved by L.J. HUT, Groningen, The Netherlands; T. SEIMIYA, Kawasaki,
Japan; and the proposer.
sin 0 = VL^l
(The other root is ignored because it would make sin 0 greater than 1.) Substituting
this result into (1) gives
- 32 -
l 3
Dm ft 3 • ^ ^ = 0.300283106-
It can easily be shown that d2D/d02 is negative throughout the region 0 < 0 < TT/2,
so this is indeed a maximum, not a minimum, [Editofs note: or just look at the
endpoints r -* 0, r -» ©.] The distance from A to the point where the arrow lands
is
x= 1- i i | ^ = sin 0 = ^ ^ = 0.618033988- - •
Also solved by HAYO AHLBURG, Benidorm, Spain; HANS ENGELHAUPT,
Gundelsheim, Federal Republic of Germany; RICHARD I. HESS, Rancho Pahs
Verdes, California; M.S. KLAMKIN, University of Alberta; J.A. MCCALLUM,
Medicine Hat, Alberta; P. PENNING, Delft, The Netherlands; and the proposer.
Not all solvers found simple expressions for the required distances. Ahlburg, on
the other hand} noted that) with
^ = 2 '
by2
the maximum falling distance is (f)' , the radius of the balloon when this occurs is
<p'l'2} and the distance from A to where the arrow hits the ground is </>~l: in his
words, "a delightful ubiquity of the Golden Section in such a simple figure".
CRUX COOKIES
Crux
Ttutter Speculating
nach altem Hausrezept
Zutaten: Weizenmehl, Zucker, Butterreinfett,
Vollei, Backtriebmittel, Farbstoff Beta-Carotin,
naturliches Aroma, Vanille
Mindestens haltbar bis Ende: siehe Clip
200 g
mmmmMm
A package bearing the above label arrived here over the Christmas holidays
from J. SUCK of Essen, and was speedily transformed into the empty set by the
editor and others. Sadly, all that remains for the Crux readership is the label. The
editor thanks Mr. Suck for his thoughtful and appropriate gift.
Hmmm. Does there perhaps exist an automobile manufacturer with a line of
Crux sports cars?
\ Canadian Mathematical Society 577 KING EDWARD, OTTAWA, ONT. CANADA KIN 6NS
o
TEL (613) 564 2223
^ Societe Mathe manque du Canada "
EDITORSHIP OF CRUX MATHEMATICORUM
CALL FOR NOMINATIONS
The Publication Committee of the Canadian Mathematical Society invites applications for
the editorship of Crux Mathematiconim for a five-year period commencing January 1, 1991.
An application should consist of a letter from the candidate which includes an expression
of views of Crux and indicates whether any changes in direction of policy are contemplated, a
curriculum Vltae and a letter of support from the head of the potential host department.
CRUX MATHEMATICORUM
APPELS AU1£ NOMINATIONS
Une mise en candidature devrait inclure une lettre du candidat (de la candidate) decrivant
sa vision de Crux et qui indique si des changements de direction ou de politiques sont envisages, un
curriculum vitae et une lettre d'appui du departement du candidat (de la candidate).
La date lirnite pour la reception des mises en candidature est le 30 aout 1990.
!!!!! BOUND VOLUMES !!!!!
1 & 2 (ensemble), 3, 7, 8, 9 et 10
Volumes: Adresse:
volumes X 10$ = $
PUBLICATIONS
Collected and edited by E.J. Barbeau, M.S. Klamkin and W.O.J. Moser.
Problems set in the first ten Olympiads (1969-1978) together with suggested
solutions. Edited by E.J. Barbeau and W.O.J. Moser. 89 pages ($5.00)