A049562 Primes p such that x^30 = 2 has a solution mod p.

2, 17, 23, 47, 89, 113, 127, 137, 167, 223, 233, 239, 257, 263, 353, 359, 383, 431, 433, 439, 449, 457, 479, 503, 569, 593, 599, 617, 641, 647, 719, 727, 743, 809, 839, 857, 863, 887, 911, 919, 929, 953, 977, 983, 1049, 1097, 1103, 1193, 1217, 1223, 1289

Offset

1,1

Comments

Complement of A059334 relative to A000040. - Vincenzo Librandi, Sep 14 2012

Links

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

Index entries for related sequences

Mathematica

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

Prog

(Magma) [p: p in PrimesUpTo(1300) | exists(t){x : x in ResidueClassRing(p) | x^30 eq 2}]; // Vincenzo Librandi, Sep 14 2012
(PARI) forprime(p=2, 1300, if(0!=#polrootsmod(x^30-2, p), print1(p, ", "))); \\ Joerg Arndt, Apr 19 2025

Crossrefs

Cf. A000040, A059334.

Sequence in context: A105901 A154963 A343241 * A107137 A086322 A390770

Adjacent sequences: A049559 A049560 A049561 * A049563 A049564 A049565

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved