OFFSET
1,1
COMMENTS
Composite numbers n such that 32^(n-1) == 1 (mod n). - Michel Lagneau, Feb 18 2012
LINKS
MATHEMATICA
pseudos32 = {}; n = 1; While[Length[pseudos32] < 100, n++; If[!PrimeQ[n] && PowerMod[32, n - 1, n] == 1, AppendTo[pseudos32, n]]]; pseudos32 (* T. D. Noe, Feb 21 2012 *)
max = 5000; Complement[Select[Range[max], PowerMod[32, # - 1, #] == 1 &], Prime[Range[PrimePi[max]]]] (* Alonso del Arte, Jun 12 2018 *)
Select[Range[5000], CompositeQ[#]&&PowerMod[32, #-1, #]==1&] (* Harvey P. Dale, Sep 27 2024 *)
PROG
(Magma) [n: n in [3..10000 by 2] | IsOne(Modexp(32, n-1, n)) and not IsPrime(n)]; // Vincenzo Librandi, Jun 13 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved