login
A040062
Primes p such that x^3 = 12 has a solution mod p.
2
2, 3, 5, 11, 13, 17, 19, 23, 29, 41, 47, 53, 59, 71, 79, 83, 89, 97, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 197, 199, 211, 227, 233, 239, 251, 257, 263, 269, 281, 293, 307, 311, 317, 331, 347, 353, 359
OFFSET
1,1
COMMENTS
Complement of A040064 relative to A000040. - Vincenzo Librandi, Sep 13 2012
LINKS
MATHEMATICA
ok [p_]:=Reduce[Mod[x^3 - 12, 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 12}]; // Vincenzo Librandi, Sep 11 2012
(PARI) select(n->ispower(Mod(12, n), 3), primes(500)) \\ Charles R Greathouse IV, Sep 11 2012
CROSSREFS
Sequence in context: A322173 A216509 A075237 * A115653 A042997 A220815
KEYWORD
nonn,easy
AUTHOR
STATUS
approved