Skip to main content
SpringerLink
Log in

Some Counting Problems; Multinomial Coefficients, The Principle of Inclusion–Exclusion, Sylvester’s Formula, The Sieve Formula

  • Chapter
  • First Online:
Discrete Mathematics

Part of the book series: Universitext ((UTX))

Abstract

In this section, we consider some simple counting problems. Let us begin with permutations. Recall that a permutation of a set A is any bijection between A and itself.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Claude Berge. Principles of Combinatorics. New York: Academic Press, first edition, 1971.

    Google Scholar 

  2. J. Cameron, Peter. Combinatorics: Topics, Techniques, Algorithms. Cambridge, UK: Cambridge University Press, first edition, 1994.

    Google Scholar 

  3. John H. Conway and Richard K. Guy, The Book of Numbers. Copernicus, New York: Springer-Verlag, first edition, 1996.

    Google Scholar 

  4. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: A Foundation For Computer Science. Reading, MA: Addison Wesley, second edition, 1994.

    Google Scholar 

  5. L. Lovász, J. Pelikán, and K. Vesztergombi. Discrete Mathematics. Elementary and Beyond. Undergraduate Texts in Mathematics. New York: Springer, first edition, 2003.

    Google Scholar 

  6. Jiri Matousek. Lectures on Discrete Geometry. GTM No. 212. New York: Springer Verlag, first edition, 2002.

    Google Scholar 

  7. Richard P. Stanley. Enumerative Combinatorics, Vol. I. Cambridge Studies in Advanced Mathematics, No. 49. Cambridge UK: Cambridge University Press, first edition, 1997.

    Google Scholar 

  8. J.H. van Lint and R.M. Wilson. A Course in Combinatorics. Cambridge UK: Cambridge University Press, second edition, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut Street, 19104, Philadelphia, PA, USA

    Jean Gallier

Authors
  1. Jean Gallier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean Gallier .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gallier, J. (2011). Some Counting Problems; Multinomial Coefficients, The Principle of Inclusion–Exclusion, Sylvester’s Formula, The Sieve Formula. In: Discrete Mathematics. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8047-2_4

Download citation

Publish with us

Policies and ethics

Search

Navigation