pith. sign in

arxiv: 1503.03418 · v1 · pith:PBZ2P3BKnew · submitted 2015-03-11 · 🧮 math.NT · math.CO

Note on super congruences modulo p²

classification 🧮 math.NT math.CO
keywords binomequivfracpmodquadcongruenceshboximplies
0
0 comments X
read the original abstract

Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\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}.$$

This paper has not been read by Pith yet.

discussion (0)

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