Abstract
How many ways can you write a number as a sum of smaller numbers? This simple question is not as easy to answer as you might think. The study of integer partitions has a long history in Number Theory and Combinatorics, with contributions from Leonhard Euler, Srinivasa Ramanujan, Godfrey Harold Hardy, and more recently George Andrews and Ken Ono. In this chapter we will ask some of the first questions about counting partitions.
“Die ganzen Zahlen hat der liebe Gott gemacht, alles andere ist Menschenwerk” (“God made the integers, all else is the work of man.”)
–Leopold Kronecker
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Petersen, T.K. (2019). Some partition theory. In: Inquiry-Based Enumerative Combinatorics. Undergraduate Texts in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-18308-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-18308-0_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18307-3
Online ISBN: 978-3-030-18308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)