arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.1174math.NT
收藏

关于${2p-1\choose p-1}$的mod $p^7$测定

On the mod $p^7$ determination of ${2p-1\choose p-1}$

Romeo Mestrovic

摘要:

在本文中,我们证明了,对于任何素数$p\ge 11$持有$$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$这是一个推广的著名Wolstenholme的定理断言,${2p-1\choose p-1} \equiv 1 \,\,(\bmod\,\,p^3)$的所有素数$p\ge 5$。我们的证明是基本的,它不使用标准的技术,涉及经典公式的权力和伯努利数。注意,上述同余约化模$p^6$、$p^5$和$p^4$产生由R获得的相关同余。Tauraso,J. Zhao和J.W.L.分别为Glaucine。

英文摘要:

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which asserts that ${2p-1\choose p-1} \equiv 1 \,\,(\bmod\,\,p^3)$ for all primes $p\ge 5$. Our proof is elementary and it does not use a standard technique involving the classic formula for the power sums in terms of the Bernoulli numbers. Notice that the above congruence reduced modulo $p^6$, $p^5$ and $p^4$ yields related congruences obtained by R. Tauraso, J. Zhao and J.W.L. Glaisher, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑