|
|
A088164
|
|
Wolstenholme primes: primes p such that binomial(2p-1,p-1) == 1 (mod p^4).
|
|
31
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
McIntosh and Roettger showed that the next term, if it exists, must be larger than 10^9. - Felix Fröhlich, Aug 23 2014
When cb(m)=binomial(2m,m) denotes m-th central binomial coefficient then, obviously, cb(a(n))=2 mod a(n)^4. I have verified that among all naturals 1<m<=278000, cb(m)=2 mod m^4 holds only when m is a Wolstenholme prime (see A246134). One might therefore wonder whether this is true in general. - Stanislav Sykora, Aug 26 2014
Romeo Mestrovic, Congruences for Wolstenholme Primes, Lemma 2.3, shows that the criterion for p to be a Wolstenholme prime is equivalent to p dividing A027641(p-3). In 1847 Cauchy proved that this was a necessary condition for the failure of the first case of Fermat's Last Theorem for the exponent p (see Ribenboim, 13 Lectures, p. 29). - John Blythe Dobson, May 01 2015
Primes p such that p^3 divides A001008(p-1) (Zhao, 2007, p. 18). Also: Primes p such that (p, p-3) is an irregular pair (cf. Buhler, Crandall, Ernvall, Metsänkylä, 1993, p. 152). Keith Conrad observes that for the two known (as of 2015) terms ord_p(H_p-1) = 3 is satisfied, where ord_p(H_p-1) gives the p-adic valuation of H_p-1 (cf. Conrad, p. 5). Romeo Mestrovic conjectures that p is a Wolstenholme prime if and only if S_(p-2)(p) == 0 (mod p^3), where S_k(i) denotes the sum of the k-th powers of the positive integers up to and including (i-1) (cf. Mestrovic, 2012, conjecture 2.10). - Felix Fröhlich, May 20 2015
Primes p that divide the Wolstenholme quotient W_p (A034602). Also, primes p such that p^2 divides the Babbage quotient b_p (A263882). - Jonathan Sondow, Nov 24 2015
The only known composite numbers n such that binomial(2n-1, n-1) is congruent to 1 mod n^2 are the numbers n = p^2 where p is a Wolstenholme prime: see A267824. - Jonathan Sondow, Jan 27 2016
The converse of Wolstenholme's theorem implies that if an integer n satisfies the congruence binomial(2*n-1, n-1) == 1 (mod n^4), then n is a term of this sequence, i.e., then n is necessarily prime, or, equivalently, A298946(i) > 1 for all i > 0. Whether this is true for all such n is an open problem. - Felix Fröhlich, Feb 21 2018
Primes p such that binomial(2*p-1, p-1) == 1-2*p*Sum_{k=1..p-1} 1/k - 2*p^2*Sum_{k=1..p-1} 1/k^2 (mod p^7) (cf. Mestrovic, 2011, Corollary 4). - Felix Fröhlich, Feb 21 2018
If a third Wolstenholme prime exists it is larger than 6*10^10 (cf. Hathi, Mossinghoff, Trudgian, 2021). - Felix Fröhlich, Apr 27 2021
Named after the English mathematician Joseph Wolstenholme (1829-1891). - Amiram Eldar, Jun 10 2021
|
|
REFERENCES
|
Richard K. Guy, Unsolved Problems in Number Theory, Sect. B31.
Paulo Ribenboim, 13 Lectures on Fermat's Last Theorem (Springer, 1979).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
For[i = 2, i <= 20000, i++, {If[PrimeQ[i] && Mod[Binomial[2*i - 1, i - 1], i^4] == 1, Print[i]]}] (* Dylan Delgado, Mar 02 2021 *)
|
|
PROG
|
(PARI) forprime(n=2, 10^9, if(Mod(binomial(2*n-1, n-1), n^4)==1, print1(n, ", "))); \\ Felix Fröhlich, May 18 2014
(Magma) [p: p in PrimesUpTo(2*10^4)| (Binomial(2*p-1, p-1) mod (p^4)eq 1)]; // Vincenzo Librandi, May 02 2015
|
|
CROSSREFS
|
Cf. A000984, A001008, A007406, A027641, A034602, A099908, A246130, A246132, A246133, A246134, A263882, A267824, A298946.
|
|
KEYWORD
|
hard,nonn,bref,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|