@@ -1,16 +1,9 @@ +import Primes import List import Char -isPrime a = isPrimeHelper a primes - -isPrimeHelper a (p:ps) - | p*p > a = True - | a `mod` p == 0 = False - | otherwise = isPrimeHelper a ps - -primes = 2 : filter isPrime [3..] - isPanDigital :: Integral a => a -> Bool isPanDigital n = let s = show n in sort s == map intToDigit [1..(length s)] +main = print . last . filter isPanDigital . takeWhile (<10000000) $ primes euler/euler041.hs 125f1b65d2691a411080428791560c1dffef0d37 Vineet Kumar vineet@doorstop.net http://github.com/vin/challenge/commit/17c0d3b9434ff90c5456cf148c455ac43a55ef9b 17c0d3b9434ff90c5456cf148c455ac43a55ef9b 2009-01-05T18:54:20-08:00 2009-01-05T18:54:20-08:00 use Primes module for euler041. This must have been written before I made it a reusable module. 6eaad699ebc7181d90872d70a47dc1f132ded6f4 Vineet Kumar vineet@doorstop.net