A059264 Primes p such that x^12 = 2 has no solution mod p.
3, 5, 7, 11, 13, 17, 19, 29, 37, 41, 43, 53, 59, 61, 67, 73, 79, 83, 97, 101, 103, 107, 109, 131, 137, 139, 149, 151, 157, 163, 173, 179, 181, 193, 197, 199, 211, 227, 229, 241, 251, 269, 271, 277, 283, 293, 307, 313, 317, 331, 337, 347, 349, 367, 373, 379, 389
Offset: 1
Links
- Vincenzo Librandi, Table of n, a(n) for n = 1..5000
Programs
-
Mathematica
ok[p_] := Reduce[Mod[x^12 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[100]],ok] (* Vincenzo Librandi, Sep 14 2012 *) Select[ Prime@ Range@ PrimePi@400, !MemberQ[ PowerMod[ Range@#, 12, #], Mod[2, #]] &] (* Robert G. Wilson v, Nov 05 2016 after Bruno Berselli in A059362 *)
Comments