Find prime numbers of the form n*n*n+2: Difference between revisions
Content added Content deleted
m (→{{header|Julia}}: add brief version) |
(Realize in F#) |
||
Line 61: | Line 61: | ||
</pre> |
</pre> |
||
=={{header|F_Sharp|F#}}== |
|||
This task uses [[Extensible_prime_generator#The_functions|Extensible Prime Generator (F#)]].<br> |
|||
<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)) |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
n= 1 -> 3 |
|||
n= 3 -> 29 |
|||
n= 5 -> 127 |
|||
n= 29 -> 24391 |
|||
n= 45 -> 91127 |
|||
n= 63 -> 250049 |
|||
n= 65 -> 274627 |
|||
n= 69 -> 328511 |
|||
n= 71 -> 357913 |
|||
n= 83 -> 571789 |
|||
n=105 -> 1157627 |
|||
n=113 -> 1442899 |
|||
n=123 -> 1860869 |
|||
n=129 -> 2146691 |
|||
n=143 -> 2924209 |
|||
n=153 -> 3581579 |
|||
n=171 -> 5000213 |
|||
n=173 -> 5177719 |
|||
n=189 -> 6751271 |
|||
</pre> |
|||
=={{header|Factor}}== |
=={{header|Factor}}== |
||
Using the parity optimization from the Wren entry: |
Using the parity optimization from the Wren entry: |