Find prime numbers of the form n*n*n+2: Difference between revisions
Content added Content deleted
(→{{header|Quackery}}: Faster primality test) |
|||
| Line 1,458: | Line 1,458: | ||
=={{header|Quackery}}== |
=={{header|Quackery}}== |
||
<code> |
<code>prime</code> is defined at [[Miller–Rabin primality test#Quackery]]. |
||
<syntaxhighlight lang="Quackery"> [ dip number$ |
<syntaxhighlight lang="Quackery"> [ dip number$ |
||
| Line 1,467: | Line 1,467: | ||
199 times |
199 times |
||
[ i^ 1+ 3 ** 2 + |
[ i^ 1+ 3 ** 2 + |
||
dup |
dup prime iff |
||
[ i^ 1+ 4 recho |
[ i^ 1+ 4 recho |
||
sp 7 recho cr ] |
sp 7 recho cr ] |
||