English

Divisibility of Andrews' Singular Overpartitions by Powers of 2 and 3

Number Theory 2019-06-13 v1

Abstract

Andrews introduced the partition function Ck,i(n)\overline{C}_{k, i}(n), called singular overpartition, which counts the number of overpartitions of nn in which no part is divisible by kk and only parts ±i(modk)\equiv \pm i\pmod{k} may be overlined. He also proved that C3,1(9n+3)\overline{C}_{3, 1}(9n+3) and C3,1(9n+6)\overline{C}_{3, 1}(9n+6) are divisible by 33 for n0n\geq 0. Recently Aricheta proved that for an infinite family of kk, C3k,k(n)\overline{C}_{3k, k}(n) is almost always even. In this paper, we prove that for any positive integer kk, C3,1(n)\overline{C}_{3, 1}(n) is almost always divisible by 2k2^k and 3k.3^k.

Keywords

Cite

@article{arxiv.1906.05027,
  title  = {Divisibility of Andrews' Singular Overpartitions by Powers of 2 and 3},
  author = {Rupam Barman and Chiranjit Ray},
  journal= {arXiv preprint arXiv:1906.05027},
  year   = {2019}
}

Comments

Accepted for publication at Research in Number Theory