| 000 | 08047nam a2200445 a 4500 | ||
|---|---|---|---|
| 005 | 20260701202233.0 | ||
| 006 | m d | ||
| 007 | cr cnu---uuuuu | ||
| 008 | 180614s2018 s 000 0 eng d | ||
| 020 |
_a9783662572658 _q(electronic bk.) |
||
| 020 |
_a3662572656 _q(electronic bk.) |
||
| 020 |
_a9783662572641 _q(print) |
||
| 040 |
_aCO-CtgCURN _bspa _ccoctgcurn |
||
| 082 | 0 | 4 |
_a510 _223 |
| 100 | 1 |
_aAigner, Martin, _d1942- _eautor. _7http://id.loc.gov/authorities/names/n79018487. |
|
| 245 | 1 | 0 |
_aProofs from THE BOOK _h[electronic resource] / _cby Martin Aigner, Gúnter M. Ziegler. |
| 250 | _aSexta edicion. | ||
| 260 | 4 |
_aBerlin, Heidelberg : : : _bSpringer,,, _c2018. |
|
| 260 | 1 | _c2018. | |
| 300 |
_a1 recurso en línea (VIII, 326 p.) : _bonline resource. |
||
| 336 |
_atexto _btxt _2rdacontent |
||
| 337 |
_acomputador _bc _2rdamedia |
||
| 338 |
_arecurso en línea _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 504 | _aIncluye referencias bibliográficas e índice. | ||
| 520 | _aEsta sexta edición revisada y ampliada de Proofs de THE BOOK presenta un capítulo completamente nuevo sobre la conjetura permanente de Van der Waerden, así como pruebas adicionales, altamente originales y deliciosas en otros capítulos. De la cita con motivo del "Premio Steele de exposición matemática" de 2018" Es casi imposible escribir un libro de matemáticas que pueda ser leído y disfrutado por personas de todos los niveles y orígenes, sin embargo, Aigner y Ziegler logran esta hazaña de exposición con un estilo virtuoso. [...] Este libro ofrece un servicio invaluable a las matemáticas, al ilustrar para los no matemáticos lo que los matemáticos quieren decir cuando hablan de belleza " | ||
| 650 | 0 | _aMatemáticas. | |
| 650 | 0 |
_aCiencias de la computación _xMatemáticas. |
|
| 650 | 0 | _aAnálisis matemático. | |
| 650 | 0 | _aGeometria. | |
| 650 | 0 | _aTeoría de los números. | |
| 650 | 0 | _aAnálisis combinatorio. | |
| 700 | 1 |
_aZiegler, Gúnter M., _eautor. |
|
| 852 |
_aMHC _bMHC _cCF _h510 _iA289 |
||
| 856 | 7 |
_uhttps://unicurn.sharepoint.com/:b:/s/biblioteca/Eb4MXSC86n5EqDU0UeqX9l0BOW1A4dyBsmTDq7bL3Pksyg?e=dOebJp _z<img src="/screens/gifs/go4.gif" alt="Go button" border="0" width="21" height="21" hspace="7" align=middle"> Vea este libro electrónico |
|
| 880 |
_6505-00/(S _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. Van der Waerden's permanent conjecture -- 25. On a lemma of Littlewood and Offord -- 26. Cotangent and the Herglotz trick -- 27. Buffon's needle problem -- Combinatorics: 28. Pigeon-hole and double counting -- 29. Tiling rectangles -- 30. Three famous theorems on finite sets -- 31. Shuffling cards -- 32. Lattice paths and determinants -- 33. Cayley's formula for the number of trees -- 34. Identities versus bijections -- 35. The finite Kakeya problem -- 36. Completing Latin squares -- Graph Theory: 37. Permanents and the power of entropy -- 38. The Dinitz problem -- 39. Five-coloring plane graphs -- 40. How to guard a museum -- 41. Turán's graph theorem -- 42. Communicating without errors -- 43. The chromatic number of Kneser graphs -- 44. Of friends and politicians -- 45. Probability makes counting (sometimes) easy -- About the Illustrations -- Index |
||
| 917 | 9 | 9 | _aThis revised and enlarged sixth edition of Proofs from THE BOOK features an entirely new chapter on Van der Waerden's permanent conjecture, as well as additional, highly original and delightful proofs in other chapters. From the citation on the occasion of the 2018 "Steele Prize for Mathematical Exposition" " ... It is almost impossible to write a mathematics book that can be read and enjoyed by people of all levels and backgrounds, yet Aigner and Ziegler accomplish this feat of exposition with virtuoso style. ... This book does an invaluable service to mathematics, by illustrating for non-mathematicians what it is that mathematicians mean when they speak about beauty." From the Reviews " ... Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. ... Aigner and Ziegler ... write: " ... all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ..." Notices of the AMS, August 1999 " ... This book is a pleasure to hold and to look at: ample margins, nice photos, instructive pictures and beautiful drawings ... It is a pleasure to read as well: the style is clear and entertaining, the level is close to elementary, the necessary background is given separately and the proofs are brilliant. ..." LMS Newsletter, January 1999 "Martin Aigner and G©ơnter Ziegler succeeded admirably in putting together a broad collection of theorems and their proofs that would undoubtedly be in the Book of Erd©œs. The theorems are so fundamental, their proofs so elegant and the remaining open questions so intriguing that every mathematician, regardless of speciality, can benefit from reading this book. ..." SIGACT News, December 2011 |
| 917 | 7 | 7 | _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. Van der Waerden's permanent conjecture -- 25. On a lemma of Littlewood and Offord -- 26. Cotangent and the Herglotz trick -- 27. Buffon's needle problem -- Combinatorics: 28. Pigeon-hole and double counting -- 29. Tiling rectangles -- 30. Three famous theorems on finite sets -- 31. Shuffling cards -- 32. Lattice paths and determinants -- 33. Cayley's formula for the number of trees -- 34. Identities versus bijections -- 35. The finite Kakeya problem -- 36. Completing Latin squares -- Graph Theory: 37. Permanents and the power of entropy -- 38. The Dinitz problem -- 39. Five-coloring plane graphs -- 40. How to guard a museum -- 41. Turán's graph theorem -- 42. Communicating without errors -- 43. The chromatic number of Kneser graphs -- 44. Of friends and politicians -- 45. Probability makes counting (sometimes) easy -- About the Illustrations -- Index |
| 942 |
_cCF _h510 _iA289 _2ddc |
||
| 999 |
_c29631 _d29631 |
||