English

Combinatorial congruences and Stirling numbers

Number Theory 2007-05-23 v3 Combinatorics

Abstract

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence j=0l(lj)S(j,m)alj(l=m,m+1,...)\sum_{j=0}^l{l\choose j}S(j,m)a^{l-j}(l=m,m+1,...) modulo a prime pp, where aa and m>0m>0 are integers, and those S(j,m)S(j,m) are Stirling numbers of the second kind. We also give a new extension of Glaisher's congruence by showing that (p1)p[logpm](p-1)p^{[\log_p m]} is a period of the sequence j=r(modp1)(lj)S(j,m)(l=m,m+1,...)\sum_{j=r(mod p-1)}{l\choose j}S(j,m)(l=m,m+1,...) modulo pp.

Keywords

Cite

@article{arxiv.math/0512071,
  title  = {Combinatorial congruences and Stirling numbers},
  author = {Zhi-Wei Sun},
  journal= {arXiv preprint arXiv:math/0512071},
  year   = {2007}
}

Comments

12 pages