A generalized Hardy-Ramanujan formula for the number of restricted integer partitions

Abstract

We derive the asymptotic formula for pn(N,M), the number of partitions of integer n with part size at most N and length at most M. We consider both N and M are comparable to n. This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…