Introductory Combinatorics (Classic Version): Math Classics
Autor Richard A. Brualdien Limba Engleză Paperback – 12 feb 2017
This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. Please visitwww.pearsonhighered.com/math-classics-seriesfor a complete list of titles.
This trusted best-seller covers the key combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The 5th Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises. "
Preț: 665.08 lei
Preț vechi: 782.45 lei
-15% Nou
Puncte Express: 998
Preț estimativ în valută:
127.30€ • 138.33$ • 107.00£
127.30€ • 138.33$ • 107.00£
Carte disponibilă
Livrare economică 31 martie-14 aprilie
Livrare express 15-21 martie pentru 40.40 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780134689616
ISBN-10: 0134689615
Pagini: 624
Dimensiuni: 178 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:5
Editura: Pearson
Seria Math Classics
ISBN-10: 0134689615
Pagini: 624
Dimensiuni: 178 x 235 x 30 mm
Greutate: 0.79 kg
Ediția:5
Editura: Pearson
Seria Math Classics
Cuprins
- 1. What is Combinatorics?
- 2. The Pigeonhole Principle
- 3. Permutations and Combinations
- 4. Generating Permutations and Combinations
- 5. The Binomial Coefficients
- 6. The Inclusion-Exclusion Principle and Applications
- 7. Recurrence Relations and Generating Functions
- 8. Special Counting Sequences
- 9. Systems of Distinct Representatives
- 10. Combinatorial Designs
- 11. Introduction to Graph Theory
- 12. More on Graph Theory
- 13. Digraphs and Networks
- 14. Pólya Counting