Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

How to Count: An Introduction to Combinatorics and Its Applications

by Robert A. Beeler
Save 35% Save 35%
Current price ₹4,407.00
Original price ₹6,779.00
Original price ₹6,779.00
Original price ₹6,779.00
(-35%)
₹4,407.00
Current price ₹4,407.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783319355085
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 361
  • Original Price: EUR 59.99
  • Language: English
  • Edition: Softcover Repri
  • Item Weight: 539 grams
  • BISAC Subject(s): Combinatorics, Probability & Statistics / General, and Discrete Mathematics

From the Back Cover

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.

Robert A. Beeler is an Associate Professor of Mathematics at East Tennessee State University. His research interests include enumerative combinatorics and graph theory; edge decompositions of graphs, graceful labelings on graphs, intersection/representation theory, and combinatorial designs; combinatorial games and games on graphs. He is a member of the Mathematics Association of America, the American Mathematical Society, and the Institute of Combinatorics and its Applications.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us