Image of How to Count: An Introduction to Combinatorics and Its Applications
Bookmark Share

Text

How to Count: An Introduction to Combinatorics and Its Applications

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.

Availability

No copy data

Detail Information
Series Title
-
Call Number
510 BEE h
Publisher
: .,
Collation
XV, 361
Language
English
ISBN/ISSN
978-3-319-13843-5
Classification
510
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
-
Subject(s)
Discrete Mathematics
Specific Detail Info
-
Statement of Responsibility
Other Information
Cataloger
Khusnun
Source
-
Validator
-
Other version/related

No other version available

File Attachment
Comments
You must be logged in to post a comment