Search preferences
Skip to main search results

Search filters

Product Type

  • All Product Types 
  • Books (1)
  • Magazines & Periodicals (No further results match this refinement)
  • Comics (No further results match this refinement)
  • Sheet Music (No further results match this refinement)
  • Art, Prints & Posters (No further results match this refinement)
  • Photographs (No further results match this refinement)
  • Maps (No further results match this refinement)
  • Manuscripts & Paper Collectibles (No further results match this refinement)

Condition

Binding

Collectible Attributes

Language (1)

Price

  • Any Price 
  • Under £ 20 (No further results match this refinement)
  • £ 20 to £ 40 (No further results match this refinement)
  • Over £ 40 
Custom price range (£)

Free Shipping

  • Free Shipping to U.S.A. (No further results match this refinement)

Seller Location

  • R B J T Allenby

    Published by Taylor & Francis Ltd (Sales) Aug 2010, 2010

    ISBN 10: 1420082604 ISBN 13: 9781420082609

    Language: English

    Seller: AHA-BUCH GmbH, Einbeck, Germany

    Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

    Contact seller

    £ 27.63 shipping from Germany to U.S.A.

    Destination, rates & speeds

    Quantity: 2 available

    Add to basket

    Buch. Condition: Neu. Neuware - Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely 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 EditionThis 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 P lya 's counting theorem.