Strange unique prime triplets: Difference between revisions
Added Easylang
(added RPL) |
(Added Easylang) |
||
| (One intermediate revision by one other user not shown) | |||
Line 919:
readln;
end.</syntaxhighlight>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
if num < 2
return 0
.
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
lim = 29
for n = 1 to lim
for m = n + 1 to lim
for p = m + 1 to lim
sum = n + m + p
if isprim sum = 1 and isprim n = 1 and isprim m = 1 and isprim p = 1
write "(" & n & " " & m & " " & p & ") "
.
.
.
.
</syntaxhighlight>
{{out}}
<pre>
(3 5 11) (3 5 23) (3 5 29) (3 7 13) (3 7 19) (3 11 17) (3 11 23) (3 11 29) (3 17 23) (5 7 11) (5 7 17) (5 7 19) (5 7 29) (5 11 13) (5 13 19) (5 13 23) (5 13 29) (5 17 19) (5 19 23) (5 19 29) (7 11 13) (7 11 19) (7 11 23) (7 11 29) (7 13 17) (7 13 23) (7 17 19) (7 17 23) (7 17 29) (7 23 29) (11 13 17) (11 13 19) (11 13 23) (11 13 29) (11 17 19) (11 19 23) (11 19 29) (13 17 23) (13 17 29) (13 19 29) (17 19 23) (19 23 29)
</pre>
=={{header|F_Sharp|F#}}==
Line 3,084 ⟶ 3,116:
{{libheader|Wren-iterate}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="
import "./iterate" for Stepped
import "./fmt" for Fmt
var strangePrimes = Fn.new { |n, countOnly|
Line 3,164 ⟶ 3,196:
===Faster===
The following version uses a prime sieve and is about 17 times faster than the 'basic' version.
<syntaxhighlight lang="
import "./fmt" for Fmt
var max = 1000
| |||