Three pairs of congruences concerning sums of central binomial coefficients

preprint2020arXivOpen access

Abstract

Recently the first author proved a congruence proposed in 2006 by Adamchuk: ∑k=1⌊2p3⌋(2kk)≡0(modp2)\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2} for any prime p=1(mod3)p=1 \pmod{3}. In this paper, we provide more examples (with proofs) of congruences of the same kind ∑k=1⌊apr⌋(2kk)xk(modp2)\sum_{k=1}^{\lfloor\frac{ap}{r}\rfloor}\binom{2k}{k}x^k \pmod{p^2} where pp is a prime such that p≡1(modr)p\equiv 1 \pmod{r}, a/ra/r is a fraction in (1/2,1)(1/2,1) and xx is a pp-adic integer. The key ingredients are the pp-adic Gamma functions ΓpΓ_p and a special class of computer-discovered hypergeometric identities.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.