Abstract
AbstractFor positive integers $n$ and $k$, let $r_{k}(n)$ denote the number of representations of $n$ as a sum of $k$ squares, where representations with different orders and different signs are counted as distinct. For a given positive integer $m$, by means of some properties of binomial coefficients, we derive some infinite families of congruences for $r_{k}(n)$ modulo $2^{m}$. Furthermore, in view of these arithmetic properties of $r_{k}(n)$, we establish many infinite families of congruences for the overpartition function and the overpartition pair function.
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.
