Casper Hollingberry hollingberry
hollingberry
/ PrimeProductProblem.hs
Last active
August 29, 2015 14:04
How many integers from 1 to 10000 can be written as the product of two (not necessarily distinct) primes?
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import Data.List | |
| import Data.Numbers.Primes | |
| maxValue :: Int | |
| maxValue = 10^5 | |
| uniqOrdered :: [Int] -> [Int] | |
| uniqOrdered = map head . group . sort | |
| possiblePrimes :: [Int] |
NewerOlder