Anonymous user
Sexy primes: Difference between revisions
→{{header|Haskell}}: clarity
(→{{header|Haskell}}: optimized) |
(→{{header|Haskell}}: clarity) |
||
Line 689:
findPairs :: Int -> [Int] -> Maybe (Int, Int)
findPairs _ [] = Nothing
findPairs p (
|
|
| otherwise = findPairs p
findTriplets :: [Int] -> (Int, Int) -> Maybe (Int, Int, Int)
Line 716:
main = do
let ps = takeWhile (< 1000035) primes
let (pairs,
let triples = catMaybes $ map (findTriplets ps) pairs
let quads = catMaybes $ map (findQuadruplets ps) triples
let quins = catMaybes $ map (findQuinTuplets ps) quads
let unsexy = filter (\p -> p `notElem` asList pairs)
putStrLn ("Number of sexy prime pairs: " ++ (show $ length pairs))
| |||