A051073 Primes p such that x^8 = -2 has a solution mod p.

2, 3, 11, 19, 43, 59, 67, 83, 107, 131, 139, 163, 179, 211, 227, 251, 257, 281, 283, 307, 331, 337, 347, 379, 419, 443, 467, 491, 499, 523, 547, 563, 571, 587, 617, 619, 643, 659, 683, 691, 739, 787, 811, 827, 859, 881, 883, 907, 947, 971, 1019

Offset

1,1

Comments

Complement of A216735 relative to A000040. - Vincenzo Librandi, Sep 16 2012

Links

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Mathematica

ok[p_]:= Reduce[Mod[x^8 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* Vincenzo Librandi, Sep 15 2012 *)

Prog

(PARI)
forprime(p=2, 2000, if([]~!=polrootsff(x^8+2, p, y-1), print1(p, ", "))); print();
/* Joerg Arndt, Jun 24 2012 */
(Magma) [p: p in PrimesUpTo(1200) | exists(t){x : x in ResidueClassRing(p) | x^8 eq - 2}]; // Vincenzo Librandi, Sep 15 2012

Crossrefs

Sequence in context: A095282 A051071 A051095 * A051077 A051085 A051101

Adjacent sequences: A051070 A051071 A051072 * A051074 A051075 A051076

Keyword

nonn,easy

Author

N. J. A. Sloane

Extensions

More terms from Joerg Arndt, Jun 24 2012

Status

approved