How to Count : an Introduction to Combinatorics, Second Edition.

What's It All About? What Is Combinatorics? Classic Problems What You Need to Know Are You Sitting Comfortably? Permutations and Combinations The Combinatorial Approach Permutations CombinationsApplications to Probability Problems The Multinomial Theorem Permutations and Cycles Occupancy Proble...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Allenby, R. B. J. T.
Otros Autores: Slomson, Alan
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Hoboken : CRC Press, 2010.
Edición:2nd ed.
Colección:Discrete mathematics and its applications.
Temas:
Combinatorial analysis.
Analyse combinatoire.
Combinatorial analysis
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Mi 4500
001 EBOOKCENTRAL_ocn908079516
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |n|||||||||
008 150509s2010 xx o 000 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d OCLCO  |d OCLCQ  |d YDXCP  |d OCLCQ  |d MERUC  |d AU@  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
020 |a 9781439895153 
020 |a 1439895155 
029 1 |a AU@  |b 000056086541 
029 1 |a AU@  |b 000062535147 
035 |a (OCoLC)908079516 
050 4 |a QA164 .S57 2010 
082 0 4 |a 511.6  |a 511/.6 
049 |a UAMI 
100 1 |a Allenby, R. B. J. T. 
245 1 0 |a How to Count :  |b an Introduction to Combinatorics, Second Edition. 
250 |a 2nd ed. 
260 |a Hoboken :  |b CRC Press,  |c 2010. 
300 |a 1 online resource (440 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Discrete Mathematics and Its Applications 
588 0 |a Print version record. 
505 0 |a Front cover; Table of Contents; Preface to the Second Edition; Acknowledgments; Authors; Chapter 1. What's It All About?; Chapter 2. Permutations and Combinations; Chapter 3. Occupancy Problems; Chapter 4. The Inclusion-Exclusion Principle; Chapter 5. Stirling and Catalan Numbers; Chapter 6. Partitions and Dot Diagrams; Chapter 7. Generating Functions and Recurrence Relations; Chapter 8. Partitions and Generating Functions; Chapter 9. Introduction to Graphs; Chapter 10. Trees; Chapter 11. Groups of Permutations; Chapter 12. Group Actions; Chapter 13. Counting Patterns. 
505 8 |a Chapter 14. Pólya CountingChapter 15. Dirichlet's PigeonholePrinciple; Chapter 16. Ramsey Theory; Chapter 17. Rook Polynomials and Matchings; Solutions to the A Exercises; Books for Further Reading; Index of Notation; Back cover. 
520 |a What's It All About? What Is Combinatorics? Classic Problems What You Need to Know Are You Sitting Comfortably? Permutations and Combinations The Combinatorial Approach Permutations CombinationsApplications to Probability Problems The Multinomial Theorem Permutations and Cycles Occupancy Problems Counting the Solutions of Equations New Problems from Old A ""Reduction"" Theorem for the Stirling Numbers The Inclusion-Exclusion Principle Double Counting Derangements A Formula for the Stirling NumbersStirling and Catalan Numbers Stirling Numbers Permutations and Stirling Numbers Catalan Numbers Pa. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Combinatorial analysis. 
650 6 |a Analyse combinatoire. 
650 7 |a Combinatorial analysis  |2 fast 
700 1 |a Slomson, Alan. 
758 |i has work:  |a How to Count (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCXJ9TbMQ6BVkx6rH8vM49C  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Allenby, R.B.J.T.  |t How to Count : An Introduction to Combinatorics, Second Edition.  |d Hoboken : CRC Press, ©2010  |z 9781420082609 
830 0 |a Discrete mathematics and its applications. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1648349  |z Texto completo 
938 |a EBL - Ebook Library  |b EBLB  |n EBL1648349 
938 |a YBP Library Services  |b YANK  |n 12368242 
994 |a 92  |b IZTAP 

Ejemplares similares