login
A049590
Primes p such that x^58 = 2 has a solution mod p.
2
2, 7, 17, 23, 31, 41, 47, 71, 73, 79, 89, 97, 103, 113, 127, 137, 151, 167, 191, 193, 199, 223, 239, 241, 257, 263, 271, 281, 311, 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 A059644 relative to A000040. - Vincenzo Librandi, Sep 14 2012
MATHEMATICA
ok[p_] := Reduce[Mod[x^58 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[150]], ok] (* Vincenzo Librandi, Sep 14 2012 *)
PROG
(Magma) [p: p in PrimesUpTo(700) | exists(t){x : x in ResidueClassRing(p) | x^58 eq 2}]; // Vincenzo Librandi, Sep 14 2012
(PARI)
N=10^4; default(primelimit, N);
ok(p, r, k)={ return ( (p==r) || (Mod(r, p)^((p-1)/gcd(k, p-1))==1) ); }
forprime(p=2, N, if (ok(p, 2, 58), print1(p, ", ")));
/* Joerg Arndt, Sep 21 2012 */
CROSSREFS
Sequence in context: A038873 A141131 A049594 * A049570 A049566 A049558
KEYWORD
nonn,easy
STATUS
approved