A051082 Primes p such that x^26 = -2 has a solution mod p.

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

Offset

1,1

Comments

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

Prog

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

Crossrefs

Sequence in context: A051088 A051092 A051086 * A051080 A051098 A215811

Adjacent sequences: A051079 A051080 A051081 * A051083 A051084 A051085

Keyword

nonn,easy

Author

N. J. A. Sloane

Extensions

More terms from Joerg Arndt, Jul 27 2011

Status

approved