RosettaCodeData/Task/Primality-by-trial-division/Mathematica/primality-by-trial-division.math
2015-02-20 00:35:01 -05:00

5 lines
211 B
Text

IsPrime[n_Integer] := Block[{},
If[n <= 1, Return[False]];
If[n == 2, Return[True]]; If[Mod[n, 2] == 0, Return[False]];
For[k = 3, k <= Sqrt[n], k += 2, If[Mod[n, k] == 0, Return[False]]];
Return[True]]