Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 7 Nov 2017 in math.CO | (1711.02325v1)

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\geq0$ and $\alpha\geq1$, we prove that \begin{align*} p_{-2}\left(5{2\alpha-1}n+\dfrac{7\times5{2\alpha-1}+1}{12}\right) &\equiv0\pmod{5{\alpha}} \end{align*} and \begin{align*} p_{-2}\left(5{2\alpha}n+\dfrac{11\times5{2\alpha}+1}{12}\right) &\equiv0\pmod{5{\alpha+1}}. \end{align*}

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.