What is the largest multiple of l2
that can be written using each digit
4 1WoI of the4 numbers -3, 45 •- 2I ,
0, 3' I, S' and 2 are selected ran·
domly without replacement. What is the
probability that the numbers represent
the slopes of two perpendicular lines?
8 corner
A cube has pyramids cut from each
by passing planes through
9 What is the area of the region
bounded by the graphs of y =
the midpoints of the edges adjacent w
each vertex of the original cube. The
pyramids are discarded and a new solid
remains. How many
edges does the new
solid have? ~ contains the name. If we continue this
~ of times we would have oo cut the list
12 Chad spend 1* hours completing
a 75-item test. He spent twice as
13 How many 3-digit numbers are
there in which the sum of the
much time on each of the last 30 items as
he did on each of the first 45 items. How
many minutes did he spend on the last
30 questions?
2 3Inpoints
a trivia game, a player receives
for answering an easy
' - The square below is divided inoo
5 congruent rectangles. If the
0, I, 2, ... , 9 exactly once? question and 7 points for answering a
hard one. What is the largest integer that
cannot be a contestant's ootal score in
the game?
ITlilJ
perimeter of one of the rectangles is
30 units, how many units are in the
perimet.r of the square?
5 downward A square and a circle have the same 7 If you could say one number every
In the plane figure below, only
6 area.
®
motion (movement Find the ratio of the length of second, which of the following is the
leaving you relatively lower than where a diagonal of the square w the length of best estimate of how long it would take w
you were) is allowed. Find the ootal the radius of the circle. count wone trillion?
number of patlls from A ID B. A. 32 days
B. 32 years
C. 32 thousand years
D. 32 million years
II
We have 50,000 names arranged
1oo find0 onealphabetically in a list and need 11 Find the sum of the following
series:
- IX I + 4 andy = I x I - 4? oo update it. We try oo locate 1 l l 1
the name by cutting the list in half (as 2 + 4 + 8 + ... + 512
nearly as possible without splitting
names) and keeping the half that
process, what is the greatest number
in halr?
14 are
How many squares of all sizes
contained in the figure
15 Suppose the estimated 20-billion-
dollar cost oo send a person to the
digits is 24? below? planet Mars is shared equally by the
250 million people in the U.S. Then each
person's share is
A) $40 B) $50 C) $80
D) $100 E) $125
 If r~e bu.shc:. are .spaced about I The tlgure consists or alternating Maria buys computer disks at a Tne shaaed area formed by the
root apart, approxi mawly how light and dark squares. The price of 4 fo r $5 and sells them at two inwrsecting perpendicular
many bushes are needed t.o surround a
circular patio whose radius is 12 feet?
A) 12
D) 75
B) 38
E) 450
C) 48
number of dark squares exceeds the
number of light squares by
A) 7
D) 10
B) 8
E) 11
C) 9
a price of 3 for $5. How many computer
disks must she sell in order to make a
profit of SlOO?
A) 100
D) 2AO
B) 120
E) 1200
C) 200
A) 23 B) 38
C) 44 D) 46
E) unable to be

t~e
determined from
information
2
-IJ
rectangles, in square units, is

1-•oi.J
3

gtven

20 Placing no more than one X in

each small square, what is the
greatest numbr of Xs that can be put on
21 The perimeter of an equilateral
triangle exceeds that of a
square by 1989 em. The length of a side
22 In 8 ABC, L A = IOO~ L B
= ~ LC = 30°,AHisan 2 Mr. and Mrs. Zeta want to name
baby Zeta so that its monogram
altitude, and BM is a median. Then (first, middle, and last initials) will be in

§±]
the grid shown without getting three Xs of the triangle exceeds the length of a L MHC = alphabetical order with no letters
in a row vertically, horizontally, or sjde of the square by d em. The square A) 15° B) 22.5° repeated. How many such monograms
diagonally? has perimeter> 0. How many positive C) 30° D) 40 ° A
are possible?
A) 2 B) 3 C) 4
D) 5 E) 6
integers are not possible values ford?
A) 0 B) 9 C) 221 D) 663
E)45 " ~ A) 276 B) 300 C) 552 D) 600
E) 15 600
E) infinitely many 8 II C

Suppose 7 boys and 13 girls line

up in a row. LetS be the
number of places a boy and a girl stand
next to each other. fbr example, for the
row 0 8 8 GGGBG8 GGG8 0 8 GGBGG
we haveS = 12. The average value of S
(if all possible orders of these 20 people
are considered) is closest to
A) 9 B) lO C) 11 D) 12 E) 13
25 Thothpicks of equal length are
used to build a rectangular grid
26 A lattice point is a point in the
plane with integer coordi nates.
27 Thn points are marked on a
circle. How many distinct
as shown. If the grid is 20 toothpicks How many lattice points are on the line convex polygons of three or more sides
high and 10 toothpicks wide, then the segment whose endpoints are (3, 17) and can be drawn using some or all of the ten
number of toothpicks used is (48, 281)? (lnclude both endpoints of the points as vertices? (Polygons are distinct
A) 30
C) 410
B> 200
D) 420
:=ccJ:'r
.-!-!......!-!
20
segment in your count.)
A) 2 B) 4 C) 6 D) 16 E) 46
unless they have exactly the same
vertices.)
E)
430
i=i_i::::: i:i!
1+-10

2 One of Euler's conjectures was

disproved in the 1960s by three
29 Compute J(31)(30)(29)(28) + 1. 30 A rain gauge is shaped like a funnel. The top has a diameter
of 6" and the bottom of the funn el has a diameter of 2 inches
American mathematicians when they so that it fits into a cylindrical collector which has a diameter of
showed that there is a positive integer n 2 inches. The height of the collector is 20". How many inches from
such that the bottom of the collector should the mark measuring I" of rain
133·· + 110" + IW + 27~ = n~. be located?
Find the value of n.

2
 Ans we rs to Cale ndar

This mont h's problems 1- 14 and 30 are chosen from the 1988
MATHCOUNTS competitions. The 1989-90 registration deadline
will be 15 November. Requests for information should be sent to
MATHCOUNTS, 1420 King Street, Alexandria, VA 22314. There-
maining problems are from three of the American Mathematics
Competitions: 15-20 are from the Fourth Annual American Junior h\ C. 60 · 60 · 24 · 365 seconds
High School Mathematics Examination (AJHSME); 21- 26 are from \!._) in a year = 103 • 2 4 • 3 3 • 73.
t he Fortieth Annual American High School Mathematics Examina-
10 12 is one trillion.
tion CAHSME); a nd 27- 29 are from the Seventh Annual American
Invitational Mathematics Examination (AIM E). If you have not re- 1012
ceived an invitation to the a ppropriate AMC examination by 1 No- 24 .33 • 73
vember, write to Walter E. Mientka, AMC Executive Director , De- 29.59
part ment of Mathematics a nd Statistics, University of Nebraska, 24 • 33 • 73
Lincoln, NE 68588-0322. 25.59
= 33 .73
= 25 .59
CD 9 876 543 120. A multiple
of 12 must be divisible by 3
a nd by 4. Since 9 + 8 + 7 + 6 +
in twenty-eight ways, and three of
those pairs are negative recipro-
cals of one another. 1971 ==2000.
1971

5 + 4 + 3 + 2 + 1 = 45, the s um
is divisible by 3 a nd all digits Q-9
can be used. To be divisible by 4
® 11 or 11 paths
25. 59 25 . 59
2. 103 "" 24 • 53
"" 2. 56
the last two digits must be divisi- A
ble by 4. To get the largest multi- = 31250
ple start with the largest digits,
that is, 9, 8, 7, a nd so on.

® Twenty-four or twenty-four
edges. Three new ones a re
created at each of the original
eight vertices. The original t welve
~50 or 50 units. If sis the
a re destroyed by the cuts.
~ length of the side of the
squa re,
2
5 = 30•
2s + -s
® 32 or 32 square units.
Area = 112 product of t he
diagonals = l /2(8) (8). Alterna-
B tively, find the length of a side.
lOs + 2s = 150. From (4 , 0) to (0, 4) is \132.
12s = 150,
V32 . V32 = 32.
4s
s = 12.5,
= p = 50. ® ~ :lor~to1or----
~
1
y

{';\ 3 28. The s lopes of perpen-

\::!..J dicular lines a re negative
reciprocals of one another. Thus
- 3 and 1/3, - 514 and 4/5,
and - 1 2 and 2 a re such pairs.
The probability of choosing one of
those six values at first is 618.
Without replacement the cha nce of
choosing its negative reciprocal is
l 7.

§. ! = ~
8 7 28
Also, eaght numbers can be paired (Continued on page 441)

The Editorial Panel of the Mathematics Teacher is now considering sets of problems submitted by individuals,
classes of prospectiVe teachers, and mathemat1cs clubs for publication in the calendar during the 1991-92 aca-
demic year. Please write to the ed1tonal coordmator, 1906 A ssociation Drive, Reston, VA 22091, for guidelines.
Ttt•o other sources of problems in calendar form are available from NCTM: "Calendars for the Calculating" (a
set of nme monthly calendars that onginally appeared from September 1983 to May 1984; order number 344,
$5.75 } and -A }"ear of Mathemat1cs" (one annual calendar that ortgmally appeared in September 1982; order
number 311 , $2.50; set of five, order number 3 /2, $5.00). Individual members receive a 20 percent discount off
these prtces.

444 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Mathematics Teacher

 Answers to Calendar-Continued from page 444
@ smallest
1S or 1S times. Find the
power of 2 greater
contain eight more dark squares
than light squares.
0
'EJ-
D. Let x denote the length
of each s1de of the triangle
than 50 000. @ D. Since the computer
and y denote the length of each
side of the square. so that 3.r =
4y + 1989. Then 3d "' 3x - 3y
0

50 000 = z• 5$, dis ks are bought in groups

211 < 56 < 212, of 4 and sold in groups of 3, they y T 1989, so that d ~ y '3 + S63.
are easily considered in groups of Because y > 0, a value of d s SS3
so 12, or dozens. Each dozen costs $15 is impossible. However, y may
2 15 <50 ooo < 2 16 and sells for $20, giving a profit of take on any positive value, so all
SS. Thus to get a profit of S100. integral values (as well as many
~ 511/512. You may notice a she must sell 20 dozen , or 240 nonirttegral values) of d that ex-
\.!..JI pattern as you s um the computer disks. ceed SS3 are possible. Thus, only
terms 1. 2 . ... , 6S3 are excluded as inte-
gral values for d.
1 3 7 15 n - 1
2' 4'8' 1S' n 3
~ SO or 60 minutes. If x is
~ L Si~~-mLC = 30° and
\!.9 the time spent on one of the
'E5J AH .1 H C , m L CAH = so•
first forty-five questions, then and, in fact, MHC is a 30-S0-90
2 triangle. Hence, AH = ~ AC =
45x + 30(2x) = 105 minutes, AM. Thus, D. AHM is equilateral ,
m L AHM = so•, and m L MHC =
105x = 105 minutes,
go•- so• = 30•. Alternatively,
x = 1 minute. since M is the midpoint of hypote-
Each of the last ques tions took 2 ~ AC of right triangle AHC,
minutes, and the last thirty ques- MH and MC are radii of the cir-
tions would take SO minutes. cle circumscribing D. AHC. There-
3 fore MH = MC and m L MHC =
~ 10. lf two of the digit-s are mL C = 30°.
\.!_91 9s the smallest digit is S.
Thus only the numbers S99 and
above need to be considered: ~ B. Any two-element subset
S99,789, 798,879,888,
'E3J of the first twenty-five let-
ters of the alphabet in alphabetical
897,9S9,978,987,996 order together with Z will produce
a suitable monogram; furthermore,
~ 91. The figure contains one
2 all suitable monograms are of this
\..!.Y S x S square, four 5 x 5 form . The number of such two·ele-
squares, nine 4 x 4 squares, six- ment subsets is
teen 3 x 3 squares, twenty-five The total shaded area is the sum
2 x 2 squares, and thirty-six of the areas of the ''horizontal"
1 x 1 squares. rectangle and the "vertical" rect-

@c. The cost per person is

total cost
angle minus the area of the "over-
lapping" rectangle, that is, part of
both the other rectangles. Thus
Alternatively, the last initial is
fixed at Z. lf A is chosen for the
number of people the desired area is 2(10) + 3(8) - first initial , twenty-four choices
Thus 2{3) = 38. Alternatively, "slide" remain for the second. If B is cho-
the rectangles as shown in the sen , twenty-three choices remain,
$20 billion = 2 x 10 10 figure on the right so that they and so on. Therefore, by using
250 million 2.5 x 108 form an L-shaped figure. We see
= 0.8 X 102 that. the shaded area is {10)(2) + n(n + 1)
(S)(3) = 38 or (7)(2) + {8){3) = 38 1 T2 + .. · + n = ,
= $80. 2
or {10)(8) - {7)(S) = 38.
Alternatively, since the number of monograms is
1 000 000 000 = 4 ~E. The illustration shows
250 000 000 ' 'E::Jl that an arrangement of SXs 24 + 23 + 22 + . 0 0 + 1 = 24 25 0

is possible. lf the 3 x 3 board con- 2

the cost per person is ($4)(20). or
$80.
~he circumrer_ence of
@ D.the c1rcular patio IS
2'7T(12) .. (2)(3.14)(12) "" 75 feet.
Thus about 75 bushes would be
needed to surround lhe patio.
~B. Each row, including the
~I) first, contains one more dark
square than light square. Since
the figure has eight rows, it must
tained 7 Xs, then one row would
have to contain 3 Xs. = 300.
4 A. Suppose that John and
Carol are two of the people.
For i = 1, 2, ... , 19, let J , a nd C,
be the numbers of orderings out. of
all 20! in which the ith and
li - l)st persons are John and
Carol, or Carol and John, respec-
fContrnued on page 440J

September 1989 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 441

 Answe r s to Calendar-Continued from page 441
Lively. Then J, = C, = 18! is the
number of orderings of the remain-
ing persons. For i = 1, 2, ... , 19,
let N , be the number of times a
boy-girl or girl-boy pair occupies
positions ' and i + 1. Since 7 boys
and 13 girls are involved, N , =
7 · 13 · (J , + C,). Thus the average
value of Sis
N, + N2 + · · · + N 1g
20!
19(7. 13. (18! + 18!)) 91
= 20!
Alternalively, in general, suppose
= 10'
the problem involves k boys and
n - k girls. For 1 = 1, 2, ... , n - 1
let A, be the probability that a
boy-girl pair occurs in positions
li, 1 + 1) in the line. Since either
zero or one pair occurs in (i, i + 1),
A, is also the expected number of
pairs in these positions. By sym-
metry, all A,'s are the same (or
note that the subsequent
argument is independent of i).
Thus the answer is (n - 1)A ,. We
may consider the boys indistin-
guishable and likewise the girls.
(Why?) Then an order is just a se-
quence of k Bs and n - k Gs. To
have a pair at (i , i + 1) we must
have BG or GB in those positions,
and the remaining n - 2 positions
must have k - 1 boys and n - k -
1 girls. Thus
2 (n - 2)
k- 1
sequences have a pair at (i,
Since
i~ 1).
sequences are involved,
(n - 1)2(~ =~)
In
1)A ,- (~)
2k(n - k>
n = ((k2 -
In our example. the answer is
2·7·13 91
20 = 10'
~ E.
An m x n grid has m +
'E::!J 1 columns of vertical tooth-
pick , each n toothpicks long.
Thus, the arrangement has (m +
lin verucal tOOthpicks and (n •
1lm honzontal toothpicks. The to-
tal ts lm ... 1tn- In- 11m tooth-
ptck . In our example with m = 10
440 - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - Mathematics Teacher
and n = 20. the number of tooth-
picks is 11 · 20 + 21 · 10 = 430.
Alternatively, each of the 20 x 10
unit squares has four sides. Thus
the calculation 4 · (20 · 10) counts
each toothpick twice, except for
the 2 · (20 + 101 toothpicks on the
perimeter of the rectangle, which
are only counted once. Hence, the
number of toothpicks is
i (4. 20. 10 + 2(20 + 10)) = 430.
@ a. Since
281- 17 = 88
48 - 3 15'
the lattice point (x, y ) is on the
line segment if and only if x andy
are integers, 3 s x s 48, and
y = 17 + 88 (x - 3).
15
But y is an integer if and only
if x - 3 is a multiple of 15. (Why?>
The four lattice points are, there-
fore, (3. 17), (18, 105), (33, 1931,
and (48, 281).
A 968. For 3 s k s 10, each
'E!J choice of k points will yield
a convex polygon with k vertices.
Because k points can be chosen
from 10 in
ways, the answer to the problem is
(~0) e4o) + ... G~)
T +
_[(~0) + (\0) + ... + C~) J
-[(~0) + (\0) + (~0)]
= (1 + 1) 10 - (1 + 10 + 45)
= 968.
Query: Where have we used the
s tipulation that the polygons are
convex?
~ 144. It is clear that n :c:
'E3J 134. We can get an upper
bound on n by noting that
n6 - 1335 + 1105 + 846 + 27 6
< 1336 + 1105 + (27 + 84)6
< 3(133)6
< 3125 (13315
1024
= ( ~ tu33>
5 lector to nine inches from the bot-
.
Thus
n< (~)(133),
giving n s 166. Next note that
when an integer is raised to the
fifth power, its units digit is un-
changed. It follows that n has the
same units digit as the sum 133 +
110 + 84 + 27; that is, the units
digit of n is 4 , and n is one of the
four numbers 134, 144, 154, 164.
Since 133 • 1 (mod 3), 110 • 2
(mod 3), 84 s O (mod 3), and 27 a
0 (mod 3), we have
n 5 = 1335 + 1105 + 845 + 27 6
a 15 + 25 • 0 (mod 3).
This result means that n is a mul-
tiple of 3, and we conclude that
n = 144.
Note: Euler's original cof\iec-
ture was that for any integer n 2:
3, the equation
X~ + X~ + X~ + " ' + X~ - 1 = X~
has no nontrivial integral solu-
tions. The "spoilers of Euler" were
L. J . Lander, T. R. Parkin, and
J. L. Selfridge. Their work was
published in Mathematics of Com-
putation 21 (1967), 446-59. Re-
cently, N. D. Elkies, a USAMO
winner, showed that Euler's con·
jecture is also false for 11 = 4.
@ 869. The data
4 .3.2 .1+ 1 = 5 2 = (3 . 2 -
5. 4 .3 .2 + 1= 11 2
= (4 . 3 - 1)2
1)2
6. 5 . 4 . 3 + 1 = 192 = (5 . 4 - 1)2
suggest that Ck + 1)Ckl(k - 1)(k - 2)
+ 1 ~ [k(k - 1) - 1]2 = [(k2
1]2. The calculations
- k)-
(k + 1){k)(k - 1)(k - 2) + 1
= [(k + 1)(k- 2)][k(k- 1)] + 1
= (k 2 - k - 2)(k 2 - k) + 1
= (k 2 - k)2 - 2(k 2 - k) + 1
k) - 1)2
show that the foregoing is true.
Thus V(31)(30lC29l(28) + 1 =
302 - 30 - 1 = 869.
~ Nine or nine inches.
The
~ crossectional area for re-
ceiving rain at the top of the fun-
nel is 7T 32, or 97T. The
crossectional area at the bottom of
the collector is 1r 12 = 17T. Thus
one inch of rain would fill the col-
tom.