Pith. sign in

REVIEW

On congruences related to central binomial coefficients

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0911.2415 v16 pith:IQH47UYV submitted 2009-11-12 math.NT math.CO

On congruences related to central binomial coefficients

classification math.NT math.CO
keywords binombinomialcentralcoefficientscongruencesinftyprimerelated
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

It is known that $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)4^k)=\pi/2$ and $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)16^k)=\pi/3$. In this paper we obtain their p-adic analogues such as $$\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 $$\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 $$\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).

discussion (0)

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