Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Online ordering will be unavailable from 07:00 GMT to 17:00 GMT on Sunday, June 15.

To place an order, please contact Customer Services.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Recommended product

Popular links

Popular links


Combinatorics: A Problem Oriented Approach

Combinatorics: A Problem Oriented Approach

Combinatorics: A Problem Oriented Approach

Daniel A. Marcus , California State Polytechnic University, Pomona
January 1999
This item is not supplied by Cambridge University Press in your region. Please contact Mathematical Association of America for availability.
Paperback
9780883857106

Looking for an inspection copy?

This title is not currently available for inspection.

£30.99
GBP
Paperback

    The format of this book is unique in that it combines features of a traditional text with those of a problem book. The material is presented through a series of problems, about 250 in all, with connecting text; this is supplemented by a further 250 problems suitable for homework assignment. The problems are structured in order to introduce concepts in a logical order, and in a thought-provoking way. The first four sections of the book deal with basic combinatorial entities; the last four cover special counting methods. Many applications to probability are included along the way. Students from a wide range of backgrounds, mathematics, computer science or engineering will appreciate this appealing introduction.

    • Unique, problem-centered approach
    • 250 problems, with hints plus 250 problems suitable for homework
    • Many applications to probability

    Product details

    January 1999
    Paperback
    9780883857106
    152 pages
    230 × 154 × 13 mm
    0.25kg
    This item is not supplied by Cambridge University Press in your region. Please contact Mathematical Association of America for availability.

    Table of Contents

    • Part I. The Basics:
    • 1. Strings
    • 2. Combinations
    • 3. Distributions
    • 4. Partitions. Part II. Special Counting Methods:
    • 5. Inclusion and exclusion
    • 6. Recurrence relations
    • 7. Generating functions
    • 8. The Polyá-Redfield method.
      Author
    • Daniel A. Marcus , California State Polytechnic University, Pomona