Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 13 Mar 2025 in math.NT | (2503.10113v1)

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

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.

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.