000			03194nam a22003495i 4500
001			324090
003			MX-SnUAN
005			20160429161700.0
007			cr nn 008mamaa
008			160111s2014 gw | s |||| 0|eng d
020			_a9783662442050 _9978-3-662-44205-0
035			_avtls000424077
039		9	_y201601111048 _zstaff
050		4	_aQA1-939
100	1		_aAigner, Martin, _eautor. _9322066
245	1	0	_aProofs from the book / _cMartin Aigner, Günter M. Ziegler.
250			_a5th ed. 2014.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bSpringer, _c2014.
300			_aviii, 308 páginas : _b255 ilustraciones, 9 ilustraciones en color.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
500			_aSpringer eBooks
505	0		_aNumber Theory: 1. Six proofs of the infinity of primes -- 2. Bertrand’s postulate -- 3. Binomial coefficients are (almost) never powers -- 4. Representing numbers as sums of two squares -- 5. The law of quadratic reciprocity -- 6. Every finite division ring is a field -- 7. The spectral theorem and Hadamard’s determinant problem -- 8. Some irrational numbers -- 9. Three times ?2/6 -- Geometry: 10. Hilbert’s third problem: decomposing polyhedral -- 11. Lines in the plane and decompositions of graphs -- 12. The slope problem -- 13. Three applications of Euler’s formula -- 14. Cauchy’s rigidity theorem -- 15. The Borromean rings don’t exist -- 16. Touching simplices -- 17. Every large point set has an obtuse angle -- 18. Borsuk’s conjecture -- Analysis: 19. Sets, functions, and the continuum hypothesis -- 20. In praise of inequalities -- 21. The fundamental theorem of algebra -- 22. One square and an odd number of triangles -- 23. A theorem of Pólya on polynomials -- 24. On a lemma of Littlewood and Offord -- 25. Cotangent and the Herglotz trick -- 26. Buffon’s needle problem -- Combinatorics: 27. Pigeon-hole and double counting -- 28. Tiling rectangles -- 29. Three famous theorems on finite sets -- 30. Shuffling cards -- 31. Lattice paths and determinants -- 32. Cayley’s formula for the number of trees -- 33. Identities versus bijections -- 34. The finite Kakeya problem -- 35. Completing Latin squares -- Graph Theory: 36. The Dinitz problem -- 37. Permanents and the po wer of entropy -- 38. Five-coloring plane graphs -- 39. How to guard a museum -- 40. Turán’s graph theorem -- 41. Communicating without errors -- 42. The chromatic number of Kneser graphs -- 43. Of friends and politicians -- 44. Probability makes counting (sometimes) easy -- About the Illustrations -- Index.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aZiegler, Günter M, _eautor. _9322067
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783662442043
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-662-44205-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c324090 _d324090