|
MATHEMATICA
|
(* first do *) Needs["NumberTheory`NumberTheoryFunctions`"] (* then *) PrimeFactors[n_] := Flatten[ Table[ # [[1]], {1} ] & /@ FactorInteger[ n ]]; f[n_] := Block[{k = n + 1}, If[EvenQ[k], k++ ]; While[ PrimeQ[k] || Union[ PowerMod[ PrimeFactors[n], k - 1, k]] != {1}, k += 2]; k]; a = {1}; b = {9}; Do[ If[ SquareFreeQ[n], c = f[n]; If[c > b[[ -1]], AppendTo[a, n]; AppendTo[b, c]; Print[n]]], {n, 2, 145000}]; b
|
