|
%I #6 Aug 24 2022 09:55:21
%S 13,41,97,809,1151,1657,800011
%N Primes p such that (p+10)^(p-1) == 1 (mod p^2).
%o (PARI) forprime(p=1, , if(Mod(p+10, 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), A355963 (k=8), A355964 (k=9).
%K nonn,hard,more
%O 1,1
%A _Felix Fröhlich_, Jul 21 2022
|
