reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
base = 68; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n - 1, n] == 1, AppendTo[t, n]]]; t (* T. D. Noe, Feb 21 2012 *)
max = 5000; Select[Complement[Range[max], Prime[Range[PrimePi[max]]]], PowerMod[68, # - 1, #] == 1 &] (* _Alonso del Arte_, Jun 17 2018 *)
base = 68; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n - 1, n] == 1, AppendTo[t, n]]]; t (* T. D. Noe, Feb 21 2012 *)
Select[Range[
approved
editing
proposed
approved
editing
proposed
Composite numbers n such that 68^(n-1) == 1 (mod n). [From - _Michel Lagneau, _, Feb 18 2012]
approved
editing
base = 68; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n-1, n] == 1, AppendTo[t, n]]]; t (* _T. D. Noe, _, Feb 21 2012 *)
_David W. Wilson (davidwwilson(AT)comcast.net)_