Rosetta Code

Find prime numbers of the form n*n*n+2: Difference between revisions

Page Discussion

Find prime numbers of the form n*n*n+2 (view source)

Revision as of 07:47, 16 April 2024

7,268 bytes added ,  1 month ago
Added Easylang
(Add COBOL)
(Added Easylang)
 
(16 intermediate revisions by 13 users not shown)
Line 3:
;Task: Find prime numbers of the form &nbsp; <big> n<sup>''3''</sup>+2</big>, &nbsp; where 0 < n < 200
<br><br>
 
=={{header|11l}}==
{{trans|Python}}
 
<syntaxhighlight lang="11l">
F isPrime(n)
L(i) 2 .. Int(n ^ 0.5)
I n % i == 0
R 0B
R 1B
 
L(n) 1..199
I isPrime(n ^ 3 + 2)
print(n"\t"(n ^ 3 + 2))
</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|Ada}}==
<langsyntaxhighlight Adalang="ada">with Ada.Text_Io;
 
procedure Find_Primes is
Line 20 ⟶ 58:
if A mod 3 = 0 then return False; end if;
D := 5;
while D * D <= A loop
if A mod D = 0 then
return False;
Line 45 ⟶ 83:
end if;
end loop;
end Find_Primes;</langsyntaxhighlight>
{{out}}
<pre> N N**3+2
Line 70 ⟶ 108:
 
=={{header|ALGOL 68}}==
<langsyntaxhighlight lang="algol68">BEGIN # Find n such that n^3 + 2 is a prime for n < 200 #
FOR n TO 199 DO
INT candidate = ( n * n * n ) + 2;
Line 84 ⟶ 122:
FI
OD
END</langsyntaxhighlight>
{{out}}
<pre>
Line 109 ⟶ 147:
 
=={{header|ALGOL W}}==
<langsyntaxhighlight lang="algolw">begin % Find n such that n^3 + 2 is a prime for n < 200 %
for n := 1 until 199 do begin
integer candidate;
Line 127 ⟶ 165:
end if_isPrime
end for_n
end.</langsyntaxhighlight>
{{out}}
<pre>
Line 150 ⟶ 188:
189: 6751271
</pre>
 
=={{header|Arturo}}==
<syntaxhighlight lang="arturo">primes: []
loop 1..199 'i [
num: 2 + i^3
if prime? num ->
'primes ++ @[to :string i, to :string num]
]
 
loop primes [i, num][
prints pad i 4
print pad num 9
]</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|AWK}}==
<syntaxhighlight lang="awk">
<lang AWK>
# syntax: GAWK -f FIND_PRIME_NUMBERS_OF_THE_FORM_NNN2.AWK
BEGIN {
Line 178 ⟶ 251:
return(1)
}
</syntaxhighlight>
</lang>
{{out}}
<pre>
Line 205 ⟶ 278:
=={{header|C}}==
{{trans|Wren}}
<langsyntaxhighlight lang="c">#include <stdio.h>
#include <stdbool.h>
#include <locale.h>
Line 235 ⟶ 308:
}
return 0;
}</langsyntaxhighlight>
 
{{out}}
Line 261 ⟶ 334:
 
=={{header|C++}}==
<langsyntaxhighlight lang="cpp">#include <iomanip>
#include <iostream>
 
Line 287 ⟶ 360:
std::cout << std::setw(3) << n << std::setw(9) << p << '\n';
}
}</langsyntaxhighlight>
 
{{out}}
Line 313 ⟶ 386:
 
=={{header|CLU}}==
<langsyntaxhighlight lang="clu">is_prime = proc (n: int) returns (bool)
if n<2 then return(false) end
if n//2=0 then return(n=2) end
Line 344 ⟶ 417:
stream$putl(po, "")
end
end start_up</langsyntaxhighlight>
{{out}}
<pre>n = 1 => n^3 + 2 = 3
Line 367 ⟶ 440:
 
=={{header|COBOL}}==
<langsyntaxhighlight lang="cobol"> IDENTIFICATION DIVISION.
PROGRAM-ID. N3-PLUS-2-PRIMES.
Line 437 ⟶ 510:
CHECK-PRIME-DONE.
EXIT.</langsyntaxhighlight>
{{out}}
<pre>N = 1 => N ** 3 + 2 = 3
Line 460 ⟶ 533:
 
=={{header|Cowgol}}==
<langsyntaxhighlight lang="cowgol">include "cowgol.coh";
 
sub is_prime(n: uint32): (p: uint8) is
Line 495 ⟶ 568:
end if;
n := n+1;
end loop;</langsyntaxhighlight>
{{out}}
<pre>n = 1 => n^3 + 2 = 3
Line 520 ⟶ 593:
{{libheader| System.SysUtils}}
{{libheader| PrimTrial}}
<syntaxhighlight lang="delphi">
<lang Delphi>
program Find_prime_numbers_of_the_form_n_n_n_plus_2;
 
Line 548 ⟶ 621:
end;
readln;
end.</langsyntaxhighlight>
{{out}}
<pre>n = 1 => n^3 + 2 = 3
Line 569 ⟶ 642:
n = 173 => n^3 + 2 = 5,177,719
n = 189 => n^3 + 2 = 6,751,271</pre>
 
=={{header|Draco}}==
<syntaxhighlight lang="draco">proc nonrec is_prime(ulong n) bool:
ulong d;
bool prime;
if n<=4 then n=2 or n=3
elif n&1=0 or n%3=0 then false
else
d := 5;
prime := true;
while prime and d*d <= n do
if n%d=0 then prime := false fi;
d := d+2;
if n%d=0 then prime := false fi;
d := d+4
od;
prime
fi
corp
 
proc nonrec main() void:
word n;
ulong p;
for n from 1 upto 200 do
p := make(n,ulong);
p := p*p*p + 2;
if is_prime(p) then
writeln("n = ", n:3, " => n^3 + 2 = ", p:7)
fi
od
corp</syntaxhighlight>
{{out}}
<pre>n = 1 => n^3 + 2 = 3
n = 3 => n^3 + 2 = 29
n = 5 => n^3 + 2 = 127
n = 29 => n^3 + 2 = 24391
n = 45 => n^3 + 2 = 91127
n = 63 => n^3 + 2 = 250049
n = 65 => n^3 + 2 = 274627
n = 69 => n^3 + 2 = 328511
n = 71 => n^3 + 2 = 357913
n = 83 => n^3 + 2 = 571789
n = 105 => n^3 + 2 = 1157627
n = 113 => n^3 + 2 = 1442899
n = 123 => n^3 + 2 = 1860869
n = 129 => n^3 + 2 = 2146691
n = 143 => n^3 + 2 = 2924209
n = 153 => n^3 + 2 = 3581579
n = 171 => n^3 + 2 = 5000213
n = 173 => n^3 + 2 = 5177719
n = 189 => n^3 + 2 = 6751271</pre>
 
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
for n = 1 to 199
p = pow n 3 + 2
if isprim p = 1
write p & " "
.
.
</syntaxhighlight>
{{out}}
<pre>
3 29 127 24391 91127 250049 274627 328511 357913 571789 1157627 1442899 1860869 2146691 2924209 3581579 5000213 5177719 6751271
</pre>
 
=={{header|F_Sharp|F#}}==
This task uses [[Extensible_prime_generator#The_functions|Extensible Prime Generator (F#)]].<br>
<langsyntaxhighlight lang="fsharp">
[1..2..200]|>Seq.filter(fun n->isPrime(2+pown n 3))|>Seq.iter(fun n->printfn "n=%3d -> %d" n (2+pown n 3))
</syntaxhighlight>
</lang>
{{out}}
<pre>
Line 597 ⟶ 745:
n=189 -> 6751271
</pre>
 
=={{header|Factor}}==
Using the parity optimization from the Wren entry:
{{works with|Factor|0.99 2021-02-05}}
<langsyntaxhighlight lang="factor">USING: formatting kernel math math.functions math.primes
math.ranges sequences tools.memory.private ;
 
Line 606 ⟶ 755:
dup 3 ^ 2 + dup prime?
[ commas "n = %3d => n³ + 2 = %9s\n" printf ] [ 2drop ] if
] each</langsyntaxhighlight>
Or, using local variables:
{{trans|Wren}}
{{works with|Factor|0.99 2021-02-05}}
<langsyntaxhighlight lang="factor">USING: formatting kernel math math.primes math.ranges sequences
tools.memory.private ;
 
Line 620 ⟶ 769:
[ n p commas "n = %3d => n³ + 2 = %9s\n" printf ] when
] each
]</langsyntaxhighlight>
{{out}}
<pre>
Line 645 ⟶ 794:
 
=={{header|Fermat}}==
<langsyntaxhighlight lang="fermat">for n=1,199 do if Isprime(n^3+2)=1 then !!(n,n^3+2) fi od</langsyntaxhighlight>
{{out}}
<pre>
Line 671 ⟶ 820:
=={{header|Forth}}==
{{works with|Gforth}}
<langsyntaxhighlight lang="forth">: prime? ( n -- flag )
dup 2 < if drop false exit then
dup 2 mod 0= if 2 = exit then
Line 696 ⟶ 845:
 
main
bye</langsyntaxhighlight>
 
{{out}}
Line 723 ⟶ 872:
=={{header|FreeBASIC}}==
Use the code from [[Primality by trial division#FreeBASIC]] as an include.
<langsyntaxhighlight lang="freebasic">#include"isprime.bas"
 
for n as uinteger = 1 to 200
Line 729 ⟶ 878:
print n, n^3+2
end if
next n</langsyntaxhighlight>
{{out}}
<pre>
Line 751 ⟶ 900:
173 5177719
189 6751271
</pre>
 
=={{header|Frink}}==
<syntaxhighlight lang="frink">for n = 1 to 199
if isPrime[n^3 + 2]
println["$n\t" + n^3+2]</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|Fōrmulæ}}==
 
{{FormulaeEntry|page=https://formulae.org/?script=examples/Find_prime_numbers_of_the_form_n%C2%B3%2B2}}
Fōrmulæ programs are not textual, visualization/edition of programs is done showing/manipulating structures but not text. Moreover, there can be multiple visual representations of the same program. Even though it is possible to have textual representation &mdash;i.e. XML, JSON&mdash; they are intended for storage and transfer purposes more than visualization and edition.
 
'''Solution'''
 
[[File:Fōrmulæ - Find prime numbers of the form n³ + 2 01.png]]
Programs in Fōrmulæ are created/edited online in its [https://formulae.org website], However they run on execution servers. By default remote servers are used, but they are limited in memory and processing power, since they are intended for demonstration and casual use. A local server can be downloaded and installed, it has no limitations (it runs in your own computer). Because of that, example programs can be fully visualized and edited, but some of them will not run if they require a moderate or heavy computation/memory resources, and no local server is being used.
 
[[File:Fōrmulæ - Find prime numbers of the form n³ + 2 02.png]]
In '''[https://formulae.org/?example=Find_prime_numbers_of_the_form_n%C2%B3%2B2 this]''' page you can see the program(s) related to this task and their results.
 
=={{header|Go}}==
<langsyntaxhighlight lang="go">package main
 
import "fmt"
Line 813 ⟶ 991:
}
}
}</langsyntaxhighlight>
 
{{out}}
Line 839 ⟶ 1,017:
 
=={{header|J}}==
<langsyntaxhighlight lang="j">([,.2+]^3:)@([#~1:p:2+]^3:) }.i.200x</langsyntaxhighlight>
{{out}}
<pre> 1 3
Line 867 ⟶ 1,045:
Using a definition of `is_prime` such as can be found at
[[Safe_primes_and_unsafe_primes]]:
<syntaxhighlight lang="jq">
<lang jq>
range(1;200) | pow(.; 3) + 2 | select(is_prime)
</syntaxhighlight>
</lang>
{{out}}
<pre>
Line 894 ⟶ 1,072:
 
=={{header|Julia}}==
<langsyntaxhighlight lang="julia"># Formatting output as in Go example.
using Primes, Formatting
 
Line 915 ⟶ 1,093:
 
filterprintresults(isncubedplus2prime, 0, 200, tostring)
</langsyntaxhighlight>{{out}}
<pre>
n = 1 => n³ + 2 = 3
Line 940 ⟶ 1,118:
</pre>
=== One-liner version ===
<langsyntaxhighlight lang="julia">using Primes; println(filter(isprime, map(x -> x^3 + 2, 1:199)))</langsyntaxhighlight>{{out}}<pre>
[3, 29, 127, 24391, 91127, 250049, 274627, 328511, 357913, 571789, 1157627, 1442899, 1860869, 2146691, 2924209, 3581579, 5000213, 5177719, 6751271]</pre>
 
=={{header|MAD}}==
<langsyntaxhighlight lang="mad"> NORMAL MODE IS INTEGER
INTERNAL FUNCTION(P)
Line 970 ⟶ 1,148:
END OF CONDITIONAL
LOOP CONTINUE
END OF PROGRAM</langsyntaxhighlight>
{{out}}
<pre>N = 1 N*N*N + 2 = 3
Line 993 ⟶ 1,171:
 
=={{header|Mathematica}}/{{header|Wolfram Language}}==
<langsyntaxhighlight Mathematicalang="mathematica">Select[Range[199]^3 + 2, PrimeQ]</langsyntaxhighlight>
{{out}}
<pre>{3, 29, 127, 24391, 91127, 250049, 274627, 328511, 357913, 571789, 1157627, 1442899, 1860869, 2146691, 2924209, 3581579, 5000213, 5177719, 6751271}</pre>
 
=={{header|Nim}}==
<langsyntaxhighlight Nimlang="nim">import strutils
 
func isPrime(n: Positive): bool =
Line 1,015 ⟶ 1,193:
let p = n * n * n + 2
if p.isPrime:
echo ($n).align(3), " → ", p</langsyntaxhighlight>
 
{{out}}
Line 1,039 ⟶ 1,217:
 
=={{header|PARI/GP}}==
<langsyntaxhighlight lang="parigp">for(N=1,200,if(isprime(N^3+2),print(N," ",N^3+2)))</langsyntaxhighlight>
{{out}}
<pre>
Line 1,061 ⟶ 1,239:
173 5177719
189 6751271
</pre>
 
=={{header|Pascal}}==
==={{header|Free Pascal}}===
{{trans|Delphi}}
{{libheader| PrimTrial}}
<syntaxhighlight lang="pascal">
program Find_prime_numbers_of_the_form_n_n_n_plus_2;
{$IFDEF FPC}
{$MODE DELPHI} {$Optimization ON,ALL} {$COPERATORS ON}{$CODEALIGN proc=16}
{$ENDIF}
{$IFDEF WINDOWS}
{$APPTYPE CONSOLE}
{$ENDIF}
uses
PrimTrial;
type
myString = String[31];
 
function Numb2USA(n:Uint64):myString;
const
//extend s by the count of comma to be inserted
deltaLength : array[0..24] of byte =
(0,0,0,0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7);
var
pI :pChar;
i,j : NativeInt;
Begin
str(n,result);
i := length(result);
//extend s by the count of comma to be inserted
// j := i+ (i-1) div 3;
j := i+deltaLength[i];
if i<> j then
Begin
setlength(result,j);
pI := @result[1];
dec(pI);
while i > 3 do
Begin
//copy 3 digits
pI[j] := pI[i];
pI[j-1] := pI[i-1];
pI[j-2] := pI[i-2];
// insert comma
pI[j-3] := ',';
dec(i,3);
dec(j,4);
end;
end;
end;
 
function n3_2(n:Uint32):Uint64;inline;
begin
n3_2 := UInt64(n)*n*n+2;
end;
 
const
limit =200;//trunc(exp(ln((HIGH(UInt32)-2))/3));
 
var
p : Uint64;
n : Uint32;
begin
n := 1;
repeat
p := n3_2(n);
if isPrime(p) then
writeln('n = ', Numb2USA(n):4, ' => n^3 + 2 = ', Numb2USA(p): 10);
inc(n,2);// n must be odd for n > 0
until n > Limit;
{$IFDEF WINDOWS}
readln;
{$IFEND}
end.</syntaxhighlight>
{{out}}
<pre>
n = 1 => n^3 + 2 = 3
n = 3 => n^3 + 2 = 29
n = 5 => n^3 + 2 = 127
n = 29 => n^3 + 2 = 24,391
n = 45 => n^3 + 2 = 91,127
n = 63 => n^3 + 2 = 250,049
n = 65 => n^3 + 2 = 274,627
n = 69 => n^3 + 2 = 328,511
n = 71 => n^3 + 2 = 357,913
n = 83 => n^3 + 2 = 571,789
n = 105 => n^3 + 2 = 1,157,627
n = 113 => n^3 + 2 = 1,442,899
n = 123 => n^3 + 2 = 1,860,869
n = 129 => n^3 + 2 = 2,146,691
n = 143 => n^3 + 2 = 2,924,209
n = 153 => n^3 + 2 = 3,581,579
n = 171 => n^3 + 2 = 5,000,213
n = 173 => n^3 + 2 = 5,177,719
n = 189 => n^3 + 2 = 6,751,271
</pre>
 
=={{header|Perl}}==
<langsyntaxhighlight lang="perl">use strict;
use warnings;
use feature 'say';
Line 1,080 ⟶ 1,354:
}
print "\n";
}</langsyntaxhighlight>
 
{{out}}
Line 1,099 ⟶ 1,373:
 
=={{header|Phix}}==
<!--<langsyntaxhighlight Phixlang="phix">(phixonline)-->
<span style="color: #008080;">function</span> <span style="color: #000000;">pn3p2</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span>
<span style="color: #004080;">integer</span> <span style="color: #000000;">n3p2</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">power</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">3</span><span style="color: #0000FF;">)+</span><span style="color: #000000;">2</span>
Line 1,107 ⟶ 1,381:
<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;">"Found %d primes of the form n^3+2:\n"</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">))</span>
<span style="color: #7060A8;">papply</span><span style="color: #0000FF;">(</span><span style="color: #004600;">true</span><span style="color: #0000FF;">,</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;">"n = %3d =&gt; n^3+2 = %,9d\n"</span><span style="color: #0000FF;">},</span><span style="color: #000000;">res</span><span style="color: #0000FF;">})</span>
<!--</langsyntaxhighlight>-->
{{out}}
<pre>
Line 1,133 ⟶ 1,407:
 
=={{header|Plain English}}==
<langsyntaxhighlight lang="plainenglish">To run:
Start up.
Put 1 into a counter.
Line 1,146 ⟶ 1,420:
Write "Done." on the console.
Wait for the escape key.
Shut down.</langsyntaxhighlight>
{{out}}
<pre>
Line 1,169 ⟶ 1,443:
189 6751271
Done.
</pre>
 
 
=={{header|Python}}==
<syntaxhighlight lang="python">#!/usr/bin/python
 
def isPrime(n):
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
 
if __name__ == '__main__':
for n in range(1, 200):
if isPrime(n**3+2):
print(f'{n}\t{n**3+2}');</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|Quackery}}==
 
<code>prime</code> is defined at [[Miller–Rabin primality test#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 prime 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}}==
<syntaxhighlight lang="raku" perl6line># 20210315 Raku programming solution
 
say ((1…199)»³ »+»2).grep: *.is-prime</langsyntaxhighlight>
{{out}}
<pre>
Line 1,189 ⟶ 1,537:
Since the task's requirements are pretty straight-forward and easy, &nbsp; a little extra code was added for presentation
<br>(title and title separator line, &nbsp; the count of primes found, &nbsp; and commatization of the numbers).
<langsyntaxhighlight lang="rexx">/*REXX program finds and displays n primes of the form: n**3 + 2. */
parse arg LO HI hp . /*obtain optional argument from the CL.*/
if LO=='' | LO=="," then LO= 0 /*Not specified? Then use the default.*/
Line 1,236 ⟶ 1,584:
end /*k*/ /* [↑] only process numbers ≤ √ J */
#= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */
end /*j*/; return</langsyntaxhighlight>
{{out|output|text=&nbsp; when using the default inputs:}}
<pre>
Line 1,266 ⟶ 1,614:
 
=={{header|Ring}}==
<langsyntaxhighlight lang="ring">
load "stdlib.ring"
 
Line 1,279 ⟶ 1,627:
 
see "done..." + nl
</syntaxhighlight>
</lang>
{{out}}
<pre>
Line 1,305 ⟶ 1,653:
 
</pre>
 
=={{header|RPL}}==
{{works with|HP|49g}}
≪ { }
1 200 '''FOR''' n
n 3 ^ 2 +
'''IF''' DUP ISPRIME? '''THEN''' + '''ELSE''' DROP '''END'''
'''NEXT'''
≫ '<span style="color:blue">TASK</span>' STO
{{out}}
<pre>
1: {3 29 127 24391 91127 250049 274627 328511 357913 571789 1157627 1442899 1860869 2146691 2924209 3581579 5000213 5177719 6751271}
</pre>
 
=={{header|Ruby}}==
<syntaxhighlight lang="ruby">require 'prime'
p (1..200).filter_map{|n| cand = n**3 + 2; cand if cand.prime? }
</syntaxhighlight>
{{out}}
<pre>[3, 29, 127, 24391, 91127, 250049, 274627, 328511, 357913, 571789, 1157627, 1442899, 1860869, 2146691, 2924209, 3581579, 5000213, 5177719, 6751271]</pre>
 
=={{header|Rust}}==
<langsyntaxhighlight lang="rust">// 202100327 Rust programming solution
 
use primes::is_prime;
Line 1,329 ⟶ 1,697:
 
println!("Found {} such prime numbers where {} < n < {}.", count,begin,end);
}</langsyntaxhighlight>
{{out}}
<pre>
Line 1,358 ⟶ 1,726:
=={{header|Seed7}}==
Credit for <code>isPrime</code> function: [http://seed7.sourceforge.net/algorith/math.htm#isPrime]
<langsyntaxhighlight lang="seed7">$ include "seed7_05.s7i";
 
const func boolean: isPrime (in integer: number) is func
Line 1,392 ⟶ 1,760:
end if;
end for;
end func;</langsyntaxhighlight>
{{out}}
<pre>
Line 1,419 ⟶ 1,787:
 
=={{header|Sidef}}==
<langsyntaxhighlight lang="ruby">1..^200 -> map { _**3 + 2 }.grep {.is_prime}.say</langsyntaxhighlight>
{{out}}
<pre>
Line 1,426 ⟶ 1,794:
 
=={{header|Swift}}==
<langsyntaxhighlight lang="swift">import Foundation
 
func isPrime(_ n: Int) -> Bool {
Line 1,457 ⟶ 1,825:
print(String(format: "%3d%9d", n, p))
}
}</langsyntaxhighlight>
 
{{out}}
Line 1,484 ⟶ 1,852:
=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-traititerate}}
{{libheader|Wren-fmt}}
If ''n'' is even then ''n³ + 2'' is also even, so we only need to examine odd values of ''n'' here.
<langsyntaxhighlight ecmascriptlang="wren">import "./math" for Int
import "./traititerate" for Stepped
import "./fmt" for Fmt
 
var limit = 200
Line 1,495 ⟶ 1,863:
var p = n*n*n + 2
if (Int.isPrime(p)) Fmt.print("n = $3d => n³ + 2 = $,9d", n, p)
}</langsyntaxhighlight>
 
{{out}}
Line 1,521 ⟶ 1,889:
 
=={{header|XPL0}}==
<langsyntaxhighlight XPL0lang="xpl0">func IsPrime(N); \Return 'true' if N is a prime number
int N, I;
[if N <= 1 then return false;
Line 1,538 ⟶ 1,906:
]
];
]</langsyntaxhighlight>
 
{{out}}
Chkas
1,978

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/309369...363715"