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