Find squares n where n+1 is prime: Difference between revisions
Added Easylang
No edit summary |
(Added Easylang) |
||
| (2 intermediate revisions by 2 users not shown) | |||
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#}}==
Line 1,067 ⟶ 1,094:
done...
</pre>
=={{header|Quackery}}==
<code>isprime</code> is defined at [[Primality by trial division#Quackery]].
<syntaxhighlight lang="Quackery"> [] [] 0
[ 1+ dup 2 **
dup 1000 < while
1+ isprime if
[ dup dip join ]
again ]
2drop
witheach [ 2 ** join ]
echo</syntaxhighlight>
{{out}}
<pre>[ 1 4 16 36 100 196 256 400 576 676 ]</pre>
=={{header|Racket}}==
Line 1,265 ⟶ 1,310:
=={{header|Wren}}==
{{libheader|Wren-math}}
<syntaxhighlight lang="
var squares = []
| |||