A216886 Primes p such that x^59 = 2 has a solution mod p.

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271

Offset

1,1

Comments

Complement of A059312 relative to A000040.

Links

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Mathematica

ok[p_] := Reduce[Mod[x^59 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[100]], ok]

Prog

(Magma) [p: p in PrimesUpTo(500) | exists(t){x: x in ResidueClassRing(p) | x^59 eq 2}];

Crossrefs

Sequence in context: A216883 A216884 A216885 * A273960 A100726 A015919

Adjacent sequences: A216883 A216884 A216885 * A216887 A216888 A216889

Keyword

nonn,easy

Author

Vincenzo Librandi, Sep 20 2012

Status

approved