Find prime numbers of the form n*n*n+2: Difference between revisions
Content added Content deleted
Alextretyak (talk | contribs) (Added 11l) |
m (→{{header|Wren}}: Wren-trait -> Wren-iterate) |
||
| Line 1,675: | Line 1,675: | ||
=={{header|Wren}}== |
=={{header|Wren}}== |
||
{{libheader|Wren-math}} |
{{libheader|Wren-math}} |
||
{{libheader|Wren- |
{{libheader|Wren-iterate}} |
||
{{libheader|Wren-fmt}} |
{{libheader|Wren-fmt}} |
||
If ''n'' is even then ''n³ + 2'' is also even, so we only need to examine odd values of ''n'' here. |
If ''n'' is even then ''n³ + 2'' is also even, so we only need to examine odd values of ''n'' here. |
||
<syntaxhighlight lang="ecmascript">import "/math" for Int |
<syntaxhighlight lang="ecmascript">import "/math" for Int |
||
import "/ |
import "/iterate" for Stepped |
||
import "/fmt" for Fmt |
import "/fmt" for Fmt |
||