A059349 Primes p such that x^32 = 2 has no solution mod p.

3, 5, 11, 13, 17, 19, 29, 37, 41, 43, 53, 59, 61, 67, 83, 97, 101, 107, 109, 113, 131, 137, 139, 149, 157, 163, 173, 179, 181, 193, 197, 211, 227, 229, 241, 251, 257, 269, 277, 281, 283, 293, 307, 313, 317, 331, 347, 349, 353, 373, 379, 389, 397, 401, 409, 419

Offset

1,1

Comments

Complement of A049564 relative to A000040.

Differs from A014662 first at p=6529, then at p=21569. [From R. J. Mathar, Oct 05 2008]

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[100]], ok ] (* Vincenzo Librandi, Sep 20 2012  *)

Prog

(Magma) [p: p in PrimesUpTo(450) | not exists{x : x in ResidueClassRing(p) | x^32 eq 2 }]; // Vincenzo Librandi, Sep 20 2012

Crossrefs

Cf. A000040, A049564, A216747.

Sequence in context: A045403 A059641 A014662 * A045316 A040100 A076757

Adjacent sequences: A059346 A059347 A059348 * A059350 A059351 A059352

Keyword

nonn,easy

Author

Klaus Brockhaus, Jan 27 2001

Status

approved