|
|
|
|
71, 863, 1093, 2281, 3511, 13691, 20771, 54787, 950507, 1843757, 3188089
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
In analogy to a Wieferich pair, a set of three primes p, q, r can be called a 'Wieferich triple' if its members satisfy either of the following two sets of congruences:
p^(q-1) == 1 (mod q^2), q^(r-1) == 1 (mod r^2), r^(p-1) == 1 (mod p^2)
p^(r-1) == 1 (mod r^2), r^(q-1) == 1 (mod q^2), q^(p-1) == 1 (mod p^2)
|
|
LINKS
|
|
|
PROG
|
(PARI) forprime(p=1, , forprime(q=1, p, forprime(r=1, q, if((Mod(p, q^2)^(q-1)==1 && Mod(q, r^2)^(r-1)==1 && Mod(r, p^2)^(p-1)==1) || (Mod(p, r^2)^(r-1)==1 && Mod(r, q^2)^(q-1)==1 && Mod(q, p^2)^(p-1)==1), print1(p, ", ")))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|