Primality by trial division: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: rem can be twice faster than mod. the conventional wisdom on SO: use rem over mod whenever possible.) |
(→{{header|Oz}}: new entry for Oz) |
||
| Line 1,546: | Line 1,546: | ||
pv = isthisprime(p); |
pv = isthisprime(p); |
||
disp(p( pv ));</lang> |
disp(p( pv ));</lang> |
||
=={{header|Oz}}== |
|||
<lang oz> |
|||
fun {Prime N} |
|||
local IPrime in |
|||
fun {IPrime N Acc} |
|||
if N < Acc*Acc then true |
|||
elseif (N mod Acc) == 0 then false |
|||
else {IPrime N Acc+1} |
|||
end |
|||
end |
|||
if N < 2 then false |
|||
else {IPrime N 2} end |
|||
end |
|||
end |
|||
</lang> |
|||
=={{header|PARI/GP}}== |
=={{header|PARI/GP}}== |
||