Mathematics: The New Golden Age offers a glimpse of the extraordinary vistas and bizarre universes opened up by contemporary mathematicians: Hilbert's tenth problem and the four-color theorem, Gaussian integers, chaotic dynamics and the Mandelbrot set, infinite numbers, and strange number systems. Why a "new golden age"? According to Keith Devlin, we are currently witnessing an astronomical amount of mathematical research. Charting the most significant developments that have taken place in mathematics since 1960, Devlin expertly describes these advances for the interested layperson and adroitly summarizes their significance as he leads the reader into the heart of the most interesting mathematical perplexities from the biggest known prime number to the Shimura-Taniyama conjecture for Fermat's Last Theorem.
Revised and updated to take into account dramatic developments of the 1980s and 1990s, Mathematics: The New Golden Age includes, in addition to Fermat's Last Theorem, major new sections on knots and topology, and the mathematics of the physical universe.
Devlin portrays mathematics not as a collection of procedures for solving problems, but as a unified part of human culture, as part of mankind's eternal quest to understand ourselves and the world in which we live. Though a genuine science, mathematics has strong artistic elements as well; this creativity is in evidence here as Devlin shows what mathematicians do and reveals that it has little to do with numbers and arithmetic. This book brilliantly captures the fascinating new age of mathematics.
|Publisher:||Columbia University Press|
|Edition description:||Revised and Enlarged Edition|
|Product dimensions:||6.27(w) x 9.24(h) x 1.03(d)|
Table of Contents
1. Prime Numbers, Factoring, and Secret Codes
2. Sets, Infinity, and the Undecidable
3. Number Systems and the Class Number Problem
4. Beauty from Chaos
5. Simple Groups
6. Hilbert's Tenth Problem
7. The Four-Color Problem
8. Hard Problems About Complex Numbers
9. Knots, Topology, and the Universe
10. Fermat's Last Theorem
11. The Efficiency of Algorithms