General Congruences Modulo 5 and 7 for Colour Partitions

Abstract

For any positive integers n and r, let pr(n) denotes the number of partitions of n where each part has r distinct colours. Many authors studied the partition function pr(n) for particular values of r. In this paper, we prove some general congruences modulo 5 and 7 for the colour partition function pr(n) by considering some general values of r. To prove the congruences we employ some q-series identities which is also in the spirit of Ramanujan.

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…