Proof of a conjecture of Adamchuk
arXiv:2003.09810 · doi:10.1016/j.jcta.2021.105478
Abstract
In this paper, we prove a congruence which confirms a conjecture of Adamchuk. For any prime and , we have \begin{align*} \sum_{k=1}^{\frac{2}3(p^a-1)}\binom{2k}k\equiv0\pmod{p^2}. \end{align*}
arXiv comment14 pages
References in corpus (6)
- A -microscope for supercongruences
- Super congruences and Euler numbers
- Congruences on sums of -binomial coefficients
- Proof of two supercongruences conjectured by Z.-W.Sun involving Catalan-Larcombe-French numbers
- -adic analogues of hypergeometric identities
- Supercongruences on some binomial sums involving Lucas sequences