Combinatorial congruences and Stirling numbers

dc.creatorSun, Zhi-Wei
dc.date2005-12-05
dc.date2007-02-26
dc.date.accessioned2026-07-07T07:48:28Z
dc.date.available2026-07-07T07:48:28Z
dc.descriptionIn 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 $\sum_{j=0}^l{l\choose j}S(j,m)a^{l-j}(l=m,m+1,...)$ modulo a prime $p$, where $a$ and $m>0$ are integers, and those $S(j,m)$ are Stirling numbers of the second kind. We also give a new extension of Glaisher's congruence by showing that $(p-1)p^{[\log_p m]}$ is a period of the sequence $\sum_{j=r(mod p-1)}{l\choose j}S(j,m)(l=m,m+1,...)$ modulo $p$.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0512071
dc.identifierhttp://arxiv.org/abs/math/0512071
dc.identifierActa Arith. 126(2007), no. 4, 387-398
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124508
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11B65; 05A10; 11A07; 11B73
dc.titleCombinatorial congruences and Stirling numbers
dc.typetext

Files

Collections