Quad-power prime seeds: Difference between revisions
Content added Content deleted
m (Added link to the Penta-power prime seeds task.) |
m (→{{header|ALGOL 68}}: dodgy keyboard induced typo (again....)) |
||
| Line 27: | Line 27: | ||
This is about 10 times slower than the equivalent Penta-powwr prime seed program, possibly because even numbers are included and the n+2 test in the Penta-powers eliminates more numbers before the higher powers must be calculated. |
This is about 10 times slower than the equivalent Penta-powwr prime seed program, possibly because even numbers are included and the n+2 test in the Penta-powers eliminates more numbers before the higher powers must be calculated. |
||
<br> |
<br> |
||
Note that to run this with ALGOL 68G under Windows (and probably Linux) a large heap |
Note that to run this with ALGOL 68G under Windows (and probably Linux) a large heap size must be specified on the command line, e.g. <code>-heap 1024M</code>. |
||
<lang algol68>BEGIN # find some Quad power prime seeds, numbers n such that: # |
<lang algol68>BEGIN # find some Quad power prime seeds, numbers n such that: # |
||
# n^p + n + 1 is prime for p = 1, 2, 3, 4 # |
# n^p + n + 1 is prime for p = 1, 2, 3, 4 # |
||