Find prime numbers of the form n*n*n+2: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add Draco) |
(Added Quackery.) |
||
Line 1,285: | Line 1,285: | ||
189 6751271</pre> |
189 6751271</pre> |
||
=={{header|Quackery}}== |
|||
<code>isprime</code> is defined at [[Primality by trial division#Quackery]]. |
|||
<syntaxhighlight lang="Quackery"> [ dip number$ |
|||
over size - |
|||
space swap of |
|||
swap join echo$ ] is recho ( n n --> ) |
|||
199 times |
|||
[ i^ 1+ 3 ** 2 + |
|||
dup isprime iff |
|||
[ i^ 1+ 4 recho |
|||
sp 7 recho cr ] |
|||
else drop ]</syntaxhighlight> |
|||
{{out}} |
|||
<pre> 1 3 |
|||
3 29 |
|||
5 127 |
|||
29 24391 |
|||
45 91127 |
|||
63 250049 |
|||
65 274627 |
|||
69 328511 |
|||
71 357913 |
|||
83 571789 |
|||
105 1157627 |
|||
113 1442899 |
|||
123 1860869 |
|||
129 2146691 |
|||
143 2924209 |
|||
153 3581579 |
|||
171 5000213 |
|||
173 5177719 |
|||
189 6751271 |
|||
</pre> |
|||
=={{header|Raku}}== |
=={{header|Raku}}== |