New Congruences Modulo 2, 4, and 8 for the Number of Tagged Parts Over the Partitions with Designated Summands

Abstract

Recently, Lin introduced two new partition functions PDt(n) and PDOt(n), which count the total number of tagged parts over all partitions of n with designated summands and the total number of tagged parts over all partitions of n with designated summands in which all parts are odd. Lin also proved some congruences modulo 3 and 9 for PDt(n) and PDOt(n), and conjectured some congruences modulo 8. Very recently, Adansie, Chern, and Xia found two new infinite families of congruences modulo 9 for PDt(n). In this paper, we prove the congruences modulo 8 conjectured by Lin and also find many new congruences and infinite families of congruences modulo some small powers of 2.

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…