A049594 Primes p such that x^62 = 2 has a solution mod p.

2, 7, 17, 23, 31, 41, 47, 71, 73, 79, 89, 97, 103, 113, 127, 137, 151, 167, 191, 193, 199, 223, 233, 239, 241, 257, 263, 271, 281, 313, 337, 353, 359, 367, 383, 401, 409, 431, 433, 439, 449, 457, 463, 479, 487, 503, 521, 569, 577, 593, 599, 601, 607, 617, 631

Offset

1,1

Comments

Complement of A059646 relative to A000040. - Vincenzo Librandi, Sep 15 2012

Links

R. J. Mathar, Table of n, a(n) for n = 1..1000

R. J. Mathar, Maple programs for this and related sequences

Index entries for related sequences

Mathematica

ok[p_]:= Reduce[Mod[x^62 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[150]], ok] (* Vincenzo Librandi, Sep 15 2012 *)

Prog

(Magma) [p: p in PrimesUpTo(700) | exists(t){x : x in ResidueClassRing(p) | x^62 eq 2}]; // Vincenzo Librandi, Sep 15 2012

Crossrefs

Cf. A000040, A059646.

Sequence in context: A105911 A038873 A141131 * A049590 A049570 A049566

Adjacent sequences: A049591 A049592 A049593 * A049595 A049596 A049597

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved