login
A051075
Primes p such that x^12 = -2 has a solution mod p.
2
2, 3, 11, 43, 59, 83, 89, 107, 113, 131, 179, 227, 233, 251, 257, 281, 283, 307, 347, 353, 419, 443, 467, 491, 499, 563, 587, 593, 601, 617, 643, 659, 683, 691, 739, 811, 827, 881, 947, 971, 1019, 1049, 1051, 1091, 1097, 1163, 1187, 1193, 1217, 1259, 1283, 1289, 1307
OFFSET
1,1
COMMENTS
Complement of A216737 relative to A000040. - Vincenzo Librandi, Sep 16 2012
LINKS
MATHEMATICA
ok[p_]:= Reduce[Mod[x^12 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* Vincenzo Librandi, Sep 15 2012 *)
PROG
(PARI)
forprime(p=2, 2000, if([]~!=polrootsmod(x^12+2, p), print1(p, ", "))); print();
/* Joerg Arndt, Jun 24 2012 */
(Magma) [p: p in PrimesUpTo(1310) | exists(t){x : x in ResidueClassRing(p) | x^12 eq - 2}]; // Vincenzo Librandi, Sep 15 2012
CROSSREFS
Sequence in context: A179266 A265779 A055692 * A051087 A051081 A051093
KEYWORD
nonn,easy
EXTENSIONS
More terms from Joerg Arndt, Jul 27 2011
STATUS
approved