|
|
A040162
|
|
Primes p such that x^5 = 3 has no solution mod p.
|
|
2
|
|
|
11, 31, 61, 71, 101, 131, 151, 181, 191, 211, 241, 251, 271, 281, 311, 331, 401, 421, 461, 521, 541, 571, 601, 631, 641, 691, 701, 751, 811, 821, 881, 911, 941, 971, 991, 1031, 1061, 1151, 1181, 1201, 1231, 1291, 1301, 1321, 1361, 1381, 1451, 1481, 1531
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
ok[p_]:= Reduce[Mod[x^5 - 3, p] == 0, x, Integers] == False; Select[Prime[Range[300]], ok] (* Vincenzo Librandi, Sep 18 2012 *)
|
|
PROG
|
(Magma) [ p: p in PrimesUpTo(1600) | forall(t){x : x in ResidueClassRing(p) | x^5 ne 3} ]; // Klaus Brockhaus, Jun 03 2009
(Magma) [p: p in PrimesUpTo(1550) | not exists{x : x in ResidueClassRing(p) | x^5 eq 3} ]; // Vincenzo Librandi, Sep 18 2012
|
|
CROSSREFS
|
Cf. A040161 (primes p such that x^5 = 3 has a solution mod p).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|