Divisibility of Andrews' Singular Overpartitions by Powers of 2 and 3
Abstract
Andrews introduced the partition function Ck, i(n), called singular overpartition, which counts the number of overpartitions of n in which no part is divisible by k and only parts ik may be overlined. He also proved that C3, 1(9n+3) and C3, 1(9n+6) are divisible by 3 for n≥ 0. Recently Aricheta proved that for an infinite family of k, C3k, k(n) is almost always even. In this paper, we prove that for any positive integer k, C3, 1(n) is almost always divisible by 2k and 3k.
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.