How to Count: An Introduction to Combinatorics and Its Applications

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the Multiplication Principle. To this end, exercise sets are included at the end of every section, ranging from simple computations (evaluate a formula for a given set of values) to more advanced proofs. The exercises are designed to test students' understanding of new material, while reinforcing a working mastery of the key concepts previously developed in the book. Intuitive descriptions for many abstract techniques are included. Students often struggle with certain topics, such as generating functions, and this intuitive approach to the problem is helpful in their understanding. When possible, the book introduces concepts using combinatorial methods (as opposed to induction or algebra) to prove identities. Students are also asked to prove identities using combinatorial methods as part of their exercises. These methods have several advantages over induction or algebra.

Author(s): Robert A. Beeler (auth.)
Edition: 1
Publisher: Springer International Publishing
Year: 2015

Language: English
Pages: 361
Tags: Combinatorics; Probability Theory and Stochastic Processes

Front Matter....Pages i-xv
Preliminaries....Pages 1-20
Basic Counting....Pages 21-57
The Binomial Coefficient....Pages 59-94
Distribution Problems....Pages 95-114
Generating Functions....Pages 115-146
Recurrence Relations....Pages 147-194
Advanced Counting—Inclusion and Exclusion....Pages 195-218
Advanced Counting—Pólya Theory....Pages 219-255
Application: Probability....Pages 257-289
Application: Combinatorial Designs....Pages 291-307
Application: Graph Theory....Pages 309-343
Back Matter....Pages 345-361