|
|
A355965
|
|
Primes p such that (p+10)^(p-1) == 1 (mod p^2).
|
|
6
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A computer search taking less than 3 seconds shows there are no further terms below the one millionth prime. - Harvey P. Dale, Mar 04 2024
I ran the PARI program below for 8.5 hours and it did not find any further terms. (I do not know how far it searched.) - N. J. A. Sloane, Mar 05 2024
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Prime[Range[70000]], PowerMod[#+10, #-1, #^2]==1&] (* Harvey P. Dale, Mar 04 2024 *)
|
|
PROG
|
(PARI) forprime(p=1, , if(Mod(p+10, p^2)^(p-1)==1, print1(p, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|