A051085 Primes p such that x^32 = -2 has a solution mod p.

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

Offset

1,1

Comments

Complement of A216747 relative to A000040. - Vincenzo Librandi, Sep 17 2012

Links

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

Mathematica

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

Prog

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

Crossrefs

Sequence in context: A051095 A051073 A051077 * A051101 A045339 A051091

Adjacent sequences: A051082 A051083 A051084 * A051086 A051087 A051088

Keyword

nonn,easy

Author

N. J. A. Sloane

Extensions

More terms from Joerg Arndt, Jul 27 2011

Status

approved