A051092 Primes p such that x^46 = -2 has a solution mod p.

2, 3, 11, 17, 19, 41, 43, 59, 67, 73, 83, 89, 97, 107, 113, 131, 137, 163, 179, 193, 211, 227, 233, 241, 251, 257, 281, 283, 307, 313, 331, 337, 347, 353, 379, 401, 409, 419, 433, 443, 449, 457, 467, 491, 499, 521, 523, 547, 563, 569, 571, 577, 587, 593, 601, 617, 619, 641, 643, 659, 673, 683, 739, 761, 769, 787, 809, 811, 827, 857, 859, 881, 883, 907, 929, 937, 947, 953, 971, 977, 1009

Offset

1,1

Comments

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

Prog

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

Crossrefs

Sequence in context: A033203 A051100 A051088 * A051086 A051082 A051080

Adjacent sequences: A051089 A051090 A051091 * A051093 A051094 A051095

Keyword

nonn,easy

Author

N. J. A. Sloane

Extensions

More terms from Joerg Arndt, Jul 27 2011

Status

approved