Extension of Ramanujan's congruences for the partition function modulo powers of 5 (Q2769334)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extension of Ramanujan's congruences for the partition function modulo powers of 5 |
scientific article; zbMATH DE number 1701229
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extension of Ramanujan's congruences for the partition function modulo powers of 5 |
scientific article; zbMATH DE number 1701229 |
Statements
Extension of Ramanujan's congruences for the partition function modulo powers of 5 (English)
0 references
5 February 2002
0 references
extension of Ramanujan's congruences
0 references
number of partitions
0 references
congruences
0 references
As usual, let \(p(N)\) denote the number of partitions of a non-negative integer \(N\). Ramanujan proved (and Watson reproved) that if \(j\geq 1\) is a positive integer, then for every \(N\) we have NEWLINE\[NEWLINEp\bigl(5^jN+ \beta_5(j) \bigr) \equiv 0\pmod{5^j}NEWLINE\]NEWLINE where \(\beta_5(j): =1/24\pmod{5^j}\). Many have questioned the optimality of these congruences. Are there arithmetic subprogressions of \(5^jN+ \beta_5(j)\), other than those found by Ramanujan, for which the congruence modulo \(5^j\) is a congruence modulo \(5^{j+1}\)? Moreover, are there systematic families of such congruences which are themselves analogous to Ramanujan's original congruences above? We answer both questions in the affirmative by explicitly exhibiting infinitely many such systematic extensions. As an example, we show that if \(j\geq 1\), then for every non-negative integer \(N\) we have NEWLINE\[NEWLINEp\bigl(5^j\cdot 13^3N+5^j\cdot 13^2+\gamma(j)\bigr)\equiv 0\pmod {5^{j +1}}NEWLINE\]NEWLINE where NEWLINE\[NEWLINE\gamma(j): =\begin{cases} (3211\cdot 5^j+1)/24\quad &\text{if }j\text{ is odd},\\ (3887\cdot 5^j+1)/24 \quad &\text{if }j\text{ is even}\end{cases}.NEWLINE\]
0 references