How to Count - An Introduction to Combinatorics and Its Applications (Paperback, Softcover reprint of the original 1st ed. 2015)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Release date:	October 2016
First published:	2015
Authors:	Robert A Beeler
Dimensions:	235 x 155 x 24mm (L x W x T)
Format:	Paperback
Pages:	361
Edition:	Softcover reprint of the original 1st ed. 2015
ISBN-13:	978-3-319-35508-5
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Promotions
LSN:	3-319-35508-2
Barcode:	9783319355085

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!