prime.hs 243 B

12345678
  1. -- Exercice from slide 42/82
  2. dividers n = [k | k <- [2..(n-1)], rem n k == 0]
  3. dividersf n = filter (\k -> rem n k == 0) [2..(n-1)]
  4. primer n = [i | i <- [2..(n-1)], null (dividers i)]
  5. primerf n = filter (\i -> null (dividersf i)) [2..(n-1)]