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”).

A040060
Primes p such that x^3 = 11 has a solution mod p.
2
2, 3, 5, 11, 17, 19, 23, 29, 37, 41, 43, 47, 53, 59, 61, 71, 83, 89, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 193, 197, 199, 211, 227, 229, 233, 239, 251, 257, 263, 269, 281, 293, 311, 317, 337, 347, 349
OFFSET
1,1
COMMENTS
Complement of A040061 relative to A000040. - Vincenzo Librandi, Sep 13 2012
LINKS
MATHEMATICA
ok [p_]:=Reduce[Mod[x^3 - 11, 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 11}]; // Vincenzo Librandi, Sep 11 2012
(PARI) select(n->ispower(Mod(11, n), 3), primes(500)) \\ Charles R Greathouse IV, Sep 11 2012
CROSSREFS
Sequence in context: A001882 A044042 A175179 * A220627 A040083 A045308
KEYWORD
nonn,easy
AUTHOR
STATUS
approved