Simple upper bounds for partition functions
- First Online:
- Cite this article as:
- de Azevedo Pribitkin, W. Ramanujan J (2009) 18: 113. doi:10.1007/s11139-007-9022-z
- 274 Downloads
We tweak Siegel’s method to produce a rather simple proof of a new upper bound on the number of partitions of an integer into an exact number of parts. Our approach, which exploits the delightful dilogarithm function, extends easily to numerous other counting functions.