Rosetta Code

Primality by trial division: Difference between revisions

Page Discussion

Primality by trial division (view source)

Revision as of 18:57, 9 January 2023

22 bytes removed ,  1 year ago
→‎OCaml: simplified & faster
(Add EasyLang)
(→‎OCaml: simplified & faster)
Line 2,899:
=={{header|OCaml}}==
<syntaxhighlight lang="ocaml">let is_prime n =
iflet nrec =test 2x then true=
else if nx <* 2x > n || n mod x <> 0 && n mod (x + 2) =<> 0 then&& test (x + false6)
elsein
if n let< rec loop k =5
then n land 2 if k * k <> n then true0
else n land 1 else<> if0 && n mod k3 =<> 0 then&& test false5</syntaxhighlight>
else loop (k+2)
in loop 3</syntaxhighlight>
 
=={{header|Octave}}==
Querfeld
559

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/335328"