|
|
A051087
|
|
Primes p such that x^36 = -2 has a solution mod p.
|
|
2
|
|
|
2, 3, 11, 43, 59, 83, 89, 107, 113, 131, 179, 227, 233, 251, 257, 281, 283, 347, 353, 419, 443, 467, 491, 499, 563, 587, 593, 601, 617, 643, 659, 683, 691, 827, 881, 947, 971, 1019, 1049, 1051, 1091, 1097, 1163, 1187, 1193, 1217, 1259, 1283, 1289, 1307, 1427, 1433, 1451, 1481, 1499, 1523
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
ok[p_]:= Reduce[Mod[x^36 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* Vincenzo Librandi, Sep 15 2012 *)
|
|
PROG
|
(Magma) [p: p in PrimesUpTo(1525) | exists(t){x : x in ResidueClassRing(p) | x^36 eq - 2}]; // Vincenzo Librandi, Sep 15 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|