Skip to main content

Partitions

  • Chapter
  • First Online:
Combinatorics

Part of the book series: Problem Books in Mathematics ((PBM))

  • 3920 Accesses

Abstract

In this chapter we shall consider the representation of a given positive integer as a sum of positive integers, as well as the representation of a given finite set in the form of the union of pairwise disjoint sets. These representations will be called the partitions of positive integers and the partitions of finite sets. We shall be interested in counting the number of partitions that satisfy some additional conditions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 69.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. G.E. Andrews, The Theory of Partitions, Addison-Wesley Publishing Company, London, 1976.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Mladenović, P. (2019). Partitions. In: Combinatorics. Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-00831-4_6

Download citation

Publish with us

Policies and ethics