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≥0 and α≥1, we prove that align* p-2(52α-1n+7×52α-1+112) &05α align* and align* p-2(52αn+11×52α+112) &05α+1. align*

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…