On the p^7 determination of 2p-1 p-1

From MaRDI portal
Publication:404502




Abstract: In this paper we prove that for any prime pge11 holds {2p-1choose p-1}equiv 1 -2p sum_{k=1}^{p-1}frac{1}{k} +4p^2sum_{1le i<jle p-1}frac{1}{ij}pmod{p^7}. This is a generalization of the famous Wolstenholme's theorem which asserts that for all primes pge5. 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 p6, p5 and p4 yields related congruences obtained by R. Tauraso, J. Zhao and J.W.L. Glaisher, respectively.











This page was built for publication: On the \(\pmod{p^7}\) determination of \({2p-1\choose p-1}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404502)