- Page 2:
Martin Aigner Günter M. Ziegler Pr
- Page 5 and 6:
Prof. Dr. Martin Aigner FB Mathemat
- Page 7 and 8:
VI Preface to the Fourth Edition Wh
- Page 9 and 10:
VIII Table of Contents 21. A theore
- Page 12 and 13:
Six proofs of the infinity of prime
- Page 14 and 15:
Six proofs of the infinity of prime
- Page 16 and 17:
Bertrand’s postulate Chapter 2 We
- Page 18 and 19:
Bertrand’s postulate 9 times. Her
- Page 20 and 21:
Bertrand’s postulate 11 by compar
- Page 22 and 23:
Binomial coefficients are (almost)
- Page 24 and 25:
Binomial coefficients are (almost)
- Page 26 and 27:
Representing numbers as sums of two
- Page 28 and 29:
Representing numbers as sums of two
- Page 30 and 31:
Representing numbers as sums of two
- Page 32 and 33:
The law of quadratic reciprocity Ch
- Page 34 and 35:
The law of quadratic reciprocity 25
- Page 36 and 37:
The law of quadratic reciprocity 27
- Page 38 and 39:
The law of quadratic reciprocity 29
- Page 40 and 41:
Every finite division ring is a fie
- Page 42 and 43:
Every finite division ring is a fie
- Page 44 and 45:
Some irrational numbers Chapter 7
- Page 46 and 47:
Some irrational numbers 37 and this
- Page 48 and 49:
Some irrational numbers 39 F(x) may
- Page 50:
Some irrational numbers 41 Now assu
- Page 53 and 54:
44 Three times π 2 /6 v 1 1 2 y v
- Page 55 and 56:
46 Three times π 2 /6 For m = 1, 2
- Page 57 and 58:
48 Three times π 2 /6 1 f(t) = 1 t
- Page 59 and 60: 50 Three times π 2 /6 (3) It has b
- Page 62 and 63: Hilbert’s third problem: decompos
- Page 64 and 65: Hilbert’s third problem: decompos
- Page 66 and 67: Hilbert’s third problem: decompos
- Page 68 and 69: Hilbert’s third problem: decompos
- Page 70: Hilbert’s third problem: decompos
- Page 73 and 74: 64 Lines in the plane, and decompos
- Page 75 and 76: 66 Lines in the plane, and decompos
- Page 78 and 79: The slope problem Chapter 11 Try fo
- Page 80 and 81: The slope problem 71 • Every move
- Page 82: The slope problem 73 For the second
- Page 85 and 86: 76 Three applications of Euler’s
- Page 87 and 88: 78 Three applications of Euler’s
- Page 89 and 90: 80 Three applications of Euler’s
- Page 91 and 92: 82 Cauchy’s rigidity theorem Q: Q
- Page 93 and 94: 84 Cauchy’s rigidity theorem A be
- Page 95 and 96: 86 Touching simplices l l l ′ Pr
- Page 97 and 98: 88 Touching simplices For our examp
- Page 99 and 100: 90 Every large point set has an obt
- Page 101 and 102: 92 Every large point set has an obt
- Page 103 and 104: 94 Every large point set has an obt
- Page 105 and 106: 96 Borsuk’s conjecture Theorem. L
- Page 107 and 108: 98 Borsuk’s conjecture On the oth
- Page 109: 100 Borsuk’s conjecture To obtain
- Page 113 and 114: 104 Sets, functions, and the contin
- Page 115 and 116: 106 Sets, functions, and the contin
- Page 117 and 118: 108 Sets, functions, and the contin
- Page 119 and 120: 110 Sets, functions, and the contin
- Page 121 and 122: 112 Sets, functions, and the contin
- Page 123 and 124: 114 Sets, functions, and the contin
- Page 125 and 126: 116 Sets, functions, and the contin
- Page 127 and 128: 118 Sets, functions, and the contin
- Page 129 and 130: 120 In praise of inequalities For n
- Page 131 and 132: 122 In praise of inequalities We fi
- Page 133 and 134: 124 In praise of inequalities Apply
- Page 136 and 137: The fundamental theorem of algebra
- Page 138: The fundamental theorem of algebra
- Page 141 and 142: 132 One square and an odd number of
- Page 143 and 144: 134 One square and an odd number of
- Page 145 and 146: 136 One square and an odd number of
- Page 147 and 148: 138 One square and an odd number of
- Page 149 and 150: 140 A theorem of Pólya on polynomi
- Page 151 and 152: 142 A theorem of Pólya on polynomi
- Page 153 and 154: 144 A theorem of Pólya on polynomi
- Page 155 and 156: 146 On a lemma of Littlewood and Of
- Page 157 and 158: 148 On a lemma of Littlewood and Of
- Page 159 and 160: 150 Cotangent and the Herglotz tric
- Page 161 and 162:
152 Cotangent and the Herglotz tric
- Page 163 and 164:
154 Cotangent and the Herglotz tric
- Page 165 and 166:
156 Buffon’s needle problem If yo
- Page 167 and 168:
158 Buffon’s needle problem Refer
- Page 170 and 171:
Pigeon-hole and double counting Cha
- Page 172 and 173:
Pigeon-hole and double counting 163
- Page 174 and 175:
Pigeon-hole and double counting 165
- Page 176 and 177:
Pigeon-hole and double counting 167
- Page 178 and 179:
Pigeon-hole and double counting 169
- Page 180:
Pigeon-hole and double counting 171
- Page 183 and 184:
174 Tiling rectangles Since ∫ d
- Page 185 and 186:
176 Tiling rectangles Next comes a
- Page 188 and 189:
Three famous theorems on finite set
- Page 190 and 191:
Three famous theorems on finite set
- Page 192:
Three famous theorems on finite set
- Page 195 and 196:
186 Shuffling cards which is smalle
- Page 197 and 198:
188 Shuffling cards For card player
- Page 199 and 200:
190 Shuffling cards and we have see
- Page 201 and 202:
192 Shuffling cards Bell Labs “Ma
- Page 203 and 204:
194 Shuffling cards k d(k) 1 1.000
- Page 205 and 206:
196 Lattice paths and determinants
- Page 207 and 208:
198 Lattice paths and determinants
- Page 209 and 210:
200 Lattice paths and determinants
- Page 211 and 212:
202 Cayley’s formula for the numb
- Page 213 and 214:
204 Cayley’s formula for the numb
- Page 215 and 216:
206 Cayley’s formula for the numb
- Page 217 and 218:
208 Identities versus bijections th
- Page 219 and 220:
210 Identities versus bijections Eu
- Page 221 and 222:
212 Identities versus bijections Re
- Page 223 and 224:
214 Completing Latin squares 1 2 3
- Page 225 and 226:
216 Completing Latin squares Inequa
- Page 227 and 228:
218 Completing Latin squares In our
- Page 230 and 231:
The Dinitz problem Chapter 33 The f
- Page 232 and 233:
The Dinitz problem 223 To state our
- Page 234 and 235:
The Dinitz problem 225 Claim. When
- Page 236 and 237:
Five-coloring plane graphs Chapter
- Page 238 and 239:
Five-coloring plane graphs 229 For
- Page 240 and 241:
How to guard a museum Chapter 35 He
- Page 242 and 243:
How to guard a museum 233 convex ve
- Page 244 and 245:
Turán’s graph theorem Chapter 36
- Page 246 and 247:
Turán’s graph theorem 237 all ve
- Page 248:
Turán’s graph theorem 239 Case 2
- Page 251 and 252:
242 Communicating without errors se
- Page 253 and 254:
244 Communicating without errors by
- Page 255 and 256:
246 Communicating without errors No
- Page 257 and 258:
248 Communicating without errors
- Page 259 and 260:
250 Communicating without errors Re
- Page 261 and 262:
252 The chromatic number of Kneser
- Page 263 and 264:
254 The chromatic number of Kneser
- Page 266 and 267:
Of friends and politicians Chapter
- Page 268:
Of friends and politicians 259 Now
- Page 271 and 272:
262 Probability makes counting (som
- Page 273 and 274:
264 Probability makes counting (som
- Page 275 and 276:
266 Probability makes counting (som
- Page 277 and 278:
268 Probability makes counting (som
- Page 279 and 280:
About the Illustrations We are happ
- Page 281 and 282:
272 Index division ring, 31 double
- Page 283:
274 Index tangential rectangle, 121