English

A refinement of a congruence result by van Hamme and Mortenson

Number Theory 2014-02-19 v6 Combinatorics

Abstract

Let pp be an odd prime. In 2008 E. Mortenson proved van Hamme's following conjecture: k=0(p1)/2(4k+1)(1/2k)3(1)(p1)/2p(modp3).\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3\equiv (-1)^{(p-1)/2}p\pmod{p^3}. In this paper we show further that \begin{align*}\sum_{k=0}^{p-1}(4k+1)\binom{-1/2}k^3\equiv &\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3 \\\equiv & (-1)^{(p-1)/2}p+p^3E_{p-3} \pmod{p^4},\end{align*}where E0,E1,E2,E_0,E_1,E_2,\ldots are Euler numbers. We also prove that if p>3p>3 then k=0(p1)/220k+3(210)k(4kk,k,k,k)(1)(p1)/2p(2p1+2(2p11)2)(modp4).\sum_{k=0}^{(p-1)/2}\frac{20k+3}{(-2^{10})^k}\binom{4k}{k,k,k,k}\equiv(-1)^{(p-1)/2}p(2^{p-1}+2-(2^{p-1}-1)^2)\pmod{p^4}.

Keywords

Cite

@article{arxiv.1011.1902,
  title  = {A refinement of a congruence result by van Hamme and Mortenson},
  author = {Zhi-Wei Sun},
  journal= {arXiv preprint arXiv:1011.1902},
  year   = {2014}
}

Comments

Final published version