arXiv Analytics

Sign in

arXiv:math/0502187 [math.NT]AbstractReferencesReviewsResources

Congruences for sums of binomial coefficients

Zhi-Wei Sun, Roberto Tauraso

Published 2005-02-09, updated 2007-08-05Version 4

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q), or a=1 (mod q) and 2|m, where $[n,r]_m(a)=\sum_{k=r(mod m)}\binom{n}{k}a^k$. This is a further extension of a congruence of Glaisher.

Journal: J. Number Theory 126(2007), no.2, 287-296
Categories: math.NT, math.CO
Subjects: 11B65, 05A10, 11A07
Related articles: Most relevant | Search more
arXiv:1504.05482 [math.NT] (Published 2015-04-20)
Proof of a congruence on sums of powers of $q$-binomial coefficients
arXiv:1012.3141 [math.NT] (Published 2010-12-14, updated 2014-04-28)
On sums involving products of three binomial coefficients
arXiv:1602.02632 [math.NT] (Published 2016-02-08)
On p-adic approximation of sums of binomial coefficients