Abstract
Recently, Andrews defined combinatorial objects which he called singular overpartitions and proved that these singular overpartitions which depend on two parameters k and i can be enumerated by the function C‾k,i(n), which denotes the number of overpartitions of n in which no part is divisible by k and only parts ≡±i(modk) may be overlined. G.E. Andrews, S.C. Chen, M. Hirschhorn, J.A. Sellars, Olivia X.M. Yao, M.S. Mahadeva Naika, D.S. Gireesh, Zakir Ahmed and N.D. Baruah noted numerous congruences modulo 2,3,4,6,12,16,18,32 and 64 for C‾3,1(n). In this paper, we prove congruences modulo 128 for C‾3,1(n), and congruences modulo 2 for C‾12,3(n), C‾44,11(n),C‾75,15(n), and C‾92,23(n). We also prove “Mahadeva Naika and Gireesh's conjecture”, for n≥0, C‾3,1(12n+11)≡0(mod144) is true.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
