Papers
Topics
Authors
Recent
Search
2000 character limit reached

Super congruences and Euler numbers

Published 25 Jan 2010 in math.NT and math.CO | (1001.4453v20)

Abstract: Let $p&gt;3$ be a prime. We prove that ∑k=0<sup>p−1(2kk)/2<sup>k=(−1)<sup>(p−1)/2−p<sup>2Ep−3</sup></sup></sup></sup>(modp<sup>3),\sum_{k=0}<sup>{p-1}\binom{2k}{k}/2<sup>k=(-1)<sup>{(p-1)/2}-p<sup>2E_{p-3}</sup></sup></sup></sup> (mod p<sup>3), ∑k=1<sup>(p−1)/2(2kk)/k=(−1)<sup>(p+1)/28/3∗pEp−3</sup></sup>(modp<sup>2),\sum_{k=1}<sup>{(p-1)/2}\binom{2k}{k}/k=(-1)<sup>{(p+1)/2}8/3*pE_{p-3}</sup></sup> (mod p<sup>2), ∑k=0<sup>(p−1)/2(2kk)<sup>2/16<sup>k=(−1)<sup>(p−1)/2+p<sup>2Ep−3</sup></sup></sup></sup></sup>(modp<sup>3)\sum_{k=0}<sup>{(p-1)/2}\binom{2k}{k}<sup>2/16<sup>k=(-1)<sup>{(p-1)/2}+p<sup>2E_{p-3}</sup></sup></sup></sup></sup> (mod p<sup>3), where E_0,E_1,E_2,... are Euler numbers. Our new approach is of combinatorial nature. We also formulate many conjectures concerning super congruences and relate most of them to Euler numbers or Bernoulli numbers. Motivated by our investigation of super congruences, we also raise a conjecture on 7 new series for π<sup>2\pi<sup>2, π<sup>−2\pi<sup>{-2} and the constant $K:=\sum_{k&gt;0}(k/3)/k<sup>2$ (with (-) the Jacobi symbol), two of which are ∑k=1<sup>∞(10k−3)8<sup>k/(k<sup>3(2kk)<sup>2(3kk))=π<sup>2/2\sum_{k=1}<sup>\infty(10k-3)8<sup>k/(k<sup>3\binom{2k}{k}<sup>2\binom{3k}{k})=\pi<sup>2/2 and $$\sum_{k&gt;0}(15k-4)(-27)<sup>{k-1}/(k<sup>3\binom{2k}{k}<sup>2\binom{3k}k)=K.$$

Authors (1)
Citations (127)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.