A generalized Hardy-Ramanujan formula for the number of restricted integer partitions
classification
🧮 math.CO
math.NT
keywords
formulahardy-ramanujanintegernumberpartitionsasymptoticclassicalcomparable
read the original abstract
We derive the asymptotic formula for $p_n(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 $\sqrt{n}$. This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.