Printer Friendly

Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics.


Nearly 150 years ago, Bernhard Riemann posed a deceptively simple question to his peers at the Berlin Academy: Is there a general rule for figuring out how many prime numbers there are up to a given number? Three years ago, the Clay Institute agreed to award a million dollars to the person who can prove Riemann's hypothesis, which states that there is such a general rule. Derbyshire provides the historical background of the Riemann hypothesis and, for mathematically inclined readers, details of efforts to prove it so far. He also explains the impact that any solution to this problem will have on cryptography and other areas. Alternating between telling Riemann's life story and presenting a mathematical primer on the elements of his hypothesis, Derbyshire elegantly explores a vexing topic. Joseph Henry Pr, 2003, 422 p., b&w plates, hardcover, $27.95.
COPYRIGHT 2003 Science Service, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2003, Gale Group. All rights reserved. Gale Group is a Thomson Corporation Company.

Article Details
Printer friendly Cite/link Email Feedback
Publication:Science News
Article Type:Book Review
Date:Aug 2, 2003
Previous Article:Prehistoric Art: The Symbolic Journey of Humankind.
Next Article:The Water Garden Encyclopedia: The Ultimate Guide to Designing, Constructing, Planting, and Maintaining Garden Ponds and Water Features.

Related Articles
Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem.
The Millennium Problems: The Seven Greatest Unsolved Mathematical Puzzles of Our Time.
Math in our times. (New products: tools for schools).
Mathematicians mind the gap. (Prime Finding).
The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics.
Stalking the Riemann Hypothesis: The Quest to Find the Hidden Law of Prime Numbers.

Terms of use | Copyright © 2018 Farlex, Inc. | Feedback | For webmasters