|
%I #8 Aug 24 2022 09:55:00
%S 1531,7445287
%N Primes p such that (p+8)^(p-1) == 1 (mod p^2).
%C a(3) > 34294200797 if it exists.
%o (PARI) forprime(p=1, , if(Mod(p+8, p^2)^(p-1)==1, print1(p, ", ")))
%Y (p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355961 (k=6), A355962 (k=7), A355964 (k=9), A355965 (k=10).
%K nonn,hard,more,bref
%O 1,1
%A _Felix Fröhlich_, Jul 21 2022
|
