A must for math buffs.
A Royal Society research fellow takes the Riemann Hypothesis, reputedly the most difficult of all math problems, as the focus for his lively history of number theory.
Du Sautoy (Mathematics/Oxford) begins in 1900 with German mathematician David Hilbert's famous address to the International Congress of Mathematicians in Paris, where Hilbert offered 23 unsolved problems as challenges to his colleagues. Among them was the Reimann Hypothesis, which concerns the distribution of prime numbers; it is the only one still unsolved. Greek mathematicians knew that the primes are infinite in number and distributed randomly in the set of natural numbers. Two centuries ago, Carl Friedrich Gauss offered a formula to estimate how many primes lie below any given number; in 1859, Gauss's student, Bernhard Riemann, refined that estimate, based on the incredibly complex Zeta function, but died without proving his hypothesis. With a minimum of equations and mathematical symbols, du Sautoy outlines the progress each succeeding generation has made on the problem. Along the way, readers meet G.H. Hardy and J.E. Littlewood, the twin beacons of the Cambridge math department between the world wars; Ramanujan, the self-taught Indian clerk who claimed that his ideas were given to him by his family goddess; and Atle Selberg, who survived the Nazi occupation of Norway to become a leading light at Princeton's Institute for Advanced Studies. Alan Turing, the father of modern computers, tried to devise a program to attack the Riemann Hypothesis; now the primes are the key to cryptography. A Boston businessman has offered a million-dollar reward for a proof, although few mathematicians seem to need additional incentive to tackle the Everest of mathematical problems. Du Sautoy keeps the story moving and gives a clear sense of the way number theory is played in his accessible text. (See Karl Sabbagh’s The Riemann Hypothesis, p. 369, which covers similar territory but spotlights current mathematicians searching for a Riemann proof.)
A must for math buffs.Pub Date: May 1, 2003
ISBN: 0-06-621070-4
Page Count: 336
Publisher: HarperCollins
Review Posted Online: May 19, 2010
Kirkus Reviews Issue: March 15, 2003
Stricter than, say, Bergen Evans or W3 ("disinterested" means impartial — period), Strunk is in the last analysis...
Privately published by Strunk of Cornell in 1918 and revised by his student E. B. White in 1959, that "little book" is back again with more White updatings.
Stricter than, say, Bergen Evans or W3 ("disinterested" means impartial — period), Strunk is in the last analysis (whoops — "A bankrupt expression") a unique guide (which means "without like or equal").Pub Date: May 15, 1972
ISBN: 0205632645
Page Count: 105
Publisher: Macmillan
Review Posted Online: Oct. 28, 2011
Kirkus Reviews Issue: May 1, 1972
This is not the Nutcracker sweet, as passed on by Tchaikovsky and Marius Petipa. No, this is the original Hoffmann tale of 1816, in which the froth of Christmas revelry occasionally parts to let the dark underside of childhood fantasies and fears peek through. The boundaries between dream and reality fade, just as Godfather Drosselmeier, the Nutcracker's creator, is seen as alternately sinister and jolly. And Italian artist Roberto Innocenti gives an errily realistic air to Marie's dreams, in richly detailed illustrations touched by a mysterious light. A beautiful version of this classic tale, which will captivate adults and children alike. (Nutcracker; $35.00; Oct. 28, 1996; 136 pp.; 0-15-100227-4)
Pub Date: Oct. 28, 1996
ISBN: 0-15-100227-4
Page Count: 136
Publisher: Harcourt
Review Posted Online: May 19, 2010
Kirkus Reviews Issue: Aug. 15, 1996
BOOK REVIEW
BOOK REVIEW
© Copyright 2025 Kirkus Media LLC. All Rights Reserved.
Follow
Popular in this Genre
We can’t wait for you to join Kirkus!
It’s free and takes less than 10 seconds!
Already have an account? Log in.
OR
Sign in with GoogleTrouble signing in? Retrieve credentials.
Welcome Back!
OR
Sign in with GoogleTrouble signing in? Retrieve credentials.
