YOU ARE HERE: LAT HomeCollections

# Prime suspects

## The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics, Marcus du Sautoy, HarperCollins: 336 pp., \$24.95 Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, John Derbyshire, Joseph Henry Press: 422 pp., \$27.95 The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics, Karl Sabbagh, Farrar, Straus & Giroux: 342 pp., \$25 The Millennium Problems: The Seven Greatest Unsolved Mathematical Puzzles of Our Time, Keith Devlin, Basic Books: 238 pp., \$26

June 15, 2003|Ben Yandell | Ben Yandell is the author of "The Honors Class: Hilbert's Problems and Their Solvers."

What is the most down-to-earth yet significant problem in mathematics? In the beginning, you learn to count -- 1, 2, 3, 4, 5 -- and to add these numbers. Next comes multiplication, a way to batch-process multiple additions. A great observation can then be made: Some of the counting numbers can be obtained by multiplying two smaller counting numbers together -- like 6, which is 2 times 3 -- but others -- like 5 -- cannot. Irreducibility is key in mathematics and science. The numbers that are not reducible to smaller factors are called prime numbers.

How many prime numbers are there? Are they relative anomalies or common? Euclid supplied a proof that the number of primes is infinite: There is no largest prime. All right, if we are given a number, however high, can we find a way to tell how many primes there are below that number without actually counting them?

The answer, at least in a first approximation, turns out to be surprisingly simple. Dividing the number you are interested in by its natural logarithm (there is a logarithm button on many calculators) gives the number of primes that will be found beneath it. This result is one of the jewels of mathematics, the "prime number theorem."

Jacques Hadamard and Charles-Jean de la Vallee Poussin proved the prime number theorem in 1896, based on an approach suggested by a nearly telegraphic, eight-page paper by Bernhard Riemann (1826-1866) published in 1859. This approach uses what has come to be known as the Riemann hypothesis, which at first glance might seem to be merely technical and not something that would prompt, more than 140 years later, the appearance of four popular books.

The paper introduced "Riemann's zeta function," which takes on various values. Riemann said that if one graphs the points where the zeta function equals zero, all the points will lie on a specific line. What Hadamard and De la Vallee Poussin proved was that they all lie inside a fairly wide band on either side of the line. Proof of the full Riemann hypothesis would give us a much more precise prime number theorem and a lot of information about prime numbers, even when they are unreachably large.

Number theorist Marcus du Sautoy's book "The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics" compares the pattern the primes make to music. At first they seem to appear at random, like a kind of noise, but under analysis display a more musical structure.

Du Sautoy writes: "Mathematics is a creative art under constraints -- like writing poetry or playing the blues. Mathematicians are bound by the logical steps they must take in crafting their proofs. Yet within such constraints there is still a lot of freedom. Indeed, the beauty of creating under constraints is that you get pushed in new directions and find things you might never have expected to discover unaided. The primes are like notes in a scale."

Du Sautoy shows how computers are used to discover reams of detail about the primes and how this detail is important to Web commerce. His account of current work takes us as close to the frontier as we can get without a passport.

John Derbyshire's "Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics" is a more difficult book but is even more rewarding for those up to the challenge. Energetic and conversational, it puts one at ease. In even-numbered chapters he gives a historical overview and biographical sketches of Riemann and those who followed him, while in odd-numbered chapters his mathematical exposition is clear. Derbyshire occasionally sideswipes calculus but usually succeeds in avoiding it.

Derbyshire, who studied mathematics and linguistics at London University, has worked as an investment banker and computer programmer. In 1996 he published a comic novel, "Seeing Calvin Coolidge in a Dream." His day job is writing commentary for National Review, the New Criterion and the Washington Times. Derbyshire's attempt to take nonmathematicians into this subject had me on the edge of my seat. Was he really going to introduce Moebius inversions in polite company? He did, and I found his treatment, and his chutzpah, consistently interesting. His account of what has happened in the last 30 years is sure-footed and perceptive.

Late in the book, Derbyshire wonders whether a proof of the Riemann hypothesis is near, saying, "I am, therefore, going to stick my neck out and say that I believe a proof of the RH to be a long way beyond our present grasp. Surveying the modern history of attempts on the RH is something like reading an account of a long and difficult war. There are sudden surprising advances, tremendous battles, and heart-breaking reverses. There are lulls -- times of exhaustion, when each side, 'fought out,' does little but conduct small-unit probes of the enemy defenses. There are breakthroughs followed by outbursts of enthusiasms; and there are stalemates followed by spells of apathy."