Find prime numbers of the form n*n*n+2: Difference between revisions
Content added Content deleted
m (added a "the" to the task preamble.) |
|||
Line 232: | Line 232: | ||
</pre> |
</pre> |
||
=={{header|Phix}}== |
|||
<lang Phix>function pn3p2(integer n) |
|||
integer n3p2 = power(n,3)+2 |
|||
return iff(is_prime(n3p2)?{n,n3p2}:0) |
|||
end function |
|||
sequence res = filter(apply(tagset(199,1,2),pn3p2),"!=",0) |
|||
printf(1,"Found %d primes of the form n^3+2:\n",length(res)) |
|||
papply(true,printf,{1,{"n = %3d => n^3+2 = %,9d\n"},res})</lang> |
|||
{{out}} |
|||
<pre> |
|||
Found 19 primes of the form n^3+2: |
|||
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|Raku}}== |
=={{header|Raku}}== |