Congruences for two-color partitions with odd smallest part

Abstract

For a fixed positive integer k, let C(k,n) denote the number of two-color partitions of n with odd smallest part and restrictions on even parts, and let Ck(q) be its generating function. We show that C(1,n) d(2n-1)4 and obtain congruences modulo 2 and 4 for C(k,n) when k=2,3. Using q-series methods we derive closed formulas for Ck(q) in terms of eta-quotients and formulate Ramanujan-type congruences for the limiting sequence arising from k∞ Ck(q).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…