Pith. sign in

REVIEW

Combinatorial congruences and Stirling numbers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0512071 v3 pith:3ZPJHRJB submitted 2005-12-05 math.NT math.CO

Combinatorial congruences and Stirling numbers

classification math.NT math.CO
keywords choosecombinatorialcongruencesmodulonumberssequencestirlingauthor
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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 $\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$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.