This chapter discusses the study of R (n, a) number of partitions of n for a depending on n, and smaller than λ0, where λ0 is a small positive constant. The tools for that are an estimation for r (n, A), and inequalities involving R (n, a). The following theorem is proved: There exists λ0 > 0, such that uniformly for 1 ≤ a ≤ λ0, one has, when n goes to infinity.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics