OFFSET
1,1
COMMENTS
LINKS
Bruno Berselli, Table of n, a(n) for n = 1..1000
MATHEMATICA
Select[Prime[Range[PrimePi[400]]], ! MemberQ[PowerMod[Range[#], 48, #], Mod[2, #]] &]
ok[p_] := Reduce[Mod[x^48 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[75]], ok] (* Vincenzo Librandi, Sep 21 2012 *)
PROG
(Magma) [p: p in PrimesUpTo(400) | forall{x: x in ResidueClassRing(p) | x^48 ne 2}];
(PARI)
N=10^4; default(primelimit, N);
ok(p, r, k)={ return ( (p==r) || (Mod(r, p)^((p-1)/gcd(k, p-1))==1) ); }
forprime(p=2, N, if (! ok(p, 2, 48), print1(p, ", ")));
/* Joerg Arndt, Sep 21 2012 */
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Bruno Berselli, Sep 14 2012
STATUS
approved