OFFSET
1,1
COMMENTS
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
MAPLE
isA051081 := proc(p) local x; for x from 0 to p-1 do if (x^24 mod p) = (-2 mod p) then RETURN(true) ; fi; od: RETURN(false) ; end: for i from 1 to 300 do p := ithprime(i) ; if isA051081(p) then printf("%d, ", p) ; fi; od: # R. J. Mathar, Oct 15 2008
MATHEMATICA
ok[p_]:= Reduce[Mod[x^24 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* Vincenzo Librandi, Sep 15 2012 *)
PROG
(PARI) /* see A051071 */
(Magma) [p: p in PrimesUpTo(1500) | exists(t){x : x in ResidueClassRing(p) | x^24 eq - 2}]; // Vincenzo Librandi, Sep 15 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from R. J. Mathar, Oct 15 2008
STATUS
approved