|
|
A115091
|
|
Primes p such that p^2 divides m!+1 for some integer m<p.
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
By Wilson's theorem, we know that there is an m=p-1 such that p divides m!+1. Sequence A115092 gives the number of m for each prime. Occasionally p^2 also divides m!+1. These primes seem to be only slightly more plentiful than Wilson primes (A007540). No other primes < 10^6.
There is no prime p < 10^8 such that p^2 divides m!+1 for some m <= 1200. [From F. Brunault (brunault(AT)gmail.com), Nov 23 2008]
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, 3rd Ed., New York, Springer-Verlag, 2004, Section A2.
|
|
LINKS
|
|
|
MATHEMATICA
|
nn=1000; lst={}; Do[p=Prime[i]; p2=p^2; f=1; m=1; While[m<p && f+1<p2, m++; f=Mod[f*m, p2]]; If[m<p, AppendTo[lst, p]], {i, PrimePi[nn]}]; lst
Select[Prime@ Range@ 1000, Function[p, AnyTrue[Range[p - 1], Divisible[#! + 1, p^2] &]]] (* Michael De Vlieger, Jan 24 2016, Version 10 *)
|
|
PROG
|
(PARI) forprime(p=1, , for(k=1, p-1, if(Mod((p-k)!, p^2)==-1, print1(p, ", "); break({1})))) \\ Felix Fröhlich, Jan 24 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|