BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications)

How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications)

How to Count: An Introduction to Combinatorics, Second Edition (Discrete
Stock photo: cover may vary

How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications) Hardback - 2010 - 2nd Edition

by Allenby, R.B.J.T.; Slomson, Alan

Add to wish list
  • Used
New

Description

like new.
Ask the seller a question Add to wish list
A$161.79
A$5.82 Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Ships from GreatBookPrices (Maryland, United States)
The BIBLIO Guarantee

Details

  • Title How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications)
  • Author Allenby, R.B.J.T.; Slomson, Alan
  • Binding Hardback
  • Edition number 2nd
  • Edition 2
  • Condition New
  • Pages 446
  • Volumes 1
  • Language ENG
  • Publisher CRC Press
  • Publication date 2010-08-13
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # 6751801
  • ISBN 9781420082609 / 1420082604
  • Weight 2.11 lbs (0.96 kg)
  • Dimensions 10 x 7 x 1 in (25.40 x 17.78 x 2.54 cm)
  • Category Mathematics
  • Library of Congress subjects Combinatorial analysis
  • Library of Congress Catalogue Number 2010024420
  • Dewey Decimal Code 511.6
  • Quantity available 5

About GreatBookPrices Maryland, United States

Biblio member since 2024

Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GreatBookPrices

Reader reviews for How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications)

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Emphasizes a Problem Solving Approach
A first course in combinatorics

Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.

New to the Second Edition
This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises.

Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Plya's counting theorem.

Media reviews

Citations

  • Scitech Book News, 12/01/2010, Page 29

About the author

Alan Slomson taught mathematics at the University of Leeds from 1967 to 2008. He is currently the secretary of the United Kingdom Mathematics Trust.

R.B.J.T. Allenby taught mathematics at the University of Leeds from 1965 to 2007.

Please wait a moment while we load the requested page.

tracking-