1 Introduction
A partition of a positive integer n is a nonincreasing sequence of positive integers whose sum is n. Let
$p(n)$
denote the number of partitions of n, with the generating function
$$ \begin{align*}\sum\limits_{n\geq0}p(n)q^n=\frac1{f_1}.\end{align*} $$
Here and throughout the paper,
$$ \begin{align*}f_r:=(q^r;q^r)_\infty=\prod\limits_{m=1}^{\infty}(1-q^{rm}).\end{align*} $$
Ramanujan [Reference Ramanujan, Hardy, Seshu Aiyar and Wilson2] conjectured and Watson [Reference Watson5] proved that
where
$k\geq 1$
and
$\delta _k$
is the reciprocal modulo
$5^k$
of
$24$
. Hirschhorn and Hunt [Reference Hirschhorn and Hunt1] proved (1.1) by establishing generating functions
$$ \begin{align} \sum_{n\geq 0}p(5^{2k-1}n+\delta_{2k-1})q^n=\sum_{j\geq 1}x_{2k-1,j} \, q^{j-1}\frac{f_5^{6j-1}}{f_1^{6j}} \end{align} $$
and
$$ \begin{align*} \sum_{n\geq 0}p(5^{2k}n+\delta_{2k})q^n=\sum_{j\geq 1}x_{2k,j} \, q^{j-1}\frac{f_5^{6j}}{f_1^{6j+1}}, \end{align*} $$
where the coefficient vectors
$\mathbf {x}_k= (x_{k,1}, x_{k,2},\ldots )$
are given by
and for
$k\geq 1$
,
$$ \begin{align*} x_{k+1, i}=\begin{cases} \displaystyle \sum_{j\geq1} x_{k, j} \,m_{6j,j+i} & \text{if } k\,\,\text{is odd},\\[12pt] \displaystyle \sum_{j\geq1}x_{k, j} \,m_{6j+1,j+i} & \text{if } k \,\,\text{is even}, \end{cases} \end{align*} $$
where the first five rows of
$M=(m_{i,j})_{i,j\geq 1}$
are
$$ \begin{align*}\begin{bmatrix} 5 & 0 & 0 & 0& 0& 0&\cdots\\ 2\times 5 & 5^3 & 0 &0 &0 & 0& \cdots\\ 9 & 3\times5^3 & 5^5 &0 &0 & 0& \cdots\\ 4 & 22\times5^2 & 4\times5^5 &5^7 &0 & 0& \cdots\\ 1 & 4\times5^3 & 8\times5^5 &5^8 &5^9 & 0& \cdots \end{bmatrix}\end{align*} $$
and, for
$i\geq 6$
,
$m_{i,1}=0$
, and for
$j\geq 2$
,
For any positive integer
$\ell $
, a partition is called
$\ell $
-regular if none of its parts is divisible by
$\ell $
. Let
$b_\ell (n)$
denote the number of
$\ell $
-regular partitions of n; its generating function is given by
$$ \begin{align} \sum\limits_{n\geq0}b_\ell(n)q^n=\frac{f_\ell}{f_1}. \end{align} $$
In [Reference Wang4], Wang derived congruences for
$5$
-regular partitions analogous to (1.1). He proved that, for each
$n,\beta \geq 0$
,
and
Ranganatha [Reference Ranganatha3] extended these results to
$25$
-regular partitions: for each
$n,\beta \geq 0$
,
We establish congruences for
$5^k$
-regular partitions for all positive integers k. The congruences previously derived by Wang and Ranganatha can be seen as specific instances of these results. The main results are stated in the following theorem.
Theorem 1.1. For each
$n,\beta \geq 0$
and
$k\geq 1$
,
and
where
$r\in \{11,17,23,29\}.$
If we put
$k=1$
in (1.7) and (1.9), we obtain congruences (1.4) and (1.5), respectively, and putting
$k=1$
in (1.8) gives congruence (1.6).
2 Preliminaries
In this section, we state some lemmas which play a vital role in proving our results. Let H be the ‘huffing’ operator modulo
$5$
, that is,
Lemma 2.1 [Reference Hirschhorn and Hunt1].
If
$G= {f_5^6}/{q^4 f_1 f_{25}^5}$
and
$u = {f_5^6}/{q^5 f_{25}^6}$
, then
$$ \begin{align} H ( G^i ) = \sum_{j=1}^{i} m_{i,j} u^{i-j}. \end{align} $$
Lemma 2.2. For all
$i\geq 1$
,
$$ \begin{align} H \bigg( q^{i} \frac{f_{5}^{6i-5}}{f_1^{6i-5}} \bigg) & = \sum_{j=1}^{5i-4} m_{6i-5,i+j-1} q^{5j} \frac{f_{25}^{6j-1}}{f_5^{6j-1}},\end{align} $$
$$ \begin{align} H \bigg( q^{i-1} \frac{f_{5}^{6i-1}}{f_1^{6i-1}} \bigg) & = \sum_{j=1}^{5i} m_{6i-1,i+j-1} \, q^{5j-5} \frac{f_{25}^{6j-5}}{f_5^{6j-5}} \end{align} $$
$$ \begin{align} H \bigg( q^{i} \frac{f_{5}^{6i}}{f_1^{6i}} \bigg) & = \sum_{j=1}^{5i} m_{6i, i+j} \, q^{5j} \frac{f_{25}^{6j}}{f_5^{6j}}, \end{align} $$
$$ \begin{align} H \bigg( q^{i+1} \frac{f_{5}^{6i+1}}{f_1^{6i+1}} \bigg) & = \sum_{j=1}^{5j+1} m_{6i+1, i+j} \,q^{5j} \frac{f_{25}^{6j-1}}{f_5^{6j-1}}. \end{align} $$
Proof. We can rewrite (2.1) as
$$ \begin{align} H \bigg( q^i \frac{f_{25}^i}{f_1^i} \bigg) = \sum_{j=1}^{i} m_{i,j} \, q^{5j} \frac{f_{25}^{6j}}{f_5^{6j}}. \end{align} $$
From (2.6) and the fact that
$m_{6i-5, j}=0$
for
$1\leq j < i,$
$$ \begin{align*} H\bigg(\bigg(q\frac{f_{25}}{f_1}\bigg)^{6i-5}\bigg)&=\sum_{j=i}^{6i-5} m_{6i-5,j} \,q^{5j} \frac{f_{25}^{6j}}{f_{5}^{6j}} =\sum_{j=1}^{5i-4} m_{6i-5,j+i-1} \,q^{5j+5i-5} \frac{f_{25}^{6j+6i-6}}{f_{5}^{6j+6i-6}}, \end{align*} $$
3 Generating functions
In this section, we establish generating functions for
$b_{5^{\ell }}(n)$
within specific arithmetic progressions.
Theorem 3.1. For each
$\beta \geq 0$
and
$k\geq 1$
,
$$ \begin{align} \sum_{n\geq 0}b_{5^{2k-1}}\bigg(5^{2k+2\beta-1}n+\frac{4\cdot5^{2k+2\beta}-5^{2k-1}+1}{24}\bigg)q^n=\sum_{i\geq 1}y^{(2k-1)}_{2\beta+1,i} \, q^{i-1}\frac{f_5^{6i-1}}{f_1^{6i-1}} \end{align} $$
and
$$ \begin{align} \sum_{n\geq 0}b_{5^{2k-1}}\bigg(5^{2k+2\beta}n+\frac{4\cdot5^{2k+2\beta}-5^{2k-1}+1}{24}\bigg)q^n=\sum_{i\geq 1}y^{(2k-1)}_{2\beta+2,i} \, q^{i-1}\frac{f_5^{6i-5}}{f_1^{6i-5}}, \end{align} $$
where the coefficient vectors are defined by
and
$$ \begin{align*} y^{(2k-1)}_{\beta+1,j}= \begin{cases} \displaystyle \sum_{i\geq1}y^{(2k-1)}_{\beta,i} m_{6i-1,j+i-1} & \text{if }\beta\text{ is odd},\\[15pt] \displaystyle \sum_{i\geq1}y^{(2k-1)}_{\beta,i}m_{6i-5,j+i-1} & \text{if }\beta\text{ is even}, \end{cases} \end{align*} $$
for all
$\beta , j\geq 1$
.
Proof. From (1.3),
Extracting the terms involving
$q^{5^{2k-1}n+\delta _{2k-1}}$
on both sides of (3.3) and dividing throughout by
$q^{\delta _{2k-1}}$
,
If we replace
$q^{5^{2k-1}}$
by q and use (1.2),
$$ \begin{align*} \sum\limits_{n\geq0}b_{5^{2k-1}}(5^{2k-1}n+\delta_{2k-1})q^n=\sum_{j\geq 1}x_{2k-1,j} \, q^{j-1}\frac{f_5^{6j-1}}{f_1^{6j-1}}, \end{align*} $$
which is the case
$\beta =0$
of (3.1).
We now assume that (3.1) is true for some integer
$\beta \geq 0$
. Applying the operator H to both sides, by (2.3),
$$ \begin{align*} \sum_{n\geq 0} & b_{5^{2k-1}} \bigg(5^{2k+2\beta}n+\frac{4\cdot5^{2k+2\beta}-5^{2k-1}+1}{24}\bigg)q^{5n} = \sum_{i\geq 1}y^{(2k-1)}_{2\beta+1,i} \, H\bigg(q^{i-1}\frac{f_5^{6i-1}}{f_1^{6i-1}}\bigg) \\&=\sum_{i\geq 1}y^{(2k-1)}_{2\beta+1,i}\sum_{j=1}^{5i} m_{6i-1,i+j-1}\, q^{5j-5} \frac{f_{25}^{6j-5}}{f_5^{6j-5}}\\& =\sum_{j\geq 1}\bigg(\sum_{i\geq1}y^{(2k-1)}_{2\beta+1,i} \, m_{6i-1,i+j-1}\bigg) q^{5j-5} \frac{f_{25}^{6j-5}}{f_5^{6j-5}} =\sum_{j\geq 1}y^{(2k-1)}_{2\beta+2,j} \,q^{5j-5} \frac{f_{25}^{6j-5}}{f_5^{6j-5}}. \end{align*} $$
That is,
$$ \begin{align*} \sum_{n\geq 0}b_{5^{2k-1}}\bigg(5^{2k+2\beta}n+\frac{4\cdot5^{2k+2\beta}-5^{2k-1}+1}{24}\bigg)q^{n}=\sum_{i\geq 1}y^{(2k-1)}_{2\beta+2,i} \, q^{i-1} \frac{f_{5}^{6i-5}}{f_1^{6i-5}}. \end{align*} $$
Hence, if (3.1) is true for some integer
$\beta \geq 0$
, then (3.2) is true for
$\beta $
.
Suppose that (3.2) is true for some integer
$\beta \geq 0$
. Applying the operating H to both sides, by (2.2),
$$ \begin{align*} \sum_{n\geq 0} & b_{5^{2k-1}}\bigg(5^{2k+2\beta+1}n+\frac{4\cdot5^{2k+2\beta+2}-5^{2k-1}+1}{24}\bigg)q^{5n+5}\\&=\sum_{i\geq 1}y^{(2k-1)}_{2\beta+2,i} \sum_{j=1}^{5i-4} m_{6i-5,i+j-1} q^{5j} \, \frac{f_{25}^{6j-1}}{f_5^{6j-1}}\\& =\sum_{j\geq 1}\bigg(\sum_{i\geq1}y^{(2k-1)}_{2\beta+2,i} \, m_{6i-5,i+j-1}\bigg) q^{5j} \frac{f_{25}^{6j-1}}{f_5^{6j-1}} =\sum_{j\geq 1}y^{(2k-1)}_{2\beta+3,j} \, q^{5j} \frac{f_{25}^{6j-1}}{f_5^{6j-1}}, \end{align*} $$
which yields
$$ \begin{align*} \sum_{n\geq 0}b_{5^{2k-1}}\bigg(5^{2k+2\beta+1}n+\frac{4\cdot5^{2k+2\beta+2}-5^{2k-1}+1}{24}\bigg)q^{n}=\sum_{j\geq 1}y^{(2k-1)}_{2\beta+3,j} \, q^{j-1} \frac{f_{5}^{6j-1}}{f_1^{6j-1}}. \end{align*} $$
This is (3.1) with
$\beta $
replaced by
$\beta +1$
. This completes the proof.
Theorem 3.2. For each
$\beta \geq 0$
and
$k\geq 1$
,
$$ \begin{align} \sum_{n\geq 0}b_{5^{2k}}\bigg(5^{2k+\beta-1}(n+1)-\frac{5^{2k}-1}{24}\bigg)q^n=\sum_{i\geq 1}y^{(2k)}_{\beta+1,i}\,q^{i-1}\frac{f_5^{6i}}{f_1^{6i}}, \end{align} $$
where the coefficient vectors are defined by
and
Proof. Equation (1.3) can be written as
Extracting the terms involving
$q^{5^{2k-1}n+\delta _{2k-1}}$
on both sides of the above equation and dividing throughout by
$q^{\delta _{2k-1}}$
,
If we replace
$q^{5^{2k-1}}$
by q and use (1.2),
$$ \begin{align*} \sum\limits_{n\geq0}b_{5^{2k}}(5^{2k-1}n+\delta_{2k-1})q^n=\sum_{j\geq 1}x_{2k-1,j} \, q^{j-1}\frac{f_5^{6j}}{f_1^{6j}}, \end{align*} $$
which is the case
$\beta =0$
of (3.4).
We now assume that (3.4) is true for some integer
$\beta \ge 0$
. Applying the operator H to both sides, by (2.4),
$$ \begin{align*} \begin{split} \sum_{n\geq 0} & b_{5^{2k}}\bigg(5^{2k+\beta}(n+1)-\frac{5^{2k}-1}{24}\bigg)q^{5n+5} \\& =\sum_{i\geq 1}y^{(2k)}_{\beta+1,i}\sum_{j=1}^{5i} m_{6i, i+j} \,q^{5j} \frac{f_{25}^{6j}}{f_5^{6j}} =\sum_{j\geq 1}\bigg(\sum_{i\geq1}y^{(2k)}_{\beta+1,i} \, m_{6i, i+j} \bigg)q^{5j} \frac{f_{25}^{6j}}{f_5^{6j}} =\sum_{j\geq 1}y^{(2k)}_{\beta+2,j}\, q^{5j} \frac{f_{25}^{6j}}{f_5^{6j}}, \end{split} \end{align*} $$
which implies that
$$ \begin{align*} \sum_{n\geq 0}b_{5^{2k}}\bigg(5^{2k+\beta}(n+1)-\frac{5^{2k}-1}{24}\bigg)q^n=\sum_{j\geq 1}y^{(2k)}_{\beta+2,j}q^{j-1} \frac{f_{5}^{6j}}{f_1^{6j}}. \end{align*} $$
So we obtain (3.4) with
$\beta $
replaced by
$\beta +1$
.
4 Proof of the congruences
For a positive integer n, let
$\pi (n)$
be the highest power of
$5$
that divides n and define
$\pi (0)=+\infty $
.
Lemma 4.1 [Reference Hirschhorn and Hunt1, Lemma 4.1].
For each
$i,j\geq 1 $
,
$$ \begin{align*} \pi(m_{i,j})\geq\left[\frac{5j-i-1}{2}\right]. \end{align*} $$
Lemma 4.2 [Reference Hirschhorn and Hunt1, Lemma 4.3].
For each
$k,j\geq 1 $
,
Lemma 4.3. For each
$j,k\geq 1$
and
$\beta \geq 0$
,
and
where
$$ \begin{align*} \delta_{1, j}=\begin{cases} 1&\text{if } j=1,\\ 0 &\text{if } j\neq 1. \end{cases} \end{align*} $$
Proof. In view of Theorem 3.1,
From (4.1), we can see that the inequality (4.2) holds for
$\beta =0$
.
We now assume that (4.2) is true for some
$\beta \geq 0$
. Then,
$$ \begin{align*} \pi\Big(y^{(2k-1)}_{2\beta+2,j}\Big)&\geq \min_{i\geq1}\Big\{\pi\Big(y^{(2k-1)}_{2\beta+1,i}\Big)+\pi(m_{6i-1,i+j-1})\Big\}\\& \geq \min_{i\geq1}\bigg\{2k+\beta-1+\bigg[\frac{5i-5}{2}\bigg]+\bigg[\frac{5j-i-5}{2}\bigg]\bigg\}\\& \geq 2k+\beta-1+\bigg[\frac{5j-6}{2}\bigg]+\delta_{1,j}, \end{align*} $$
which is (4.3). In the last inequality, we have used the fact that
$m_{5,1}=1$
.
Now, suppose (4.3) holds for some
$\beta \geq 0$
. Then,
$$ \begin{align*} \pi\Big(y^{(2k-1)}_{2\beta+3,j}\Big)&\geq \min_{i\geq1}\Big\{\pi\Big(y^{(2k-1)}_{2\beta+2,i}\Big)+\pi(m_{6i-5,i+j-1})\Big\}\\& \geq \min_{i\geq1}\bigg\{2k+\beta-1+\bigg[\frac{5j-i-1}{2}\bigg]\bigg\}\\& \geq 2k+\beta-1+\bigg[\frac{5j-2}{2}\bigg] \geq2k+\beta+\bigg[\frac{5j-5}{2}\bigg], \end{align*} $$
which is (4.2) with
$\beta +1$
for
$\beta $
. This completes the proof.
Lemma 4.4. For each
$j,k\geq 1$
and
$\beta \geq 0$
,
Proof. In view of Theorem 3.2,
From (4.1), we can see that (4.4) holds for
$\beta =0$
. Now, assume that (4.4) is true for some
$\beta \geq 0$
. Then,
$$ \begin{align*} \pi\Big(y^{(2k)}_{\beta+2,j}\Big)&\geq \min_{i\geq1}\Big\{\pi\Big(y^{(2k)}_{\beta+1,i}\Big)+\pi(m_{6i,i+j})\Big\}\\& \geq \min_{i\geq1}\bigg\{2k+\beta-1+\bigg[\frac{5i-5}{2}\bigg]+\bigg[\frac{5j-i-1}{2}\bigg]\bigg\}\\& \geq 2k+\beta-1+\bigg[\frac{5j-2}{2}\bigg]\\& = 2k+\beta+\bigg[\frac{5j-4}{2}\bigg] \geq 2k+\beta+\bigg[\frac{5j-5}{2}\bigg], \end{align*} $$
which is (4.4) with
$\beta +1$
for
$\beta $
. This completes the proof.
Proof of Theorem 1.1.
Congruence (1.7) follows from (4.2) together with (3.1), and congruence (1.8) follows from (4.4) and (3.4).
In view of (4.2), we can express (3.1) as
$$ \begin{align*} \sum_{n\geq 0}b_{5^{2k-1}}\bigg(5^{2k+2\beta-1}n+\frac{4\cdot5^{2k+2\beta}-5^{2k-1}+1}{24}\bigg)q^n\equiv y^{(2k-1)}_{2\beta+1,1}\frac{f_5^{5}}{f_1^{5}}\pmod{5^{2k+\beta+1}}. \end{align*} $$
From the binomial theorem,
$$ \begin{align*} \frac{f_5^5}{f_1^5} \equiv f_5^4\pmod{5}. \end{align*} $$
Thus,
$$ \begin{align*} \sum_{n\geq 0}b_{5^{2k-1}}\bigg(5^{2k+2\beta-1}n+\frac{4\cdot5^{2k+2\beta}-5^{2k-1}+1}{24}\bigg)q^n\equiv y^{(2k-1)}_{2\beta+1,1}f_5^{4}\pmod{5^{2k+\beta}}. \end{align*} $$
Equating the coefficients of
$q^{5n+l}$
,
$l\in \{1,2,3,4\}$
, we arrive at (1.9).
Acknowledgment
The authors would like to thank the anonymous referee for careful reading and helpful comments.




