MTU Cork Library Catalogue

Syndetics cover image
Image from Syndetics

Proofs from the book / Martin Aigner and Gunter M. Ziegler.

By: Aigner, Martin, 1942-.
Contributor(s): Ziegler, Günter M.
Material type: materialTypeLabelBookPublisher: New York : Springer-Verlag, 1998Description: viii,199 p. : ill. ; 25 cm.ISBN: 3540636986.Subject(s): MathematicsDDC classification: 510
Contents:
Number theory -- Geometry -- Analysis -- Combinatorics -- Graph theory.
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Lending MTU Bishopstown Library Lending 510 (Browse shelf(Opens below)) 1 Available 00069042
Total holds: 0

Enhanced descriptions from Syndetics:

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.

Includes bibliographical references and index.

Number theory -- Geometry -- Analysis -- Combinatorics -- Graph theory.

Table of contents provided by Syndetics

  • Number Theory (p. 1)
  • 1 Six proofs of the infinity of primes (p. 3)
  • 2 Bertrand's postulate (p. 7)
  • 3 Binomial coefficients are (almost) never powers (p. 13)
  • 4 Representing numbers as sums of two squares (p. 17)
  • 5 Every finite division ring is a field (p. 23)
  • 6 Some irrational numbers (p. 27)
  • Geometry (p. 35)
  • 7 Hilbert's third problem: decomposing polyhedra (p. 37)
  • 8 Lines in the plane and decompositions of graphs (p. 45)
  • 9 The slope problem (p. 51)
  • 10 Three applications of Euler's formula (p. 57)
  • 11 Cauchy's rigidity theorem (p. 63)
  • 12 The problem of the thirteen spheres (p. 67)
  • 13 Touching simplices (p. 73)
  • 14 Every large point set has an obtuse angle (p. 77)
  • 15 Borsuk's conjecture (p. 83)
  • Analysis (p. 89)
  • 16 Sets, functions, and the continuum hypothesis (p. 91)
  • 17 In praise of inequalities (p. 101)
  • 18 A theorem of Pólya on polynomials (p. 109)
  • 19 On a lemma of Littlewood and Offord (p. 117)
  • Combinatorics (p. 121)
  • 20 Pigeon-hole and double counting (p. 123)
  • 21 Three famous theorems on finite sets (p. 135)
  • 22 Cayley's formula for the number of trees (p. 141)
  • 23 Completing Latin squares (p. 147)
  • 23 The Dinitz problem (p. 153)
  • Graph Theory (p. 159)
  • 25 Five-coloring plane graphs (p. 161)
  • 26 How to guard a museum (p. 165)
  • 27 Turan's graph theorem (p. 169)
  • 28 Communicating without errors (p. 173)
  • 29 Of friends and politicians (p. 183)
  • 30 Probability makes counting (sometimes) easy (p. 187)
  • About the Illustrations (p. 196)
  • Index (p. 197)

Powered by Koha