Read Professor Stewart's Hoard of Mathematical Treasures Online

Authors: Ian Stewart

Tags: #Mathematics, #General

Professor Stewart's Hoard of Mathematical Treasures (39 page)

BOOK: Professor Stewart's Hoard of Mathematical Treasures
10.28Mb size Format: txt, pdf, ePub
ads
Unlike Fermat, he was wrong. In 1966 Leon Lander and Thomas Parkin discovered that
27
5
+ 84
5
+ 110
5
+ 133
5
= 144
5
This remained the only known example of the failure of Euler’s conjecture until 1988, when Noam Elkies discovered that
2,682,440
4
+ 15,365,639
4
+ 187,960
4
= 20,615,673
4
In fact, Elkies proved that there are infinitely many cases where three fourth powers add up to a fourth power - but most of them require very big numbers. Roger Frye used a computer to search by trial and error, and found the smallest example:
95,800
4
+ 217,519
4
+ 414,560
4
= 422,481
4
The Millionth Digit
Suppose we write out all whole numbers in turn, strung together like this:
1234567891011121314151617181920212223242526. . .
and so on.
What is the millionth digit?
 
Answer on page 324
Piratical Pathways
Roger Redbeard, the fiercest pirate in the Kidnibbean Sea, has forgotten a vital piece of information - the address of his bank in the Banana Islands, where he keeps his loot safe from the attentions of the tax authorities. He knows which street it is on, but there are more than thirty banks on Taxhaven Street, all nameless, all looking exactly alike.
All is not lost, however, because he has a map.
Redbeard’s map.
The address of his bank is cunningly concealed in this map: it is the number of distinct ways to trace the word PIRATE, starting at the circle marked P and spelling out the word letter by letter to end at the circle marked E. The address is the number of different ways that this can be achieved, always moving along the lines linking the letters.
What is the address of Redbeard’s Bank?
 
Answer on page 324
Trains That Pass in the Siding
Two trains, the Atchison Flier (A) and the Topeka Bullet (B), are travelling in opposite directions towards each other along the same single-line track. Each consists of one locomotive, at the front, and nine coaches. Both locomotives and all coaches have the same length. The siding can accommodate no more than four coaches or locomotives in total at any one time, while leaving room for trains to pass along the main track.
Can the trains pass each other? If so, how?
 
Answer on page 325.
[Hint: coaches can be decoupled.]
We’re stuck - aren’t we?
Please Make Yourself Clear
The mathematical logician Abraham Fraenkel, who was of German origin, once boarded a bus in Tel Aviv, Israel. The bus was scheduled to depart at 9.00 precisely, but by 9.05 it was still sitting in the bus station.
Aggrieved, Fraenkel waved a timetable at the driver.
‘What are you - a German or a professor?’ the driver enquired.
‘Do you mean the inclusive or, or the exclusive or?’ Fraenkel replied.
38
Abraham Fraenkel.
Squares, Lists and Digital Sums
The list
81, 100, 121, 144, 169, 196, 225
consists of seven consecutive squares. It has a curious feature: the sum of the decimal digits of each of these numbers is itself a square. For example 1 + 6 + 9 = 16 = 4
2
.
Find another sequence of seven consecutive squares with the same property.
 
Answer on page 326
Hilbert’s Hit-List
In 1900, the German mathematician David Hilbert gave a famous lecture to the International Congress of Mathematicians in Paris, in which he listed 23 of the most important problems in mathematics. He didn’t list Fermat’s Last Theorem, but he mentioned it in the introduction. Here’s a potted description of Hilbert’s problems, and their current status.
1.
Continuum Hypothesis
In Cantor’s theory of infinite cardinal numbers (Cabinet, pages 157-61), is there a number strictly between the cardinalities of the integers and the real numbers?
Solved by Paul Cohen in 1963 - the answer can go either way depending on which axioms you use for set theory.
2.
Logical Consistency of Arithmetic
Prove that the standard axioms of arithmetic can never lead to a contradiction.
Solved by Kurt Gödel in 1931, who proved that this can’t be done with the usual axioms for set theory (Cabinet, page 205). On the other hand, Gerhard Gentzen proved in 1936 that it can be done using transfinite induction.
3.
Equality of Volumes of Tetrahedra
If two tetrahedra have the same volume, can you always cut one into finitely many polyhedral pieces, and reassemble them to form the other?
Hilbert thought not. Solved in 1901 by Max Dehn - Hilbert was right.
4.
Straight Line as Shortest Distance Between Two Points
Formulate axioms for geometry in terms of the above definition of ‘straight line’, and investigate what happens.
The problem is too broad to have a definitive solution, but much work has been done.
5.
Lie Groups Without Assuming Differentiability
Technical issue in the theory of groups of transformations.
In one interpretation, solved by Andrew Gleason. However, if it is interpreted as the Hilbert-Smith conjecture,
39
it remains unsolved.
6.
Axioms for Physics
Develop a rigorous system of axioms for mathematical areas of physics, such as probability and mechanics.
Andrei Kolmogorov axiomatised probability in 1933, but the question is a bit vague and is largely unsolved.
7.
Irrational and Transcendental Numbers
Prove that certain numbers are irrational (not exact fractions) or transcendental (not solutions of polynomial equations with rational coefficients). In particular, show that, if a is algebraic and b is irrational, then
a
b
is transcendental - so, for example, 2
√2
is transcendental.
Solved, affirmatively and independently, by Aleksandr Gelfond and Theodor Schneider in 1934.
8.
Riemann Hypothesis
Prove that all non-trivial zeros of Riemann’s zeta function, in the theory of prime numbers, lie on the line ‘real part =
’.
Unsolved. Possibly the biggest open problem in mathematics (see Cabinet, page 215).
9.
Laws of Reciprocity in Number Fields
The classical law of quadratic reciprocity, conjectured by Euler and proved by Gauss in his Disquisitiones Arithmeticae of 1801, states that if p and q are odd primes then (see page 62 for notation) the equation
p

x
2
(mod q) has a solution if and only if
q

y
2
(mod p) has a solution, unless p and q are both of the form 4k - 1, in which case one has a solution and the other does not. Generalise this to other powers than the square.
Partially solved.
10.
Determine When a Diophantine Equation has Solutions
Find an algorithm which, when presented with a polynomial equation in many variables, determines whether any solutions in whole numbers exist.
In 1970, Yuri Matiyasevich, building on work by Julia Robinson, Martin Davis and Hilary Putnam, proved that there is no such algorithm.
11.
Quadratic Forms with Algebraic Numbers as Coefficients
Technical issues, leading in particular to an understanding of the solution of many-variable quadratic Diophantine equations.
Partially solved.
12.
Kronecker’s Theorem on Abelian Fields
Technical issues generalising a theorem of Kronecker about complex roots of unity.
Still unsolved.
13.
Solving Seventh-Degree Equations using Special Functions
Niels Henrik Abel and Évariste Galois proved that the general fifth-degree equation can’t be solved using nth roots, but Charles Hermite showed that it can be solved using elliptic modular
functions. Prove that the general seventh-degree equation can’t be solved using functions of two variables.
A variant was disproved by Andrei Kolmogorov and Vladimir Arnold. Another plausible interpretation remains unsolved.
14.
Finiteness of Complete Systems of Functions
Extend a theorem of Hilbert, about algebraic invariants for specific transformation groups, to all transformation groups.
Proved false by Masayoshi Nagata in 1959.
15.
Schubert’s Enumerative Calculus
Schubert found a non-rigorous method for counting various geometric configurations by making them as singular as possible (lots of lines overlapping, lots of points coinciding). Make this method rigorous.
Progress in special cases; no complete solution.
16.
Topology of Curves and Surfaces
How many connected components can an algebraic curve of given degree, defined in the plane, have? How many distinct periodic cycles can an algebraic differential equation of given degree, defined in the plane, have?
Limited progress in special cases; no complete solution.
17.
Expressing Definite Forms by Squares
If a rational function always takes non-negative values, must it be a sum of squares?
Solved by Emil Artin, D. W. Dubois and Albrecht Pfister. It is true over the real numbers, but false in some more general number systems.
18.
Tiling Space with Polyhedra
General issues about filling space (Euclidean or not) with congruent polyhedra. Also mentions sphere-packing problems, notably the Kepler conjecture that the most efficient way to pack spheres in space is the face-centred-cubic lattice.
The Kepler problem has been solved, with a computer-aided
proof, by Thomas Hales (see Cabinet, page 231). The main question about polyhedra asked by Hilbert has also been solved.
BOOK: Professor Stewart's Hoard of Mathematical Treasures
10.28Mb size Format: txt, pdf, ePub
ads

Other books

Here Is a Human Being by Misha Angrist
The Price of Love by Rosie Harris
Devil Water by Anya Seton
Motown by Loren D. Estleman
Geography of Murder by P. A. Brown
In Deep by Terra Elan McVoy