A216484 Primes p such that x^36 = 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
Crossrefs
Programs
-
Magma
[p: p in PrimesUpTo(400) | forall{x: x in ResidueClassRing(p) | x^36 ne 2}];
-
Mathematica
ok[p_] := Reduce[Mod[x^36 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[500]], ok] Select[Prime[Range[PrimePi[400]]], ! MemberQ[PowerMod[Range[#], 36, #], Mod[2, #]] &] (* Bruno Berselli, Sep 14 2012 *)
Comments