The first puzzle in Martin Gardner’s
Science Fiction Puzzle Tales
involves the planet Capra, which has a north and south
pole just like earth.
The challenge is to find a location on the planet where you can do
the following:
Drive 10 km south.
Drive 10 km east.
Drive 10 km north.
You are now back where you started.
The initial suggestion is the north pole, but that is not the only
solution. What other possibilities are there?
Imagine a point a little over 10 km from the south pole. If it is
just the right distance away, you can go south for 10 km,
east 10 km circling exactly once around the pole, then north 10 km back
you your starting point. The set of all such points forms a circle
just over 10 km from the south pole.
Starting a little closer, you can go twice around the pole before
heading back to your starting point. These points form
a circle too.
In fact there are an infinite number of such concentric circles,
closer and closer to 10 km from the south pole.
So what are the actual values?
Assume the planet Capra is perfectly
spherical, with the same radius as earth
(6371 km).
The circle around the pole that you travel along (heading east)
has a circumference of 10 / n, where n is the number of times
you repeat it. Let a be the radius of that circle. Then 10 / n = 2πa, so a = 5 / nπ.
Now we can grab some formulas from Wikipedia. The circle forms the base
of a spherical cap with the following values:
a: circle radius = 5 / nπ
r: sphere radius = 6371
h: distance from the centre of the circle to the pole.
θ: angle at the centre of the sphere between the pole and the edge of the circle.
One of the formulas is:
r = (a2 + h2) / 2h
Solving for h gives:
h2 - 2rh + a2 = 0
h = (2r ± sqrt(4r2 - 4a2)) / 2 (by the quadratic formula)
h = r ± sqrt(r2 - a2)
There are two solutions, one for each pole (imagine placing a ring
onto a sphere; it fits over either end). We want the solution where
h < r, so:
h = r - sqrt(r2 - a2)
h = 6371 - sqrt(63712 - (5 / nπ)2)
Now find θ by equating two different formulas for the surface area of the spherical cap:
The distance overland from the pole to the circle is rθ
(the fraction of a whole
circle θ / 2π times the circumference 2πr).
Here are some results:
n
a
h
θ
Pole to circle
Pole to start point
1
1.6 km
2 m
0.00025
1.6 km
11.6 km
2
796 m
5 cm
0.000125
0.80 km
10.80 km
3
531 m
2.2 cm
0.0000833
0.53 km
10.53 km
1000
1.6 m
0.0002 mm
0.00000025
1.6 m
10.0016 km
The values of a and the pole to circle distance rθ are
almost identical, since the surface of the planet is virtually
flat at these distances.
The Great Ring of Neptune
Puzzle 8 in Science Fiction Puzzle Tales asks you to
find the area of a ring around the planet Neptune (shaded below).
However, all you know is distance AC.
If you are told that you have enough information to find the answer,
does that make it any easier?
Since you know there is a unique solution, the ring’s area must
be the same no matter what size the circles are.
So you can set the radius of the inner circle to 0, making the
radius of the outer circle (1/2 AC). The ring’s area is
now the same as the outer circle:
π * (1/2 AC)2.
Problem 2
Here’s similar problem mentioned in the notes for the same puzzle.
A hole 6 inches long has been drilled through a wooden sphere.
What is the volume remaining in the sphere? There is only one
possible answer.
If you know there is a unique solution, it must be independant
of the radius of the hole. Setting the hole radius to 0 makes the
sphere radius 3 inches, so the volume is
4/3 * π * 33 = 36π.
Touching Circles
Two circles touch at exactly one point. The distance between the centre
of the circles is 2 cm. What is the minimum and maximum total area
of the circles?
If you try the “zero radius” approach from the previous
problems and set the radii to 0 and 2 cm, the total
area is π * 22 = 4π. Intuitively the minimum area
might be when the circles have an equal radius of 1 cm,
which gives a total area of 2 * (π * 11) = 2π.
So far so good, but we need to confirm.
Call the two radii x and y, so x + y = 2 and the total area of the
circles is:
πx2 + πy2 =
π(x2 + y2).
To find the minimum and maximum area, first express it in
terms of just one variable. y = 2 - x, so the area is:
This is an upward parabola (since the x2 coefficient
is positive), so the minimum value is at x = -b/2a
(using the standard quadratic form ax2 + bx + c):
x = -(-4π)/(2*2π) = 1
y = 2 - x = 1
So the values for the minimum area we originally guessed are correct
(x = y = 1). But what about
the maximum value? Being an upward parabola means
there is no maximum. How is that possible if both radii are
between 0 and 2?
The problem has a hidden assumption. The way the circles were drawn
implies they are non-overlapping. But one circle could be inside the
other and still satisfy the condition of touching at a single point:
Now the relationship between the radii is different. If x is the
radius of the larger circle, y = x - 2, which allows both radii to have
values higher than 2. (The formula for the total area still works out
to be the same).
Both cases can be combined using the absolute value:
y = | x - 2 |.
Five Spheres
Five spheres all touch
each other at exactly one point, and no two pairs
touch at the same point. How are they arranged?
Drawing by Clockwork
Consider the analog plotting device show below.
The device is operated by holding the lower horizontal bar and
using it to rotate the two bottom gears.
The vertical and horizontal bars holding the pen are not attached
to each other, so the pen can move in any direction.
The balls at the end of the horizontal bars can freely
rotate in place. All gears other than gear A are
the same size. Assume the rods connected to A and B start at
the same angle relative to the centre of their gears.
Question 1
Let m = (radius of gear A) / (radius of gear B).
What image is drawn if m equals 1, 2, 3 or 1/2? Assume gears A and B start at the same angle.
The horizontal motion of the pen is identical to gear B,
and the vertical motion is identical to gear A (at the point where
the rod is attached). However, gear B completes m revolutions for
each revolution of gear A.
Ignoring scale and translation, and assuming the rods attached to
A and B both start at angle 0° and gear A completes one revolution
in time 2π, then at time t the pen is at location:
These are known as Lissajous curves. Here are a few more:
Question 2
Does it make a difference if gears A and B don’t start
at the same angle?
If the gears are out of phase by angle a, then the equations become:
x = cos(mt + a)
y = sin(t)
The visual effect looks a bit like a 3D rotation. For m = 1 the circle gets distorted until it becomes a diagonal line for a = π/2, since cos(t + π/2) = -sin(t) (similarly for a = 3π/2, but the diagonal
line gets flipped):
Question 3
All of the above patterns repeat forever. How long does it take to draw
a complete pattern and for the gears to return to their initial position
as a function of m (assume a constant gear rotation speed and that
drawing m = 1 takes time 1)?
Are there patterns that never repeat?
Gear B returns to its initial position whenever time
t is an integer, and gear A whenever mt is an integer.
Writing m as a fraction i/j where i and j are integers
with no common factors, we require the lowest value of t > 0 such that:
t is an integer
ti/j is an integer
... which happens at t = j. So patterns m = 1/2, m = 3/2, m = 5/2 and so
on all repeat after time 2.
If m cannot be written as the ratio of two integers (e.g. √2 or a
multiple of π), then the pattern never repeats and the machine draws
a filled square as t approaches infinity.
Five Beads
Five identical beads are placed on a flat table so that they are all
connected. How many possible arrangements are there, considering only
whether beads do or do not touch?
(Arrangements that are identical by reflection should only be
counted once).
You can find the possible arrangements as follows:
For one or two beads, there is only one arrangement.
For n >= 3 beads, add one bead to each arrangement of n-1 beads
at all possible positions to create new arrangements.
When adding to an arrangement, existing clusters of beads are never
changed, but beads can be
moved in a way that maintains their existing relationships with the
other beads. This allows newly added beads to touch two beads that do not
already touch, forming a loop of 4 or more.
Exclude any duplicate arrangements.
This procedure gives 2 arrangements of 3, 5 arrangements of 4 and
13 arrangements of 5 beads.
If you draw a line between the centres of touching beads, the
arrangements are a little easier to see.
Question 2
If you think of these diagrams as
connected graphs, what
constraints are there for a bead arrangement to be valid?
Can you think of some example graphs that cannot be drawn
without violating a constraint?
The constraints are:
Let the edge length be 1. Then:
No two vertices are less than distance 1 apart.
Edge AB exists if and only if vertices A and B are exactly
distance 1 apart (therefore all edges have equal length).
This implies that the graph is planar (no two edges cross), since
if there is an edge AB with length 1, there is no possible edge CD
with length 1 that crosses AB:
The distance constraints also imply something about the angles:
If edges AB and BC exist:
Angle ABC >= 60° (otherwise distance AC would be less than 1).
Edge AC exists if and only if angle ABC = 60° (forming an equilateral triangle).
Here are some graphs that inevitably violate the constraints:
1 & 5) cannot be drawn with equal edge lengths.
Graph 1 requires angles less than 60° as well.
2) cannot be drawn without angles below 60° or all vertices
being at least distance 1 apart.
3) is missing a required edge at the bottom.
4) is non-planar.
Contradictory Chords
Professor Bertrand asked his students the following question:
if I inscribe an equilateral triangle in a circle, then draw a
random chord in the circle, what is the probability that the
chord is longer than the side of the triangle?
Each of his three students gave a different answer: Sue said 1/3,
Mark said 1/2 and Alex said 1/4.
Which student do you agree with (if any)?
Each student selected the chord a different way.
Sue’s method was to chose two random points on the circle and
draw a chord between them. In the diagram below, if the first point
is A, then choosing any point along the arc BC creates a chord longer
than the side of the triangle. The length of arc BC is one third of the
circumference, making the probability 1/3.
Mark’s approach started the same way by picking a point A somewhere
on the circle. Then he chose a point at a random distance between A and
the centre C and drew a chord through that point perpendicular to AC.
In the diagram below, B is the intersection of AC and a perpendicular
edge of the triangle. If the randomly selected point is anywhere on BC,
the chord is longer than the triangle edge. B is the midpoint of AC (since angle CXB is 30°, BC/XC = sin(30°) = 1/2, so BC = XC/2 = AC/2), so the probability of selecting a point on BC is 1/2.
Alex decided to select a point anywhere in the circle (with equal
probability) and draw a chord with that as its midpoint.
If a smaller circle is inscribed inside the triangle, then selecting
any point inside that circle results in a chord longer than the side
of the triangle.
Call the radii of the smaller and larger circle r and R respectively.
Then r = R/2 (as in Mark’s approach).
So the probability of selecting a point in the smaller circle is
(πR2/4) / πR2 = 1/4.
This problem is known as Betrand’s Paradox. The issue is that
the method of randomly selecting a chord is never clearly stated.
The reason for the three different answers is that each method
involves a different distribution. If you reduce each of the
methods to a single variable, it is possible to visualise the
distributions as 2D graphs of chord length vs the variable value.
What variable might you use for each method?
For Sue’s method, the two points on the circle can be treated
as angles from the centre, which can be reduced to a single variable
as (angle2 - angle1) with values 0 to 2π.
In Mark’s method, the location of point A on the circle makes
no difference to the probability; all that matters is the distance
from the centre, which can have a value from 0 to the radius.
Alex’s method involves choosing any point in the circle with
equal probability. As described here,
such points can
be selected by choosing a random angle (which makes no difference
to the probability) and a distance from the centre equal to
sqrt(random value from 0 to 1) * radius. To graph the distribution
of this value, use the square of the value as the X axis.
The values 1/3, 1/2 and 1/4 can be seen in the
graphs (vertical axis is the chord length; circle radius is
assumed to be 1):