On -regular and 2-color partition triples modulo powers of 3
Abstract
Let T(n) denote the number of -regular partition triples of n and let p, 3(n) enumerates the number of 2--color partition triples of n where one of the colors appear only in parts that are multiples of . In this paper, we prove several infinite families of congruences modulo powers of 3 for T(n) and p, 3(n), where ≥ 1 and 03k, and 3k 3k+1.
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.