|
|
A045317
|
|
Primes p such that x^8 = 3 has a solution mod p.
|
|
3
|
|
|
2, 3, 11, 13, 23, 47, 59, 71, 83, 107, 109, 131, 167, 179, 181, 191, 227, 229, 239, 251, 263, 277, 311, 313, 347, 359, 383, 419, 421, 431, 433, 443, 467, 479, 491, 503, 541, 563, 587, 599, 601, 647, 659, 683, 709
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
ok[p_]:= Reduce[Mod[x^8- 3, p] == 0, x, Integers]=!=False; Select[Prime[Range[200]], ok] (* Vincenzo Librandi, Sep 13 2012 *)
|
|
PROG
|
(Magma) [p: p in PrimesUpTo(800) | exists(t){x : x in ResidueClassRing(p) | x^8 eq 3}]; // Vincenzo Librandi, Sep 13 2012
(PARI) isok(p) = isprime(p) && ispower(Mod(3, p), 8); \\ Michel Marcus, Oct 17 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|