On 2-color partitions where one of the color is multiples of 5k

Abstract

In this work, we investigate the arithmetic properties of p1,5k(n), which counts 2-color partitions of n where one of the colors appears only in parts that are multiples of 5k. By constructing generating functions for p1,5k(n) across specific arithmetic progressions, we establish a set of Ramanujan-type infinite family of congruences modulo powers of 5.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…