Penta-power prime seeds: Difference between revisions

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 size must be specified on the command line, e.g. <code>-heap 1024M</code>.

# n^p + n + 1 is prime for p = 0. 1, 2, 3, 4 #

PR read "primes.incl.a68" PR # include prime utilities #

)

OD

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2022-04-03}}

math.primes prettyprint tools.memory.private ;

 

 

"First thirty penta-power prime seeds:" print

{{out}}

<pre>

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">include</span> <span style="color: #004080;">mpfr</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">while</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"First penta-power prime seed greater than:\n%s"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">l</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

 

=={{header|Raku}}==

 

my @ppps = lazy (^∞).hyper(:5000batch).map(* × 2 + 1).grep: -> \n { my \k = n + 1; (1+k).is-prime && (n+k).is-prime && (n²+k).is-prime && (n³+k).is-prime && (n⁴+k).is-prime }

my $key = @ppps.first: * > $threshold, :k;

say "{$threshold.&cardinal.fmt: '%13s'} is the {ordinal-digit $key + 1}: {@ppps[$key].&comma}";

{{out}}

<pre>First thirty penta-power prime seeds:

{{libheader|Wren-gmp}}

{{libheader|Wren-fmt}}

import "./fmt" for Fmt

 

}

n = n + 2

 

{{out}}