arXiv Analytics

Sign in

arXiv:1108.4178 [math.NT]AbstractReferencesReviewsResources

Congruences for Wolstenholme primes

Romeo Mestrovic

Published 2011-08-21Version 1

A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in terms of the sums $R_i:=\sum_{k=1}^{p-1}1/k^i$ ($i=1,2,3,4,5,6)$. Further, the expression in this congruence is reduced in terms of the sums $R_i$ ($i=1,3,4,5$). Using this congruence, we prove that for any Wolstenholme prime, $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} -2p^2\sum_{k=1}^{p-1}\frac{1}{k^2}\pmod{p^7}. $$ Moreover, using a recent result of the author \cite{Me}, we prove that the above congruence implies that a prime $p$ necessarily must be a Wolstenholme prime. Applying a technique of Helou and Terjanian \cite{HT}, the above congruence is given as the expression involving the Bernoulli numbers.

Comments: pages 16
Categories: math.NT
Subjects: 11B75, 11A07, 11B65, 11B68, 05A10
Related articles: Most relevant | Search more
arXiv:math/0010286 [math.NT] (Published 2000-10-29)
Comparison of algorithms to calculate quadratic irregularity of prime numbers
arXiv:1209.2373 [math.NT] (Published 2012-09-07, updated 2014-05-01)
A characterization of a prime $p$ from the binomial coefficient ${n \choose p}$
arXiv:1001.1783 [math.NT] (Published 2010-01-12, updated 2011-03-20)
The number of nonzero binomial coefficients modulo p^alpha