On Erdos's elementary method in the asymptotic theory of partitions
Abstract
Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let pA(n) denote the number of partitions of n into parts belonging to A. We obtain the asymptotic formula log pA(n) ~ π (2rn/3m). The proof is based on Erdos's elementary method to obtain the asymptotic formula for the usual partition function p(n).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.