Find squares n where n+1 is prime: Difference between revisions
Added Easylang
m (→{{header|Wren}}: Changed to Wren S/H) |
(Added Easylang) |
||
Line 471:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
n0 = 1
repeat
n = n0 * n0
until n >= 1000
if isprim (n + 1) = 1
write n & " "
.
n0 += 1
.
</syntaxhighlight>
{{out}}
<pre>
1 4 16 36 100 196 256 400 576 676
</pre>
=={{header|F_Sharp|F#}}==
| |||