Search

Andrews, Brietzke, R\o dseth and Sellers proved an infinite family of congruences on the number of the restricted $m$-ary partitions when $m$ is a prime. In this note, we show that these congruences hold for arbitrary positive integer $m$ and thus confirm the conjecture of Andrews, et al., Comment: 6 pages

Let $b_\ell(n)$ be the number of $\ell$-regular partitions of $n$. Recently, Hou et al established several infinite families of congruences for $b_\ell(n)$ modulo $m$, where $(\ell,m)=(3,3),(6,3),(5,5),(10,5)$ and $(7,7)$. In this paper, by the vanishing property given by Hou et al, we show an infinite family of congruence for $b_{11}(n)$ modulo $11$. Moreover, for $\ell= 3, 13$ and $25$, we obtain three infinite families of congruences for $b_{\ell}(n)$ modulo $3, 5$ and $13$ by the theory of Hecke eigenforms., Comment: 13 pages

Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they proposed the Abel-Gosper method to evaluate some indefinite sums involving harmonic numbers. In this paper, we use the Abel-Gosper method to prove an identity involving the generalized harmonic numbers. Special cases of this result reduce to many famous identities. In addition, we use both Abel's lemma and the WZ method to verify and to discover identities involving harmonic numbers. Many interesting examples are also presented., Comment: 10 pages

Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is divisible by 3. We obtain a Ramanujan type identity for the generating function of PD(3n+2) which implies the congruence of Andrews, Lewis and Lovejoy. For PD(3n), Andrews, Lewis and Lovejoy showed that the generating function can be expressed as an infinite product of powers of $(1-q^{2n+1})$ times a function $F(q^2)$. We find an explicit formula for $F(q^2)$, which leads to a formula for the generating function of PD(3n). We also obtain a formula for the generating function of PD(3n+1). Our proofs rely on Chan's identity on Ramanujan's cubic continued fraction and some identities on cubic theta functions. By introducing a rank for the partitions with designed summands, we give a combinatorial interpretation of the congruence of Andrews, Lewis and Lovejoy., Comment: 11 pages

The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended Zeilberger's algorithm, we generate recurrence relations for summations involving combinatorial sequences such as Stirling numbers. As examples, we give computer proofs of several known identities and derive some new identities. The applicability of this method is also studied., Comment: 14 pages

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial coefficients. This approach can be used to verify and discover identities involving harmonic numbers and derangement numbers. As examples, we use the Abel-Zeilberger algorithm to prove the Paule-Schneider identities, the Apery-Schmidt-Strehl identity, Calkin's identity and some identities involving Fibonacci numbers., Comment: 18 pages