中文

Congruences for sums of binomial coefficients

数论 2007-08-06 v4 组合数学

摘要

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

关键词

引用

@article{arxiv.math/0502187,
  title  = {Congruences for sums of binomial coefficients},
  author = {Zhi-Wei Sun and Roberto Tauraso},
  journal= {arXiv preprint arXiv:math/0502187},
  year   = {2007}
}