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

Content added Content deleted
m (→‎{{header|Phix}}: added personal tag)
m (Fixed output)
Line 306: Line 306:
=={{header|Fermat}}==
=={{header|Fermat}}==
<lang fermat>for n=1,199 do if Isprime(n^3+2)=1 then !!(n,n^3+2) fi od</lang>
<lang fermat>for n=1,199 do if Isprime(n^3+2)=1 then !!(n,n^3+2) fi od</lang>
{{out}}<pre>
{{out}}
<pre>
1 3
1 3
3 29
3 29
Line 337: Line 338:
end if
end if
next n</lang>
next n</lang>
{{out}}<pre>
{{out}}
<pre>
1 3
1 3
3 29
3 29
Line 488: Line 490:
=={{header|PARI/GP}}==
=={{header|PARI/GP}}==
<lang parigp>for(N=1,200,if(isprime(N^3+2),print(N," ",N^3+2)))</lang>
<lang parigp>for(N=1,200,if(isprime(N^3+2),print(N," ",N^3+2)))</lang>
{{out}}<pre>
{{out}}
<pre>
1 3
1 3
3 29
3 29
Retrieved from "https://rosettacode.org/wiki/Find_prime_numbers_of_the_form_n*n*n%2B2"