Professional Documents
Culture Documents
Greenblatt
Mathematical Entertainments
A Collection of Illuminating Puzzles,
New and Old
Established 1834
Copyright
1965 by M. H. Greenblatt
To my wife, Nora
Introduction
My reasons for writing this book may very well contain a clue for its understanding and enjoyment.
First, there are a great many beautiful and elegant
facts and proofs in mathematics, which are published in
widely varying places, if at all. I would like to shout
about these problems from the housetops, but have chosen
the more dignified, and probably more efficacious, method
of writing a book about them.
Second, many people consider mathematics to be a
very boring, complicated subject. I hope to show that
some facets of mathematics can be quite simple and interesting, although they are not obviously so at first
glance.
Third, some of the most beautiful solutions of problems, of which I, alas, am not the originator, do not
appear anywhere to the best of my knowledge. Many I am
familiar with due only to the tenacious memory and
varied experience of M. W. Green.*
All of the problems and notes in this book have, at
one time or another, interested me very much, and I
would like to think the reader also may be fascinated by
them.
Some people may find that many problems appear to
be missing. Undoubtedly the collection is incomplete, but
all the problems I know of, and consider clever in some
viii
Introduction
Contents
I: "Census-Taker" Problems
The Missionary and the 159-Link Chain, Restored Arithmetic Problems, Block Cut into
Cubes, Basketball Scores, The Incorrectly
Cashed Check, On Moving Day, Expression
for Which 2,592 Is a Solution, Railroad Trestle
Problem, Integral Pythagorean Triplets
3: Konigsberg Bridges, Design Tracing, and Euler 18
Story of Seven Bridges, Design Tracing, Parity
of Number of People Shaking Hands at a Conference, Euler's Formula
4: Bits and Pieces
25
Volume of an Anchor Ring, Topological Behavior of a Loop Around a Torus, Which Raise
Nets More Money? Stacking of Discs, Pecuix
Contents
Nm 3
metric Proof That ~
[N~ m J2 , A Peculiar
43
49
7: Partitioning Problems
61
8: Symmetry
71
Contents
xi
82
92
Divisibility by 2, 3, 5, 7, 9, 10, 11
11: Problems Which Seem to Have No Solution
99
106
Die Throwing, Bertrand's Box Paradox, Probability of Identical Pairs Among Cards, Probability of Same Birthday Among N People,
St. Petersburg Paradox
*. (Read It to Find Out)
114
115
xii
Contents
135
155
Mathematical Entertainments
1: "Census-Taker" Problems
"Census-Taker" Problems
nl
n2
na
Sum
nl
n2
na
1
1
1
1
1
1
1
1
1
1
1
1
1
2
1
2
3
4
6
8
9
12
16
18
24
27
36
1,296
3
4
6
8
9
12
18
2
3
3
3
3
3
3
3
3
4
4
4
4
4
6
6
6
6
8
9
9
24
3
4
6
8
9
12
16
18
4
6
9
12
18
6
8
9
12
9
9
12
27
144
108
72
54
48
36
27
24
81
54
36
2
2
2
2
2
1,298
651
436
329
223
171
154
121
98
91
79
76
73
328
221
168
116
91
83
68
56
2
2
648
432
324
216
162
144
108
81
72
54
48
36
324
216
162
108
81
72
54
36
Table 1
27
18
36
27
24
18
18
16
12
Sum
53
150
115
81
65
60
51
46
45
89
64
49
43
40
48
41
39
36
35
34
33
"CensusTaker" Problems
"CensusTaker" Problems
n2
na
Sum
nl
na
Sum
1
1
1
1
1
1
1
1
1
2
1
2
5
7
10
14
25
35
49
5
2,450
1,225
490
350
245
175
98
70
50
245
2,452
1,228
496
358
256
190
124
106
100
252
2
2
2
5
5
5
7
7
7
7
25
35
5
7
10
7
10
14
175
49
35
98
70
49
50
35
25
184
76
72
108
82
64
64
52
46
Table 2
"CensusTaker" Problems
Figure 1
n3
Sum
1
1
1
2
1
2
1,252
626
313
313
1,254
629
318
317
Table 3
When we inspect this table, we are tempted to exclaim, "Mon Dieu, has Greenblatt flipped or lost his
marbles? No two triads have the same sum!"
"Census-Taker" Problems
n2
na
Sum
nl
n2
na
Sum
1
1
1
1
1
1
1
2
1
2
4
5
8
10
16
2
320
160
80
64
40
32
20
80
322
163
85
70
49
43
37
84
2
2
2
2
4
4
4
5
4
5
8
10
4
5
8
8
40
32
20
16
20
16
10
8
46
39
30
28
28
25
22
21
Table 4
The fact that the colonel had to ask one more question
indicates that the three ages must have the same sum.
The triads 2, 10, 16, and 4, 4, 20 both have the same sum,
28. Since the colonel was able to choose between the triads
because the chief said none of them was older than he,
"CensusTaker" Problems
2: Diophantine-Type Problems
x = 2,
= 11, and z = 5
22
+ 112 = 53
which yields:
= 2,
= 2
+ 22
23
Diophantine.Type Problems
One of the simplest problems, which requires no mathematical analysis at all, is about a missionary who had a
gold chain with 159 links. He was captured by a group of
cannibals (as are most missionaries in mathematical problems), who stipulated that he could purchase one day of
freedom for each single additional link of the gold chain
that he gave them. They agreed to accept the principle
of "change-making" (i.e., he might give them a 7-link
section, if they had 6 links to give him in change). The
missionary's goldsmith charged an exorbitant rate for making each cut link whole again. What is the minimum
number of links that he had to cut in order to assure his
existence for 159 days (at which time he knew that he
would be rescued)?
The solution to this problem is simplified if we recognize that by cutting a single link, he could obtain two
smaller chains and a single cut link. By making only four
cuts, he produced small chains of length 5, 10, 20, 40,
and 80, and four single links. These enabled him to live
until the plane came.
10
Diophantine.Type Problems
Yxx
xx xx xx
xx
xx xx
x xx
x xx xx
x xx xx
Figure 2
Rectangular Block Cut into Unit Cubes
Diophantine.Type Problems
11
Now we can try various integers for a, b, and c. Suppose, for example, we arbitrarily choose a = 5. Then the
first fraction in parentheses is equal to 1. To get rid of
the 5 (so that we may ultimately obtain the fraction !)
we must choose for b a number which is 2 greater than a
multiple of 5. Twelve is one such number, but it is not
large enough, because the second parenthesis would be
H- (t) The first two fractions are now equal to 1 and t,
and the product is already equal to !, so that pair is not
allowable. Let us try b = 17. The fraction in the second
parenthesis is now it, and the total fraction so far is 197 '
still more than !. We must now try to multiply this fraction by a suitable (c - 2)/c so that the product will equal
!. Again, we see that c = 36 will have a very happy result
because (c - 2)/c = H and this fraction, multiplied by
ft, equals t or !. This method of solution is the best f hat
I can offer. These Diophantine problems do not haw the
12
Diophantine-Type Problems
same quality of generality that I try to stress in the succeeding chapters. I feel almost apologetic about including
them, but they are interesting. Perhaps some reader will
be able to furnish the generality that my exposition lacks.
Some additional values for a, b, and c are given in
table 5. There are about ten more solutions, and the reader
a
5
5
6
6
6
6
7
8
8
8
13
18
132
32
32
24
20
16
100
18
14
12
10
11
12
14
7
8
9
10
Table 5
DiophantineType Problems
13
14
DiophantineType Problems
+ +5 = 0
+5 = 0
+5 = 0
199r - 98(2r
x)
199r - 196r - 98x
3r - 98x
3r=98x-5
We know that r is a whole number less than 50. Therefore, the expression 98x - 5 (which is equal to 3r) must
be less than 150 and must be divisible evenly by 3.
If x were equal to 2, 98x - 5 would be greater than
150. If x were equal to 0, 98x - 5 would be negative-an
impossible solution. Therefore, x must be equal to 1.
Continuing:
3r = (98 X 1) - 5, or 93
r = 31, 8 then equals 63
The original check must have been for $31.63
On Moving Day
A friend of mine, while we were graduate students,
was quite a decent student, but was extremely absentminded. However, he wasn't quite as bad as the hero of
the following anecdote. A late, very well known physicist
was exceptionally brilliant in technical matters, but was
helpless when it came to matters concerning the running
of a house. So bad was this situation that his wife had to
run all household affairs. One day, they were going to
move into a new house. When he left for work that morning, his wife asked him to please remember to come home
to their new house, since no one would be home at the
old house. In order to have a story, he returned to the
old house, of course. He strode up to the front door, firmly
expecting to find it unlocked. When it refused to yield,
he was very puzzled. He went around to the side and
Diophantine.Type Problems
15
16
DiophantineType Problems
5V B
VT
-- = -
or
Diophantine-Type Problems
17
integers.)
The squares of two consecutive integers, nand n + 1,
differ by 2n + 1. If 2n + 1 is, itself, a square, we will
have the Pythagorean triplet V~n + 1, n, n + 1. For
example: if 2n + 1 = 25, then we would have the Pythagorean triplet 5, 12, 13 because the difference between 122
and 13 2 is 25. An infinite set of Pythagorean triplets can
be built up in this way.
An interesting problem can be mentioned here. I once
casually asked my children how many integral Pythagorean triangles they could name, in which one edge was
15 units long. The answer is that the 3, 4, 5 right triangle
can be multiplied by 3 to give a 9, 12, 15 right triangle,
and by 5 to give a 15, 20, 25 right triangle. Then, since
15 2 is 225, we can write: 225 = 112 + 113, and so 15, 112,
and 113 is such a triangle. By somewhat more exotic
methods, we discover that 8, 15, 17 is such a triplet. We
can multiply the 5, 12, 13 triangle by 3 to get 15, 36, 39.
The answer is that there are five such triplets.
If we choose any two numbers, u and v, then the
number u 2 - v 2 and the number 2uv form the two lower
numbers of a Pythagorean triplet. The other number is
u 2 + v2 The reason is that (u 2 - V 2)2 = u 4 - 2U 2V 2 + vt,
(2UV)2 = 4u2v 2, and the sum of these two is:
u 4
+ 2U2V 2 + v 4 =
(u2
+ V 2)2
In Germany, there is a town called Konigsberg, situated on the banks of the Pregel River. The island of
Kniephof is in the river, just below another island, and
both islands and the banks are connected by bridges as
shown in figure 3:
PREGEL RIVER
19
Figure 4
.--------------..;;;.0
20
(a)
(e)
(b)
Figure 5
(d)
21
.r. I
I ~~
..
Figure 6
~~II I~~
..
22
* M.
23
and the process must start with zero O's (an even number)
-the number of O's must remain even.
Euler's Formula
Another beautiful derivation by Euler relates the number of edges (k,), the number of countries (C), and the
number of vertices (V) in any map on a plane surface.
(The formula relating E, C, and V on the surface of a
sphere is almost identical.) This formula can be presented
in a very simple manner-a way which makes hardly any
mathematical demands beyond a keen interest. Consider
the map in figure 7a:
Figure 7a
Let us consider the area outside the group of countries, labeled g, to be an ocean. Each of the boundaries is
a dike, which prevents the country from being flooded.
Now break down the dikes systematically, so as to flood
each country, one at a time. But do not break any dikes
except to flood a new country. The unbroken dikes are
then all connected to each other. (For if two groups were
not so connected, then the last dike joining the two groups
should not have been broken, because there was water
on both sides, and no new country was flooded thereby.)
Figure 7b shows the same map as figure 7a, but dotted
lines indicate the dikes broken to flood each country. In
addition, a large dot is placed at each vertex where three
or more edges met.
24
,-- .
,
' - -
e _ - - - -____________________
Figure 7b
E=B+U=C+V-l
This is Euler's formula. On the surface of a sphere,
the same relation holds, except that C increases by one,
since g in figure 7a is another country. To account for
this, the formula changes to E = C + V - 2. This formula
forms the basis for a proof that there are no more than
five regular polyhedra (the so-called Platonic solids). It
is also used in a proof that five colors are sufficient (but
not that they are necessary) to color any map, so that
each country may be colored differently from countries
adjacent to it. It can still not be proved that four colors
are sufficient on a plane. (On the surface of a torus, or
doughnut, it can be proved that seven colors are both
necessary and sufficient.)
Figure 8
I+I--A
26
Figure 9
Q.E.D.
27
Figure 10
28
(A)
(0)
( C)
(F)
(E)
Figure 11
29
500
550
600
650
700
750
Table 6
$00 raise
each year
1,050
1,000
1,250
1,200
1,450
1,400
$3,750
$3,600
30
31
Figure 12
r(l
+ ! + I + t + ... + l/n)
32
of the decimal expansion of the fraction t, and the periodicity (6) is one less than the reciprocal of the fraction
itself (7). This means that the remainders, on performing
the required division, must have six different values. (If
the remainders were ever the same as a previous one, then
the repeating portion of the decimal would start right
there.) But since the repeating portion of the decimal has
a periodicity of 6, and each remainder must be less than
7 and cannot be 0, each number from 1 to 6 must occur
just once per cycle in the sequence of remainders. When
the remainder is 2, then the sequence of numbers in the
quotient is exactly the same as it would be if we were
expanding t. And similarly, when the remainder is 3, the
sequence must be the same as that for --. So the sequence
for an integral number of sevenths must be the same in
each case.
Seven happens to be the only single digit (not counting
2) whose reciprocal is a repeating decimal of periodicity
one less than the number. There are other numbers whose
reciprocal has a periodicity one less than the number itself,
but these numbers are large, and hence, the demonstrated
multiplication doesn't appear quite as startling. (17 and
19 are the next two such numbers.)
Hempel's Paradox
Part of the discipline, logic, represents classes of objects by suitable symbols. For example, the class A might
represent the class of all four-footed objects: chairs, tables,
dogs, etc. The logical statement that all A is B is equivalent to the statement that all not-B is not-A. This is not
very surprising if we let A represent the class of all normal
dogs, and let B represent the class of four-footed animals.
Then all A is B says that all normal dogs are four-footed
animals. And the phrase "all not-B is not-A" becomes
"All not-four-footed animals are not-normal dogs."
33
~m3 = [~m
34
~A
2 ~
28
3 A2
3 2C
3 82
r--4 A2
52
42
4 20
52
~
~
2
4B
52
52
52
1
Figure 13
All the squares fit together very nicely except for the
even squares along the diagonal. Squares 2! and 2i oyerlap
35
s = x:.:!'cP
For what values of x is S finite? People unfamiliar
with this problem are usually tempted to say that S
diverges for all values of x greater than one, and approaches
zero for all x less than 1. But such is not the case. It can
be shown easily, by means of a "log-log" slide rule, or by
36
.0001
.001
.01
.1
.3
.5
.7
.184
.22
.277
.40
.53
.641
.762
x
.9
1.0
1.1
1.2
1.3
1.4
1.445
.909
1.0
1.112
1.258
1.47
1.88
2.7183
Table 7
x-
1.1
1.2
1.3
1.4
s-
38.2
14.7
7.85
4.4
Table 8
37
Figure 14
38
Figure 15
This construction states that if two lines from a common point, PI, are intersected by a fan of lines from a
39
40
Figure 16
Figure 17
41
+ b)2 = 4(ab/2) + c
+ 2ab + b2 =
a 2 + b2 =
2ab
c2
+ c2
, 1 +z.+ -+,
~
~ +
e'=
2!
3.
'n
~ + ...
... +,
n.
42
2%
8%
4%
5%
1
2
4
1.02000
1.02010
1.02015
1.02020
1.03000
1.03023
1.03034
1.03045
1.04000
1.04040
1.04060
1.04081
1.05000
1.05063
1.05094
1.05127
00
Table 9
Bachet's weight problem asks what set of weights is required to weigh all integral values of pounds (i.e., 1, 2, 3,
etc.) up to 31, if the weights can be placed on one side of
the balance only. A simple extension asks for those weights
required to weigh from 1 to 40, if one is allowed to put
weights on either side of the balance. In the first case the
answer is the progression of powers of 2 (the binary sequence), namely, 1,2,4, and 8, etc., and in the second case,
a progression of powers of 3, namely, 1, 3, 9, and 27, etc.
Another modification asks what weights are required to
weigh up to 12 pounds, if one has a four-pan balance. The
pans are symmetrical on opposite sides of the fulcrum, and
the outer pans have twice the lever arm of the inner ones.
The answers in this case are 1 and 5. (The general term
is 3".)
Determination of Odd Coin Among Twelve Coins
44
45
S
S
S
S
D B
5 D B S
6 B S D
7 D B B
8
9
10
11
12
13
Table 10
B
B
D B
B D
S D D
D S D
D D S
46
1st weighing:
2nd weighing:
3rd weighing:
1,2,4,10
1,3,6,11
2,3,5, 12
5,7,11,12
4, 8, 10, 12
6,9,10,11
3, 6, 8, 9
2,5,7,9
1,4,7,8
Table 11
1st weighing
2nd weighing
3rd weighing
Left Pan
Right Pan
Not Used
1,2,4, 10, 13
1, 3, 6, 11, 13
2,3,5, 12, 13
3,6,8,9
2,5,7,9
1,4,7,8
Table 12
47
48
50
question, namely, how can one determine whether a number is prime. Fermat, as well as other number theorists,
was deeply concerned with this problem. The mathematicians of Fermat's time may have had a slight advantage because they apparently had wonderful ways of
recognizing prime numbers. Such recognition seems
uncanny today.
For example, Fermat was asked whether or not the
number 100,895,598,169 was prime. Fermat is said to have
answered instantly that the number is not prime, but that
it is the product of 898,423 and 112,303, and further that
both of these were prime.
The field of number theory interests not only the hard
core of number theorists, but also a soft outer shell of
gifted amateurs. Wilson was one such amateur. He derived
an expression for n which, if satisfied, is both necessary
and sufficient for n to be a prime number. Wilson's theorem
states that if (n - 1)!* + 1 is evenly divisible by n, then,
and only then, is n a prime number. This is certainly a
beautifully simple condition for necessity and sufficiency,
but the difficulty in calculating (n - I)!, even when n is
small, limits the usefulness of the theorem.
In order to understand the Fermat theorem with
which this chapter is concerned, we must become familiar
with two new notions. The first is the notion of modulus.
In using this concept, we say that two numbers are congruent modulo N if the remainders, upon dividing each
number by N, are equal. For example, 7 == 2 (mod 5)
[read: 7 is congruent to 2 (modulo 5)], or 11 == 2 (mod 3).
(This simply means that both 7 and 2, when divided by 5,
have the same remainder-2. Likewise, 11 and 2 when
divided by 3 both have a remainder of 2.) We use this
technique every day when we speak of the time of the day
or the day of the week, since we subconsciously subtract an
* (n
51
== 1 (mod 3) or a 2 == 1 (mod 3)
52
anIOn
(1)
(2)
aolO n+1
lOn+1 -
19
(3)
1)
052631578947368421
19)999999999999999999
95
49
38
119
114
59
57
29
19
109
95
149
133
169
152
179
171
89
76
139
133
69
57
129
114
159
152
79
76
39
38
19
19
o
Figure 18
53
54
xn
co
Bnxn
L
XL-=1
n=o(n + I)!
n=O n!
55
We now move on to the problem of the five shipwrecked sailors who collect a pile of coconuts and decide to
divide it the following day. In the middle of the night, one
of the sailors wakes up. To make sure he isn't cheated the
next day, he takes his fifth of the coconuts right then. He
counts them, and finding one too many for the total number to be divisible by five, throws it away, takes his share,
and goes back to sleep. Each of the others goes through the
same process, sequentially, of waking up, finding one too
many for the number to be divisible by five, throwing the
extra away, and taking his fifth. What is the smallest
number of coconuts that the original pile might have
contained? The modulus technique can be used to solve
this problem but it is fairly cumbersome. Actually, the
following solution, attributed to E. Fermi, * has more charm
and appeal.
This solution says minus four is surely a mathematical
solution, because each man, seeing minus four coconuts,
throws one away, leaving minus five, and takes his fifthleaving minus four again. To get a real and positive solution, however, we must add the smallest number divisible
by 5, 5 times, which is 55. So the answer is:
55 - 4 = 3,125 - 4 = 3,121
56
After throwing one away, and taking one nth, there are left:
n-1
- - [nn - n] = [(n - l)n(n-l) - (n - 1)]
And after the second person throws one away, and takes
an nth, there are left:
n-1
- - [(n - l)n(n-l) - n)]
= (n - 1)2n(n-2) - (n - 1)
57
3
25
253
3,121
46,651
2nd
person
leaves
3rd
person
leaves
4th
person
leaves
5th
person
leaves
6th
person
leaves
1
0
16
10
6
189
141
105
78
2,496
1,996 1,596
1,276 1,020
38,875 32,395 26,995 22,495 18,745 15,620
Table 13
a5
a Is Divisible by 30
58
a) =
a(a6
+ l)(a + 1)(a
2 -
+ l)(a -
1)(a 2
+ a + 1)
59
Qln
+R
1;
aS2
Q2n
R2;
aSt/>(n)
Qt/>(n)n
+ Rt/>(n)
(1)
There are cp(n) such equations because there are cp(n) different s's. The Q's above are not necessarily different from
each other. Some may even be zero. Each of the R's must
be prime to n. If this were not so, we could factor out the
common factor from it and n on the right, and either a or 8
would then have to be divisible by this factor of n. But
this is contrary to our assumptions. Each R must also be
different from any other R. For if any two R's-say, R"
and R1/ - were equal, we could subtract those two equations from each other and get:
as" - aS1/
(Q"n - Q1/n)
+ R", -
R1/
60
S2
S3
X ... X
sop(7o)] =
+ [R
Ln
R2
R3
X ... X
Rop(7O)]
1)[S1
S2
X ... X
sop(7o)] =
Ln
Since all the s's are prime to n, their product is also, and
it must then be aop(7O) - 1 which is divisible by n. Thus:
aop(n)
== 1 (mod n)
7: Partitioning Problems*
61
62
Partitioning Problems
(2)
Multiply by 6:
Subtract 7:
Subtract 7 X 11:
Multiply by 2:
Subtract 7 X 11:
(2
(12
(12
(5
(10
(3
X
X
X
X
X
X
11)
11)
11)
11)
11)
11)
- (3 X 7) = 1
- (18 X 7) = 6
- (19 X 7) = 6 - 7 = -1
- (8 X 7) = -1
- (16 X 7) = -2
- (5 X 7) = -2
Partitioning Problems
63
64
Partitioning Problems
(3
+4 =
7)
and that: (5 X 5) - (2 X 9) = 7
(5
+2=
7)
(3 X 9) - (4 X 5)
We can produce 7 units by filling either the 5-unit container, or the 9-unit container first. The total number of
operations in both cases will be:
(2 X 7) - 1 = 13
Additional problems of this sort can easily be devised.
Partitioning Problems
65
Pile of Bricks
7r - 60s = 1
66
Partitioning Problems
The milkmaid in the first problem had a fairly difficult assignment, but consider the plight of the maid in
the present problem. She is given a glass jar of irregular
cross section and of volume V, an earthenware jug of
volume somewhat greater than V, a marking pencil, an
infinite source of water, and a cap for the glass jar. She
is required to produce any rational fraction of the volume
V. (Most milkmaids would quit at this point.)
The solution consists of two parts. First, we show
how the volume V can be divided into halves, quarters,
eighths, etc., and then we show how any rational fraction
can be represented in binary form (i.e., how many halves,
quarters, eighths, etc., must be added to equal any given
fraction).
First, we put in an amount of water which we think
is V /2. Then, with the marking pencil, we put a mark
at that level of the liquid, put the cap on the jar, and turn
it upside down. If the jar was half full of liquid, the level
of the liquid will be exactly at the mark that we made.
Partitioning Problems
67
0.200
X2
@400 ...
~
@800 ...
X2
1600 ...
~
1200 ...
~
0400 ...
Figure 19
68
Partitioning Problems
Partitioning Problems
69
5 =
3 =
2
+3
(1 X 3) + 2
(1 X 2) + 1
(2 X 1) + 0
(11 X 5)
(3)
(4)
(5)
(6)
= (1 X 3) - (1 X 2)
(7)
2 = (1 X 5) - (1 X 3)
(8)
From (4):
= (1 X 3) - 1 (1 X 5 - 1 X 3)
=
(2 X 3) - (1 X 5)
(9)
70
Partitioning Problems
58 - (11 X 5)
(10)
8: Symmetry
Sam Loyd, who has been called America's Greatest Puzzlist, lived in the latter part of the nineteenth century and
the early part of the present century. He was a good chess
player in college, he later wrote a chess column for a New
York newspaper. He discovered that he also had a flair
for inventing puzzles and some of his puzzles are worldfamous. The 14-15 puzzle is a rather well-known example.
It consists of a square in which there are 15 smaller squares,
which can be moved around, and one empty square. The
15 squares are numbered 1 through 15. The question is
always to find whether or not the squares can be rearranged
in a desired order. So popular was this puzzle that people
neglected their regular duties to work on it. Shopkeepers
neglected their shops, and in France, the Legislature was
forced to ban the puzzle in order to get the legislators
back to work. Sam Loyd's life and puzzles have been
adequately described elsewhere. I include here Sam Loyd's
Daisy Puzzle because it is not well known.
Sam Loyd's Daisy Puzzle
72
Symmetry
person who picks the last petal wins. What is the proper
strategy for this game?
This game can be completely analyzed. The second
player can always win, and the proper strategy thus becomes a recipe-a straightforward procedure which guarantees a win. The first player must take either one or two
petals. The second player then takes two or one diametrically opposite. The first player then faces a daisy as is
shown in figure 20, regardless of his first move.
Figure 20
Symmetry
73
A problem which can generate violent arguments concerns the mixing of a cup of coffee and a cup of tea. We are
given a cup of coffee and a cup of tea, containing equal
volumes. We take a teaspoon of coffee, put it in the tea
cup, and stir thoroughly. Then we take a teaspoonful of
the mixture and put it back in the coffee cup. Does the
coffee now have more tea in it than the tea has coffee,
or vice versa?
An easy way to see that each cup of liquid is equally
adulterated with liquid from the other cup is to forget
about the details of the transfer, and consider only the
final situation.
We started with equal volumes of liquid in each cup,
and we ended with equal volumes in each. At the end,
there is a certain amount of tea in the coffee cup. It must
have replaced an equal volume of coffee, which was in the
coffee cup at the beginning. And that missing coffee must
now be in the tea cup.
74
Symmetry
IIIII
IIII
III
101
100
11
212
Figure 21
Symmetry
75
76
Symmetry
THESE GROUPS OF
I ARE PAIRED
2 GROUPS OF
8 EACH ARE
FIRST PAIRED
NO OTHER GROUP OF
4 TO MATCH THIS
SO WE MUST WORK
IN THIS GROUP
Figure 22a
Symmetry
77
1001
1000
10
11
2022
Figure 22b
78
Symmetry
The 21 Counters
Grundy's Game
Symmetry
79
80
Symmetry
Construction of a Cube
The new problem involves the assembly of twentyseven 1 X 2 X 4 bricks into a 6 X 6 X 6 cube. This problem was told to me by Gary Gordon of RCA-AE Division,
and was originally invented by Professor R. Milburn of
Tufts University. The question is simply: Can the 6-unit
cube be formed with these 27 bricks?
(6 X 6 X 6
216
27 X 8)
Symmetry
81
Figure 23
Eight 8's
8(8 X 8 + 8 X 8) - 8 - 8 - 8
[(8 + 8)8 -
+ : + 8)J 8
83
88 - 8)(8+8+ 8 )/8
( 8 + 8)(8+8+ 8 )/8
(=Mand8+-=M
_ 8 = M
8!
8(8 _ 8 +: + 8)
8'
8' - 8[(8 X 8 X 8) - 8] - 8 = M
8! [8(:8+_88)J - 8
can get:
-~) -
8r(8)
_ 8
8+8+8+8+8
r(8) - (8 X 8)(8.8
[logs 8 X 8][8 X 8 X 8 - 8] - 8
[log8x8x8x8x88]r(8) - 8
84
(n) ==
T
I(
T.
n~
) and get:
I
T.
[ef) -8]
8~ M
+8 -
1000
+ b)(e + d)
= ac
+ ad + be + bd
(1)
+ b)2 = a 2 + 2ab + b2
(2)
+ b)(a -
b) = a 2
b2
(3)
85
56
75 2 = 5,625
4 = 5,625 - 4 = 5,621
15+4=19;
35X55=1,925
in the sum
86
+ 4! =
22!i 35 X 65
2,275
+ 5) (lOb + 5)
lOOab
= 100ab
+ 50a + 50b + 25
100
+ """"2
(a + b) + 25 =
(
100 ab
+-b) + 25
+ a-2
+ a) + 25 =
100a(a
+ 1) + 25
87
+ 1 = 121
+4 =
+ 4 greater, e.g.:
144
+ n)2 = 25 2 + 50n + n 2
(25 - n)2 = 25 2 - 50n + n 2
(25
Difference
lOOn
88
+ 24)2
1,000 2 + (2 X 24 X 1,000)
= 10 6 + (48 X 103)
+ (24)2
+ (24)2
89
+ lOb + c
or
looa
+ lOb + c
+ lOb + a
or
l00c
+ lOb + a
+ (c -
a)
+ (c -
a)
lOO(a - c - 1)
+ 90 + (10 + c -
a)
(1)
+c -
+c -
a)
+ 90 + (a -
c - 1)
(2)
= (9 X 100)
+ 180 + 9 =
~)
+ (2 X 90)
1)
1,089
The multiplication theorem explains many simple socalled "magic tricks." It does not work, however, on a
trick which I once played on my younger daughter. I
asked her to think of a digit from 1 to 9. I then asked
her to open her mouth, and after examining the inside of
90
(digital) 1
(digital) 5
(product)
(digital) 7
+2+3+4 =
+6 +7 +8 =
10 -+ 1
26-+8
lX8=8
+0 +0+6+6+5 +2 =
26-+8
91
81nl~
+ 9n R2 + 9~Rl + RIR2
1
Divisibility by 2, 5, and 10
93
a-b+c-d+e
Simply stated, the remainder is the difference between the
sum of the digits in the odd places, starting from the right,
diminished by the sum of the digits in the even places. For
example, if 12,396 is divided by 11, the remainder is
(6 + 3 + 1) - (9 + 2) = 10 - 11 = -1, or 10, which
is the same thing. Only if the remainder is zero or divisible
by 11 is the original number evenly divisible by 11.
94
Divisibility by 7
+ (b X
10 4)
+ (c X
+ (d X
103)
10 2)
+ (e X
101)
+ (f X
1(0)
+ (b X
10 4)
+ (c X
+ (d X
103)
10
2)
+ (e X
101)
+ (f X
10)
is:
(a X 5)
+ (b
X 4)
+ (c X 6)
+ (d X
2)
+ (e X
3)
+ (f X
1)
+ (2 X
6)
+ (3 X
2)
+ (9 X
3)
+ (6 X
1) = 55
95
+ (2 X 3) + (3 X 9) + (1 X 6) = 34,
and the remainder of this is (3 X 3) + (4 X 1) = 13 or 6.
- (3 X 1) - (1 X 2)
o1 2
3 9 6
"--"" "--""
We then mUltiply by 2, 3, and 1 to get:
o3
2 6 27 6
"--"" "--""
The alternate sum in this case is simply the difference of
6 + 27 + 6 and 0 + 3 + 2 ~ 39 - 5 = 34.
The remainder of 34 is 0 9 4 ~ 13 ~ 0 3 3 ~ 6
"--""
"--""
Most people will agree that this is not a cute and elegant
method. But it works.
Any number of the form abcabc, where a, b, and care
any integers from 0 to 9, is divisible by 13. This statement
is sure to be greeted with skepticism by some people. Not
only, however, is it divisible by 13, but it is also divisible
by 7 and 11. It is most convenient to write out the complete expression for which abcabc is the abbreviation. The
complete expression is:
96
abcabc = a 105 + b 10 4
In this expression, we
finally arrive at:
abcabc
+ c 10 + a 10 + b 10 + c' 10
can factor out (10 + 1) and we
l00l(a10 2
+ b10 + c100)
1
The number 1001 has the prime factors 7,11, and 13. Since
1001 is a factor of the number, so are 7 and 11 and 13 and
any multiplicative combinations of these numbers. This
fact can be used in a great many different ways to form
interesting problems. We could, for example, ask a person
to write down a 3-digit number, and then to repeat those
same three digits to form a 6-digit number. Then, we look
at it and we can say, "Aha! This number is divisible by
143." (We know that 143 is the product of 11 and 13, but
we don't have to tell it to the victim.)
We could also look at the number and say, "Oh, that's
divisible by 77." The fact that 7 and 11 are known factors
and that the product 77 is, therefore, also a factor doesn't
have to be stressed. This idea is used by Martin Gardner
in his "Mathematical Games" column in SciP:ntific American magazine to describe an amusing parlor trick.
The "wizard" asks someone to write any 3-digit number on a piece of paper. Then, a second person is asked to
repeat the same 3 digits to form a 6-digit number, and to
divide that 6-digit number by 7. [We know that the remainder will be 0, but the mystery may be introduced by
noting the remainder (0) on a piece of paper and giving
it beforehand to another person to hold.] A third person is
asked to divide the second person's answer by 13, and to
note the remainder of that operation. And then, the first
person is asked to divide that second quotient by 11 and to
note that remainder in the same place. If this first person
reacts as most people do, he will be shocked to find that
the quotient he obtained is the 3-digit number he first
wrote down. The other two people will be surprised to a
97
98
which the digits from zero to nine are inserted. Since 135
is divisible by 9, the original number must be divisible
by 9. It will be noticed that the blank spaces occur with
Machiavellian regularity only in the second, fourth, sixth
places, etc. - always in the even places. We can thus determine that the sum of the digits in the odd places is 73, and
the sum of the digits in the even places is 17 plus the sum
from zero to nine, or 17 plus 45 = 62. Since the difference
between 62 and 73 is 11, the original number must be
divisible by 11, regardless of the order in which the digits
from zero to nine were inserted. The known factors are
thus 4,9, and 11, and the number is therefore divisible by
the product of these numbers, 396. The probability is thus
seen to be unity.
100
DISTANCE
HOME
TIME __
Figure 24
The Officer and His Column of Men
A column of soldiers is one mile long. The officer in
charge, standing at the rear of the column, gives the order
to advance. He starts to march in the same direction, but
at a faster speed. When he reaches the head of the column,
101
COLUMN
e..-
t=o
OFFICER
COLUMN
t =t,
OFFICER_e
COLUMN
t=t2
.... OFFICER
Figure 25
~=--+-Vo -
Vc
Vo
+ Vc
102
=Vo - +Vo-+-Ve
Ve
- Ve
Let us multiply by
Vo
and let d
= volve:
Vo
Vo
d=--+-Vo -
Ve
Vo
+ Ve
Ve
we get:
d=d-1+d+1
We recognize that d
officer walked:
(d 2
= [Vo
+ d + d2 -
Simplifying, we get d 2
d)1(d 2
1).
2d - 1 = 0
VS) 12 = 1 V2
The officer walked 1 + V2 miles.
d = (2
A master painter can put two coats of paint on a particular barn in one day. He normally paints one coat before
lunch and one coat after lunch. Each coat takes the same
length of time to apply. One day he hires an apprentice
two hours before lunch. He fires him after the first coat is
entirely applied. He then goes on to finish the barn himself,
observing the usual lunch time (he uses fast drying paint,
so that he can start the second coat immediately). One
hour before his usual quitting time, he notices that he has
applied the second coat everywhere except where the apprentice had painted in the morning. The apprentice
103
paints 200 square feet per day. What is the area of this
barn?
The area that the apprentice painted in the morning
must have been as much as the master painter could have
painted twice (two coats) in one hour. The master painter
would then have taken one half hour to paint this area
once. The master painter would have finished one coat on
the entire barn himself by lunch time. So he would have
painted everything except what the apprentice did by half
an hour before lunch. (The apprentice must, therefore,
have been fired half an hour before lunch.) In other words,
the apprentice took I! hours to paint what the master
painter could have done in ! hour. Since the apprentice
paints 200 square feet per day, the boss can paint 600
square feet per day j the area of the barn must be 300
square feet.
The Two Ferry Boats
--1=0
ITIME
BANK I
BANK 2
I~'------W------~'I
Figure 26
-1=12
104
Vl
720
w - 720
(1)
or:
V2
Vl
Vl~ =
~:
2w - 400
w + 400
2w - 400
(2)
w + 400
2w - 400
+ 400)(w -
720)
w = 1760 yards
Volume of a Modified Bowling Ball
105
Die Throwing
How many times, on the average, must one toss a sixsided die before every number from one to six comes up at
least once?
The solution to this problem is quite straightforward,
but perhaps it can be made even easier to accept if we consider a simpler version of the same problem first. Namely,
how many times, on the average, must a coin be flipped
before at least one head and one tail appear? We note
that the first throw must be either a head or a tail, and we
wish to know how many additional tosses are required, on
the average, before we get the other one. The probability
of getting the other one is t. If S represents the number of
successes and N the number of trials, probability can be
defined as the limiting value of the ratio SIN, as N tends
toward infinity. Or probability is SIN where S is the
average number of successes in N trials. In general,
p = SIN. In this problem, we want to know the average
number of tosses to get one success if the probability is t.
Since N = Sip, this number is II! = 2. Thus, the answer
to the simpler version is one (for the first toss) plus two (to
get the other one) equals three.
Returning to our original problem; on the first throw,
we'll get one of the six numbers, we don't care which one.
Having that one, the probability of getting a number
106
Probability Problems
107
+ t + -! + t + t + t
= 14.7
108
Probability Problems
Probability Problems
109
no
Probability Problems
Probability Problems
111
sible outcome times the gain for that event. In this case,
the probability of getting N successive heads and then a
tail is 1/2N +1, and the gain is 2N dollars.
Expectation
L probability X gain
2N
0>
L 2N+l =N-O
L -21
N=O
1
= -2
+ -2 + -2 + ... + -2 + ...
10
L -N X
N=o2 +l
2N
1
+N=1l2
L -N
+
0>
1
X 210 = 5 2
+ -21 =
and this says that the fair price for each game would be
six dollars. (This is quite a bit more reasonable than an
112
Probability Problems
"'N
1 2
L-N
Probability Problems
2 + 4 + 8 + 16 + 32 + ... + 2N + ...
1
8+ 16 + 32 + ... + 2N + ...
1
16
4 + 8+ 16 + 32 + ... + 2N + ...
1
+ 32 + ... + 2N + ... = 8
111
32 + ... + 2N + ... = 16
113
116
Humor in Mathematics
Humor in Mathematics
117
22 = 11
+ 11,
24 = 7 + 17, etc.
118
Humor in Mathematics
p. 397, Problem 8.
Humor in Mathematics
119
10, 15 ...
120
Humor in Mathematics
take place, but which does not take part in that reaction.
It is not always easy to give an example of a catalyst. I
have long been fond of the following illustration:
A wealthy Arab died, and his will stipulated that one
half of all his horses should go to his oldest son, one third
of his horses to his middle son, and one ninth to his youngest son. At the time of his death, the Arab owned seventeen
horses, and the sons sorely lamented the thought of carving
up some of these fine Arab steeds to comply with their
father's will. As they were bewailing their plight, an
itinerant Arab with a seedy old nag chanced by, and he
offered the following suggestion:
"Look, boys," he said, "let's put my horse in with
your father's seventeen. Then we have eighteen. You, son
number one, are to get one half of the horses; that is nine.
And you, son number two, are to get one third of the
eighteen-or six horses. And you, son number three, are to
get one ninth, or two. That's a grand total of seventeen,
and one is left over. And that's mine. So long, boysl"
The Arab's horse was a catalyst.
Humor in Mathematics
121
122
Humor in Mathematics
Humor in Mathematics
123
Experimental Determination of Pi
all primes
ex>
_a
1- P
= L--;
1
124
Humor in Mathematics
2l
1I"L
Humor in Mathematics
125
Bay-tuh) to join them as an author. The article, accordingly, appeared in the Physical Review letters, * entitled
"On the Abundance of the Elements" by Alpher, Bethe, and
Gamow. It seems peculiarly fitting that the origin of the
elements should be described by three men whose names
are the same as the beginning of the Greek alphabet.
Thus:
This leads to:
2 -
- 1
1= 0
= 1.61803398 ...
To illustrate some of the properties of "ubiquitousness," is the ratio between any line segment in a five
pointed star, and the next smaller segment in that figure.
Picture frames, playing cards, and other rectangles we
encounter seem to have a propensity for having their sides
in the ratio (i.e., they are Golden Rectangles).
One of the wildest attempts to show the ever-present
nature of was performed by F. A. Lonc, of N ew York. He
measured the heights of sixty-five women, and the heights
of their navels. (Why did he choose only women?) He reported that the average of a woman's height divided by
the height of her navel was equal to 1.618. It is said that
those women whose measurements were not close to this
ratio testified to hip injuries or other deformities.
126
Humor in Mathematics
;2)
~p~e8( 1 -
-- = 1 + x
I-x
Humor in Mathematics
127
ex>
1 - p-2
This last sum is the Zeta (r) function, and r(2) is known
to be 7r 2/6. The probability that two random numbers are
relatively prime is the reciprocal of this, namely 6/7r 2 If,
instead of expanding the infinite product II[1/(1 - p-2)]
we expand the product II[1/(1 - p-.)] then all our arguments could be modified slightly, and we would come out
with the result that:
all primes
1 - P-'
= r(s) =
ex>
n'
L-
129
I
--.&
-"
'9
:
A
TO INFINITY
ON ALL SIDES
,&
.....
.&
.&
Figure 27
130
d
(a)
( b)
Figure 28
131
132
(0)
(b)
Figure 29
133
Figure 30
Figure 31
134
A Computer Correlation
136
137
A young man has two girl friends who live in diametrically opposite directions from his house, and whom
he normally sees about an equal number of times each
month. The trolley line which goes to both of their houses
pa.'lses in front of his house. Since he has an equal regard
for both of them, he decides to leave his house at completely random times, and to take the first trolley that
comes along. In this way, he thinks he will continue to see
each of them an approximately equal number of times,
since the trolleys go in each direction with the same regularity. He follows this regime for a few months and, much
to his consternation, he finds that the laws of probability
are apparently being violated. He has gone to see one girl
friend five times as often as he has gone to see the other!
How can this be?
138
In order to see how the laws of probability can apparently be violated, it is convenient to picture the track
along which the trolleys run, as is shown in figure 32a;
CAR BARN
I
I
I
I
Figure 32a
The trolleys run with perfect regularity in both directions, and because of this, there will be certain placeR
where two cars going in opposite directions always pass
each other. These are at points marked A and B. Assume
further, that the young man lives at the point marked x,
which is 1 minute from B, and 11 minutes from A. We
start our observation at the moment when the cars pass
each other, and if the man appears at x within the next
minute, he will meet a car going from B to A. If he appears
during the next 10 minutes after that, he will have missed
the car going from B to A, but will be in time for the car
going from A to B. One minute after the car from A passes
x, it will have reached B; the cycle will start over again.
If the man appears during this last minute, he will have
missed the car from A to B, but can wait for the next car
from B to A. Table 14 shows the situation during the
entire cycle;
Time
Situation
0-1 min.
1-11 min.
11-12 min.
Table 14
139
Thus, the next car will come from B only during two
minutes of each cycle_ But during ten minutes of the cycle,
the next car will be from A. If the man comes out at random times, he is five times more likely to go toward B than
he is to go toward A.
Napoleon's Problem
Figure 32b
140
+ EG2 =
EG
(2r)2
= 4r2
= AB V3 = r V3
141
-A
--~
I
\
, "'" -
/
./
Figure 33
142
Figure 34
The line AB is indicated by the dotted line in figure
34, and the circle of radius r is centered at A. With arbitrary radius BC, arc CD is drawn centered at B. The
problem is to bisect arc CD. Arc AE is drawn centered at
C with radius r, and arc AF is centered at D with the same
radius. Length CD is measured on arcs AE and AF,
defining points G and H. Line AG is parallel to CD as is
AH, because both AGCD and AlIDC are parallelograms.
Arcs DP, centered at G, and CP, centered at H, are drawn,
intersecting at P. Length GD is the hypotenuse of a right
triangle whose base is I CD and whose altitude is
yr2-
(CDj2)2
yr
2 -
+ 2(CD)2
y(GD)2 - (AU)2 =
(CD)2
143
vr2
_--
--
c
A
0--
c'
----~~............
~E
I
I
I
~
B
....
Figure 35
Points C' and D' are the images of C and D in line AB.
Point E is now constructed to be the fourth point in parallelogram CC'D'E. Since CC'is perpendicular to AB, D'E
is also. And since DD' is also perpendicular to AB, ED'D
must be a straight line. In triangle DCE, DX/DC =
DD'/DE. The length DX is the only unknown in this
equation. It is called the fourth proportional. It can be
constructed as shown in figure 36.
The circles of radius DD' and DE (both known) are
drawn with the same center. At an arbitrary point P on
the smaller circle, the arc RS is drawn with radius DC. The
arc TU is drawn about S with the same radius DC. The
length RT is the fourth proportional, i.e., is the length
DX which we sought to construct. This is so because
LROT = LPOS (LPOR = LSOT and LROS is
added to both of them). Chords PS and RT subtend
the same size angle at the center and they are, therefore,
proportional to the radii of their circles. Having length DX,
144
Figure 36
145
146
Perfect numbers are those for which the sum of all the
divisors of the number (including one, but excluding the
number itself) is equal to that number. Thus, 6 is perfect
because its factors, 1,2, and 3, have the sum 6. The factors
of 28, 1, 2,4, 7, and 14, have the sum 28, and so 28 is also
perfect. Perfect numbers are very well understood, and
there is a formula 2n - 1 (2n - 1) where (2n - 1) is prime for
all the perfect numbers known so far. (A tantalizing question is, "Are there any odd perfect numbers?")
Deficient numbers are those in which the sum of the
divisors is less than the number itself, and abundant numbers are those in which the sum is greater. Examples of
deficient and abundant numbers are not difficult to find.
Friendly (or amicable) pairs of numbers are those in
which the sum of the divisors of each number is equal to
the other number, as for example, 284 and 220. The divisors of 220 are 1, 2, 4, 5, 10, 11,20, 22, 44, 55, and 110which total 284; the factors of 284 add up to 220.
In sociable chains the sum of the divisors of each
number is equal to the next number, and the sum of the
divisors of the last number is equal to the first number.
(It requires what the Germans call" sitzfleisch" to discover
such chains, but number theorists are apparently willing
to devote time to such problems.) An example of a sociable
chain is 14,288, 15,472, 14,536, 14,264, 12,496. (I can't bring
myself to verify this, or to ask any of my friends to do so.)
Some Geometricians Are Masochists
The usual picture of a mathematician is that of a shy
individual, often with glasses and a receding forehead (or
a large scalp.) Geometricians, in particular, have peculiar
ways of torturing themselves. It is known, for example,
that Euclid made many geometrical constructions using
only a straightedge and a compass. But some geometricians
go still further-they try to use less than the standard
straightedge and compass.
147
148
- --
~
I
I
I
--
I
I
RADIUS
!.
()
J
Figure 37
149
Figure 38
150
Figure 39
V"'"
\ ......
Fermat's Challenge
151
mean by a random number. But in spite of this, the calculation of the probability was performed. (I even think it
would satisfy the mathematical purist.) The present
problem asks for a determination of the length of a very
peculiar curve. We can solve this problem without determining the shape of the curve.
Consider a square 10 inches on a side, as is shown in
figure 40. A bug waits at each corner of the square and at
a given signal (these are trained bugs) each one begins to
walk toward the one in front of it, as is shown by the
arrows. As each bug moves, the direction of the one behind
him changes, because the bugs always move toward the
one in front. They move at a velocity of one inch per
minute. How long does it take before the bugs collide with
each other in the center of the square, and how far has
each one walked?
In this problem also, we have an apparent dearth of
information. To solve it, we need recognize only that the
travels of bug B are always at right angles to the path
from bug A to bug B, and so cannot affect the distance
from A to B. Then it is only A's walking that has any
effect on the distance from A to B, and only B's travels
affect the distance from B to C. Since the bugs start
10 inches apart, they can travel 10 inches before a central
collision. Each bug must travel a distance of 10 inches,
10"
10"
Figure 40
152
Figure 41
153
Index
area
enclosed in a perimeter,
132--134
of squares, 33-35
of triangle, 40-41
area problems, 33--35, 79-80,
102--103, 132--134
arithmetic
Fundamental Theorem of,
60, 126
see restored arithmetic
156
Index
computers, 135-136
constant diameter, 153
construction
problems, 37-39,80-81, 139140, 147
see Mohr-Mascheroni construction; Wilkes-Gordon construction
"Construction of a Cube," 80-81
Count Buffon's Needle Problem, 123-124
counters, games played with,
74-79
Courant and Robbins, cited 37n,
147n
cube
construction of,80
problems, 10-12, 150
when equal to a square, 150
"Cup of Coffee and Cup of
Tea," 73-74
cylinders, intersecting, 147-149
Index
157
Gauss, 118
"Geometric Proof That
~ m3
[N~ mJ2"
,
33-35
harmonic series, 31
"Hempel's Paradox," 32-33
"Incorrectly Cashed Check,
The," 13-14
"Integral Pythagorean Triplets," 16-17
158
Index
numbers (cont.)
even, 10, 12,22-23,75
friendly, 145, 146
Greek names for, 145-146
ideal,147
Ludolphian, 122
manipulation of, 82-91
odd,22-23,35,54,75
perfect, 145-146
prime, 35, 49-60, 123-124,
126-127
relatively prime, 13, 123,
126--127
sociable, 145, 146
square, 145
square of, 51
squares of, problem, 17
squaring of, 85-88
transcendental, 122
triangular, 119, 131
see also binary
number theory problems, 31-32,
54-59, 150
O'Beirne, T. H., 22
"Officer and His Column of
Men, The," 100-102
ohms, 128
Ohm's Law, 128
"On Moving Day," 14-15
Pappus' Theorem, 25
parallelepiped, volume of, 10-12
"Parity of Number of People
Shaking Hands at a
Conference," 22-23
"Peculiar Infinite Sequence, A,"
35-37
"Peculiarity of 142, 857," 31-32
Index
159
160
Index
"Which