A051089 Primes p such that x^40 = -2 has a solution mod p.

2, 3, 19, 43, 59, 67, 83, 107, 139, 163, 179, 227, 251, 257, 283, 307, 337, 347, 379, 419, 443, 467, 499, 523, 547, 563, 571, 587, 617, 619, 643, 659, 683, 739, 787, 827, 859, 883, 907, 947, 971, 1019, 1033, 1049, 1097, 1123, 1163, 1187, 1193, 1217, 1249, 1259, 1283, 1307, 1427, 1459, 1483, 1499, 1523

Offset

1,1

Comments

Complement of A216751 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^40 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[400]], ok] (* Vincenzo Librandi, Sep 15 2012 *)

Prog

(PARI) /* see A051071 */
(Magma) [p: p in PrimesUpTo(1525) | exists(t){x : x in ResidueClassRing(p) | x^40 eq - 2}]; // Vincenzo Librandi, Sep 15 2012

Crossrefs

Sequence in context: A215381 A215377 A051079 * A289860 A248702 A171149

Adjacent sequences: A051086 A051087 A051088 * A051090 A051091 A051092

Keyword

nonn,easy

Author

N. J. A. Sloane

Extensions

More terms from Joerg Arndt, Jul 27 2011

Status

approved