login
A051100
Primes p such that x^62 = -2 has a solution mod p.
3
2, 3, 11, 17, 19, 41, 43, 59, 67, 73, 83, 89, 97, 107, 113, 131, 137, 139, 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, 691, 739, 761, 769, 787, 809, 811, 827, 857, 859, 881, 883, 907, 929, 937, 947, 953, 971, 977, 1009
OFFSET
1,1
COMMENTS
Differs from A033203 first at the 109th entry, at p=1427. - R. J. Mathar, Oct 14 2008
Complement of A216776 relative to A000040. - Vincenzo Librandi, Sep 17 2012
LINKS
MATHEMATICA
ok[p_]:= Reduce[Mod[x^62 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* Vincenzo Librandi, Sep 16 2012 *)
PROG
(PARI) /* see A051071 */
(Magma) [p: p in PrimesUpTo(1010) | exists(t){x : x in ResidueClassRing(p) | x^62 eq - 2}]; // Vincenzo Librandi, Sep 16 2012
CROSSREFS
Sequence in context: A038902 A019355 A033203 * A051088 A051092 A051086
KEYWORD
nonn,easy
EXTENSIONS
More terms from Joerg Arndt, Jul 27 2011
STATUS
approved