On Erdős's method for bounding the partition function

From MaRDI portal



Abstract: For fixed m and Rsubseteq0,1,ldots,m1, take A to be the set of positive integers congruent modulo m to one of the elements of R, and let pA(n) be the number of ways to write n as a sum of elements of A. Nathanson proved that logpA(n)leq(1+o(1))pisqrt2n|R|/3m using a variant of a remarkably simple method devised by ErdH{o}s in order to bound the partition function. In this short note we describe a simpler and shorter proof of Nathanson's bound.











This page was built for publication: On Erdős's method for bounding the partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379610)