Search: a216736 -id:a216736
|
| |
|
|
A051074
|
|
Primes p such that x^10 = -2 has a solution mod p.
|
|
+10
2
|
|
|
|
2, 3, 17, 19, 43, 59, 67, 73, 83, 89, 97, 107, 113, 137, 139, 163, 179, 193, 227, 233, 241, 251, 257, 283, 307, 313, 337, 347, 353, 379, 409, 419, 433, 443, 449, 457, 467, 499, 523, 547, 563, 569, 571, 577, 587, 593, 617, 619, 641, 643, 659, 673, 683, 739, 769, 787, 809, 827, 857, 859, 883, 907, 929, 937, 947, 953, 971, 977, 1009
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
ok[p_]:= Reduce[Mod[x^10 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* Vincenzo Librandi, Sep 15 2012 *)
|
|
|
PROG
|
(PARI)
forprime(p=2, 2000, if([]~!=polrootsmod(x^10+2, p), print1(p, ", "))); print();
(Magma) [p: p in PrimesUpTo(1200) | exists(t){x : x in ResidueClassRing(p) | x^10 eq - 2}]; // Vincenzo Librandi, Sep 15 2012
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
Search completed in 0.006 seconds
|
