English

Note on super congruences modulo $p^2$

Number Theory 2015-03-12 v1 Combinatorics

Abstract

Let pp be an odd prime, and let mm be an integer with pmp\nmid m. In this paper show that k=0p1(2kk)(ak)(1ak)mk0(modp)impliesk=0p1(2kk)(ak)(1ak)mk0(modp2).\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak \binom{-1-a}k}{m^k}\equiv 0\pmod {p^2}.

Keywords

Cite

@article{arxiv.1503.03418,
  title  = {Note on super congruences modulo $p^2$},
  author = {Zhi-Hong Sun},
  journal= {arXiv preprint arXiv:1503.03418},
  year   = {2015}
}

Comments

8 pages

R2 v1 2026-06-22T08:50:18.532Z