Find squares n where n+1 is prime: Difference between revisions
Content added Content deleted
No edit summary |
(Added Quackery.) |
||
Line 1,067: | Line 1,067: | ||
done... |
done... |
||
</pre> |
</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}}== |
=={{header|Racket}}== |