|
|
A059313
|
|
Primes p such that x^25 = 2 has no solution mod p.
|
|
3
|
|
|
11, 31, 41, 61, 71, 101, 131, 151, 181, 191, 211, 251, 271, 281, 311, 331, 401, 421, 461, 491, 521, 541, 601, 631, 661, 691, 701, 751, 761, 811, 821, 881, 941, 991, 1021, 1031, 1051, 1061, 1091, 1151, 1171, 1201, 1231, 1291, 1301, 1321, 1361, 1381, 1451
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
ok[p_] := Reduce[Mod[x^25 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[250]], ok ] (* Vincenzo Librandi, Sep 20 2012 *)
|
|
PROG
|
(Magma) [p: p in PrimesUpTo(1500) | forall{x: x in ResidueClassRing(p) | x^25 ne 2}]; // Vincenzo Librandi, Sep 20 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|