English

On binomial coefficients modulo squares of primes

Combinatorics 2019-01-31 v2 Number Theory

Abstract

We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences n=0p1(2nn)ηpmodp2,\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2}, n=0rp1(2nn)ηpn=0r1(2nn)modp2\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n} \equiv\eta_{p}\sum\limits_{n=0}^{r-1}\dbinom {2n}{n}\mod p^{2} and n=0rp1m=0sp1(n+mm)2ηpm=0r1n=0s1(n+mm)2modp2,\sum\limits_{n=0}^{rp-1}\sum\limits_{m=0}^{sp-1}\dbinom{n+m}{m}^{2} \equiv\eta_{p} \sum\limits_{m=0}^{r-1}\sum\limits_{n=0}^{s-1}\dbinom{n+m}{m}^2\mod p^2, where pp is an odd prime, rr and ss are nonnegative integers, and ηp={0,if p0mod3;1,if p1mod3;1,if p2mod3.\eta_{p}= \begin{cases} 0, &\text{if }p\equiv0\mod 3;\\ 1, & \text{if }p\equiv1\mod 3;\\ -1, &\text{if }p\equiv2\mod 3 \end{cases}.$

Keywords

Cite

@article{arxiv.1712.02095,
  title  = {On binomial coefficients modulo squares of primes},
  author = {Darij Grinberg},
  journal= {arXiv preprint arXiv:1712.02095},
  year   = {2019}
}

Comments

27 pages. Semi-expository. Ancillary file is an archived version of the [Grinbe17b] reference, entirely expository. Comments are welcome! v2 corrects a few typos and updates references

R2 v1 2026-06-22T23:09:30.664Z