ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
75
views
0
references
Top references
cited by
11
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,151
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Proofs from THE BOOK
other
Author(s):
Martin Aigner
,
Günter M. Ziegler
Publication date
(Print):
2010
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Huddersfield Books
Author and book information
Book
ISBN (Print):
978-3-642-00855-9
ISBN (Electronic):
978-3-642-00856-6
Publication date (Print):
2010
DOI:
10.1007/978-3-642-00856-6
SO-VID:
2f00cfb0-212d-45a1-8141-be2e68795c33
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Six proofs of the infinity of primes
pp. 7
Bertrand’s postulate
pp. 13
Binomial coefficients are (almost) never powers
pp. 17
Representing numbers as sums of two squares
pp. 23
The law of quadratic reciprocity
pp. 31
Every finite division ring is a field
pp. 35
Some irrational numbers
pp. 43
Three times Π²/6
pp. 53
Hilbert’s third problem: decomposing polyhedra
pp. 63
Lines in the plane and decompositions of graphs
pp. 69
The slope problem
pp. 75
Three applications of Euler’s formula
pp. 81
Cauchy’s rigidity theorem
pp. 85
Touching simplices
pp. 89
Every large point set has an obtuse angle
pp. 95
Borsuk’s conjecture
pp. 103
Sets, functions, and the continuum hypothesis
pp. 119
In praise of inequalities
pp. 127
The fundamental theorem of algebra
pp. 131
One square and an odd number of triangles
pp. 139
A theorem of Pólya on polynomials
pp. 145
On a lemma of Littlewood and Offord
pp. 149
Cotangent and the Herglotz trick
pp. 155
Buffon’s needle problem
pp. 161
Pigeon-hole and double counting
pp. 173
Tiling rectangles
pp. 179
Three famous theorems on finite sets
pp. 185
Shuffling cards
pp. 195
Lattice paths and determinants
pp. 201
Cayley’s formula for the number of trees
pp. 207
Identities versus bijections
pp. 213
Completing Latin squares
pp. 221
The Dinitz problem
pp. 227
Five-coloring plane graphs
pp. 231
How to guard a museum
pp. 235
Turán’s graph theorem
pp. 241
Communicating without errors
pp. 251
The chromatic number of Kneser graphs
pp. 257
Of friends and politicians
pp. 261
Probability makes counting (sometimes) easy
Similar content
1,151
Secure Multi-Party Proof and its Applications
Authors:
Chunming Tang
,
Shuhong Gao
A proposal for kinetic proof reading by ISWI family chromatin remodeling motors.
Authors:
Geeta J. Narlikar
Proof-based development of specifications with KIDS/VDM
Authors:
Yves Ledru
See all similar
Cited by
11
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
Authors:
Hans L. Bodlaender
,
Marek Cygan
,
Stefan Kratsch
…
Do Mathematicians Agree about Mathematical Beauty?
Authors:
Rentuya Sa
,
Lara Alcock
,
Matthew Inglis
…
Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes
Authors:
Tom Hartmann
,
An-Chiang Chu
,
Martin Middendorf
…
See all cited by