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.
Publisher
Cambridge University Press (CUP)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献