2000 character limit reached
On 2-color partitions where one of the color is multiples of
Published 13 Mar 2025 in math.NT | (2503.10113v1)
Abstract: In this work, we investigate the arithmetic properties of , which counts 2-color partitions of where one of the colors appears only in parts that are multiples of $5k$. By constructing generating functions for across specific arithmetic progressions, we establish a set of Ramanujan-type infinite family of congruences modulo powers of $5$.
Paper Prompts
Sign up for free to create and run prompts on this paper.