login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A040054
Primes p such that x^3 = 10 has a solution mod p.
2
2, 3, 5, 11, 17, 23, 29, 37, 41, 47, 53, 59, 71, 73, 79, 83, 89, 101, 103, 107, 113, 127, 131, 137, 139, 149, 167, 173, 179, 191, 197, 227, 233, 239, 251, 257, 263, 269, 271, 281, 293, 311, 317, 331, 347, 349, 353
OFFSET
1,1
COMMENTS
Complement of A040058 relative to A000040. - Vincenzo Librandi, Sep 13 2012
LINKS
MATHEMATICA
ok [p_]:=Reduce[Mod[x^3 - 10, 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 10}]; // Vincenzo Librandi, Sep 11 2012
CROSSREFS
Sequence in context: A049571 A263090 A098058 * A093503 A040036 A040078
KEYWORD
nonn,easy
AUTHOR
STATUS
approved