Author | Aigner, Martin. author |
---|---|

Title | Proofs from THE BOOK [electronic resource] / by Martin Aigner, Gรผnter M. Ziegler |

Imprint | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998 |

Connect to | http://dx.doi.org/10.1007/978-3-662-22343-7 |

Descript | VIII, 199 p. online resource |

SUMMARY

The (mathematical) heroes of this book are "perfect proofs": brilliant ideas, clever connections and wonderful observations that bring new insight and surprising perspectives on basic and challenging problems from Number Theory, Geometry, Analysis, Combinatorics, and Graph Theory. Thirty beautiful examples are presented here. They are candidates for The Book in which God records the perfect proofs - according to the late Paul Erdรถs, who himself suggested many of the topics in this collection. The result is a book which will be fun for everybody with an interest in mathematics, requiring only a very modest (undergraduate) mathematical background

CONTENT

Number Theory -- 1. Six proofs of the infinity of primes -- 2. Bertrandโ{128}{153}s postulate -- 3. Binomial coefficients are (almost) never powers -- 4. Representing numbers as sums of two squares -- 5. Every finite division ring is a field -- 6. Some irrational numbers -- Geometry -- 7. Hilbertโ{128}{153}s third problem: decomposing polyhedra -- 8. Lines in the plane and decompositions of graphs -- 9. The slope problem -- 10. Three applications of Eulerโ{128}{153}s formula -- 11. Cauchyโ{128}{153}s rigidity theorem -- 12. The problem of the thirteen spheres -- 13. Touching simplices -- 14. Every large point set has an obtuse angle -- 15. Borsukโ{128}{153}s conjecture -- Analysis -- 16. Sets, functions, and the continuum hypothesis -- 17. In praise of inequalities -- 18. A theorem of Pรณlya on polynomials -- 19. On a lemma of Littlewood and Offord -- Combinatorics -- 20. Pigeon-hole and double counting -- 21. Three famous theorems on finite sets -- 22. Cayleyโ{128}{153}s formula for the number of trees -- 23. Completing Latin squares -- 23. The Dinitz problem -- Graph Theory -- 25. Five-coloring plane graphs -- 26. How to guard a museum -- 27. Turรกnโ{128}{153}s graph theorem -- 28. Communicating without errors -- 29. Of friends and politicians -- 30. Probability makes counting (sometimes) easy -- About the Illustrations

Mathematics
Mathematical analysis
Analysis (Mathematics)
Geometry
Number theory
Combinatorics
Mathematics
Number Theory
Geometry
Analysis
Combinatorics