Congruences modulo powers of 5 for $k$-colored partitions

Abstract

Let $p_{-k}(n)$ enumerate the number of $k$-colored partitions of $n$. In this paper, we establish some infinite families of congruences modulo 25 for $k$-colored partitions. Furthermore, we prove some infinite families of Ramanujan-type congruences modulo powers of 5 for $p_{-k}(n)$ with $k=2,6$, and $7$. For example, for all integers $n\ge 0$ and $\alpha \ge 1$, we prove that \begin{align*} p_{-2}\left(5^{2α-1}n+\dfrac{7\times5^{2α-1}+1}{12}\right) &\equiv0\pmod{5^α} \end{align*} and \begin{align*} p_{-2}\left(5^{2α}n+\dfrac{11\times5^{2α}+1}{12}\right) &\equiv0\pmod{5^{α+1}}. \end{align*}

15 pages, submitted to J. Number Theory

References in corpus (1)

• Multiranks and classical theta functions