The Ramanujan Journal

, Volume 18, Issue 1, pp 113–119

Simple upper bounds for partition functions


DOI: 10.1007/s11139-007-9022-z

Cite this article as:
de Azevedo Pribitkin, W. Ramanujan J (2009) 18: 113. doi:10.1007/s11139-007-9022-z


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.


Partitions Dilogarithm 

Mathematics Subject Classification (2000)


Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of Mathematics, College of Staten IslandCUNYStaten IslandUSA

Personalised recommendations