|
|
A059352
|
|
Primes p such that x^40 = 2 has no solution mod p.
|
|
2
|
|
|
3, 5, 11, 13, 17, 19, 29, 31, 37, 41, 43, 53, 59, 61, 67, 71, 83, 97, 101, 107, 109, 113, 131, 137, 139, 149, 157, 163, 173, 179, 181, 191, 193, 197, 211, 227, 229, 241, 251, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 347, 349, 353, 373, 379, 389
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
ok[p_] := Reduce[Mod[x^40 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[80]], ok ] (* Vincenzo Librandi, Sep 20 2012 *)
|
|
PROG
|
(Magma) [p: p in PrimesUpTo(400) | forall{x: x in ResidueClassRing(p) | x^40 ne 2}]; // Vincenzo Librandi, Sep 20 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|