Penta-power prime seeds: Difference between revisions
m
→{{header|ALGOL 68}}: Added note about the heap size.
(→{{header|ALGOL 68}}: spelling...) |
m (→{{header|ALGOL 68}}: Added note about the heap size.) |
||
Line 27:
This is about 10 times faster than the equivalent Quad-powwr prime seed program, possibly because even numbers are excluded and the n+2 test eliminates more numbers before the higher powers must be calculated..
{{libheader|ALGOL 68-primes}}
NB: The source of the ALGOL 68-primes library is on a Rosetta Code code page linked from the above.<br>
Note that to run this with ALGOL 68G under Windows (and probably Linux) a large heap sie must be specified on the command line, e.g. <code>-heap 1024M</code>.
<lang algol68>BEGIN # find some Penta power prime seeds, numbers n such that: #
# n^p + n + 1 is prime for p = 0. 1, 2, 3, 4 #
| |||