On congruences related to central binomial coefficients

preprint2011arXivOpen access

Abstract

It is known that ∑k=0∞(2kk)/((2k+1)4k)=π/2\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)4^k)=π/2 and ∑k=0∞(2kk)/((2k+1)16k)=π/3\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)16^k)=π/3. In this paper we obtain their p-adic analogues such as ∑p/2<k<p(2kk)/((2k+1)4k)=3∑p/2<k<p(2kk)/((2k+1)16k)=pEp−3(modp2),\sum_{p/2<k<p}\binom{2k}{k}/((2k+1)4^k)=3\sum_{p/2<k<p}\binom{2k}{k}/((2k+1)16^k)= pE_{p-3} (mod p^2), where p>3 is a prime and E_0,E_1,E_2,... are Euler numbers. Besides these, we also deduce some other congruences related to central binomial coefficients. In addition, we pose some conjectures one of which states that for any odd prime p we have ∑k=0p−1(2kk)3=4x2−2p(modp2)\sum_{k=0}^{p-1}\binom{2k}{k}^3=4x^2-2p (mod p^2) if (p/7)=1 and p=x^2+7y^2 with x,y integers, and ∑k=0p−1(2kk)3=0(modp2)\sum_{k=0}^{p-1}\binom{2k}{k}^3=0 (mod p^2) if (p/7)=-1, i.e., p=3,5,6 (mod 7).

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.