Find prime numbers of the form n*n*n+2: Difference between revisions
Find prime numbers of the form n*n*n+2 (view source)
Revision as of 05:51, 29 March 2021
, 3 years agoadd FreeBASIC, Fermat, and Pari-GP
m (→{{header|Phix}}: added syntax colouring the hard way) |
(add FreeBASIC, Fermat, and Pari-GP) |
||
Line 237:
n = 173 => n³ + 2 = 5,177,719
n = 189 => n³ + 2 = 6,751,271
</pre>
=={{header|Fermat}}==
<lang fermat>for n=1,199 do if Isprime(n^3+2)=1 then !!(n,n^3+2) fi od</lang>
{{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|FreeBASIC}}==
Use the code from [[Primality by trial division#FreeBASIC]] as an include.
<lang freebasic>#include"isprime.bas"
for n as uinteger = 1 to 200
if isprime(n^3+2) then
print n, n^3+2
end if
next n</lang>
{{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>
Line 365 ⟶ 420:
<lang julia>using Primes; println(filter(isprime, map(x -> x^3 + 2, 1:199)))</lang>{{out}}<pre>
[3, 29, 127, 24391, 91127, 250049, 274627, 328511, 357913, 571789, 1157627, 1442899, 1860869, 2146691, 2924209, 3581579, 5000213, 5177719, 6751271]</pre>
=={{header|PARI/GP}}==
<lang parigp>for(N=1,200,if(isprime(N^3+2),print(N," ",N^3+2)))</lang>
{{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|Perl}}==
| |||