Anonymous user
Sexy primes: Difference between revisions
m
→{{header|Haskell}}
Line 694:
type Quin = (Int, Int, Int, Int, Int)
groups :: Int -> Result -> Result
groups n r@(
| isPrime
| isPrime
| isPrime
| isPrime
| not (isPrime (n+6)) && not (isPrime
| otherwise
where
n1 = n - 6
n2 = n - 12
n3 = n - 18
n4 = n - 24
main :: IO ()
main = do
printf ("Number of sexy prime pairs: %d\n"
printf ("Number of sexy prime triplets: %d\n"
printf ("Number of sexy prime quadruplets: %d\n"
printf "Number of sexy prime quintuplets: %d\n Last 1 : %s\n\n" (length quins) (show $
printf "Number of unsexy primes: %d\n Last 10: %s\n\n" (length unsexy) (show $ drop (length unsexy - 10) unsexy)
where (
lastFive xs = show $ drop (length xs - 5) xs
lastFiveText = " Last 5 : %s\n\n"</lang>
|