Anonymous user
Sexy primes: Difference between revisions
m
→{{header|Haskell}}: cleaup. Unused import.
m (→{{header|Haskell}}: improved performance after reviewing strategies used by other languages.) |
m (→{{header|Haskell}}: cleaup. Unused import.) |
||
Line 684:
Uses Library primes. https://hackage.haskell.org/package/primes (wheel sieve).
<lang haskell>
import Text.Printf
import Data.Numbers.Primes
Line 742 ⟶ 740:
printf "Number of unsexy primes: %d\n" (totalUnSexy $ takeWhile (< 1000035) primes)
printf " Last 10 unsexy primes: %v\n\n" (show $ unsexy)
where lastFiveText = " Last 5 : %s\n\n"
totalUnSexy = length . filter (\n -> (not $ isPrime(n+6)) && (not $ isPrime(n-6)))
| |||