A040065 Primes p such that x^3 = 13 has a solution mod p.

2, 3, 5, 7, 11, 13, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 103, 107, 113, 131, 137, 149, 163, 167, 173, 179, 191, 193, 197, 211, 223, 227, 229, 233, 239, 251, 257, 263, 269, 271, 277, 281, 293, 311, 317, 347

Offset

1,1

Comments

Complement of A040066 relative to A000040. - Vincenzo Librandi, Sep 13 2012

Links

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

Mathematica

ok [p_]:=Reduce[Mod[x^3 - 13, p] == 0, x, Integers] =!= False;  Select[Prime[Range[180]], ok] (* Vincenzo Librandi, Sep 11 2012 *)

Prog

(Magma) [p: p in PrimesUpTo(450) | exists(t){x : x in ResidueClassRing(p) | x^3 eq 13}]; // Vincenzo Librandi, Sep 11 2012
(PARI) select(n->ispower(Mod(13, n), 3), primes(500)) \\ Charles R Greathouse IV, Sep 11 2012

Crossrefs

Cf. A000040, A040066.

Sequence in context: A040067 A181659 A040087 * A051647 A042986 A143390

Adjacent sequences: A040062 A040063 A040064 * A040066 A040067 A040068

Keyword

nonn,easy

Author

N. J. A. Sloane.

Status

approved