Primality by trial division: Difference between revisions
→Functional
Langurmonkey (talk | contribs) |
Langurmonkey (talk | contribs) |
||
| (5 intermediate revisions by 2 users not shown) | |||
Line 368:
endmethod.
ENDCLASS.</syntaxhighlight>
=={{header|ABC}}==
<syntaxhighlight lang="ABC">HOW TO REPORT prime n:
REPORT n>=2 AND NO d IN {2..floor root n} HAS n mod d = 0
FOR n IN {1..100}:
IF prime n: WRITE n</syntaxhighlight>
{{out}}
<pre>2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97</pre>
=={{header|ACL2}}==
Line 3,033 ⟶ 3,042:
Below, we use an implied parameter (.i) on the .isPrime function.
<syntaxhighlight lang="langur">val .isPrime =
not any fn(.x) { .i div .x }, pseries 2 .. .i ^/ 2
}
writeln filter .isPrime, series 100</syntaxhighlight>
Line 3,040 ⟶ 3,051:
=== Recursive ===
{{trans|Go}}
<syntaxhighlight lang="langur">val .isPrime =
val .n = abs(.i)
if .n <= 2: return .n == 2
val .chkdiv =
if .i
return .n ndiv .i and self(.n, .i+2)
}
Line 4,910 ⟶ 4,921:
Original source: [http://seed7.sourceforge.net/algorith/math.htm#is_prime]
=={{header|SETL}}==
<syntaxhighlight lang="setl">program trial_division;
print({n : n in {1..100} | prime n});
op prime(n);
return n>=2 and not exists d in {2..floor sqrt n} | n mod d = 0;
end op;
end program;</syntaxhighlight>
{{out}}
<pre>{2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97}</pre>
=={{header|Sidef}}==
<syntaxhighlight lang="ruby">func is_prime(a) {
| |||