|
|
A040065
|
|
Primes p such that x^3 = 13 has a solution mod p.
|
|
2
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|