Anonymous user
Pierpont primes: Difference between revisions
m
→{{header|Haskell}}
No edit summary |
|||
Line 941:
</pre>
=={{header|Haskell}}==
Uses arithmoi Library: https://hackage.haskell.org/package/arithmoi-0.11.0.0 for prime generation and prime testing.
<lang haskell>import Control.Monad (guard)
import Data.List (intercalate)
Line 968:
pierpoints k = do
n <- nSmooth 3
let x = case k of First ->
Second -> pred n
guard (isPrime x)
[x]
Line 1,006:
./pierpoints 0.04s user 0.01s system 20% cpu 0.215 total
</pre>
=={{header|Java}}==
<lang java>
| |||