Proofs from THE BOOK

Mostrar otras versiones (2)

This revised and enlarged fourth edition of "Proofs from THE BOOK" features five new chapters, which treat classical results such as the "Fundamental Theorem of Algebra", problems about tilings, but also quite recent proofs, for example of the Kneser conjecture in graph theory. T...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Aigner, Martin (Autor), Ziegler, Günter M. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:4th ed. 2010.
Temas:
Mathematical logic.
Mathematics.
Number theory.
Geometry.
Discrete mathematics.
Mathematical analysis.
Mathematical Logic and Foundations.
Number Theory.
Discrete Mathematics.
Analysis.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Number Theory
  • Six proofs of the infinity of primes
  • Bertrand's postulate
  • Binomial coefficients are (almost) never powers
  • Representing numbers as sums of two squares
  • The law of quadratic reciprocity
  • Every finite division ring is a field
  • Some irrational numbers
  • Three times ?²/6
  • Geometry
  • Hilbert's third problem: decomposing polyhedra
  • Lines in the plane and decompositions of graphs
  • The slope problem
  • Three applications of Euler's formula
  • Cauchy's rigidity theorem
  • Touching simplices
  • Every large point set has an obtuse angle
  • Borsuk's conjecture
  • Analysis
  • Sets, functions, and the continuum hypothesis
  • In praise of inequalities
  • The fundamental theorem of algebra
  • One square and an odd number of triangles
  • A theorem of Pólya on polynomials
  • On a lemma of Littlewood and Offord
  • Cotangent and the Herglotz trick
  • Buffon's needle problem
  • Combinatorics
  • Pigeon-hole and double counting
  • Tiling rectangles
  • Three famous theorems on finite sets
  • Shuffling cards
  • Lattice paths and determinants
  • Cayley's formula for the number of trees
  • Identities versus bijections
  • Completing Latin squares
  • Graph Theory
  • The Dinitz problem
  • Five-coloring plane graphs
  • How to guard a museum
  • Turán's graph theorem
  • Communicating without errors
  • The chromatic number of Kneser graphs
  • Of friends and politicians
  • Probability makes counting (sometimes) easy.

Ejemplares similares