Primality by trial division: Difference between revisions
Content added Content deleted
(Added PicoLisp) |
No edit summary |
||
Line 414: | Line 414: | ||
1 |
1 |
||
</pre> |
</pre> |
||
=={{header|Mathematica}}== |
|||
<lang>IsPrime[n_Integer] := |
|||
Module[{k = 2}, |
|||
If[n <= 1, Return False]; |
|||
If[n == 2, Return True]; |
|||
While[k <= Sqrt[n], |
|||
If[Mod[n, k] == 0, Return[False], k++] |
|||
]; |
|||
Return[True] |
|||
]</lang> |
|||
=={{header|MAXScript}}== |
=={{header|MAXScript}}== |