Euler Project: Problem 1 in Haskell

This is my solution in Haskell to the first problem:

sum [ x | x <- [1..1000], x `rem` 5 == 0 && x `rem` 3 == 0 ]

view raw euler1.hs hosted with ❤ by GitHub

I used a list comprehension.

Another way using also a lambda to create a helper:

	multiple_of n = \ x -> (x `rem` n) == 0
	sum [y | y <- [1..1000], multiple_of 3 y && multiple_of 5 y]

view raw euler1b.hs hosted with ❤ by GitHub

Bonus: Two ways to do the same in Clojure:

	(def sum (partial reduce +))
	(defn multiple-of [n]
	(fn [x] (zero? (mod x n))))
	(def multiple-of-3? (multiple-of 3))
	(def multiple-of-5? (multiple-of 5))
	(sum
	(for [x (range 1001)
	:when (and (multiple-of-3? x)
	(multiple-of-5? x))]
	x))
	(sum
	(filter #(and (multiple-of-3? %)
	(multiple-of-5? %))
	(range 1 1001)))

view raw euler1.clj hosted with ❤ by GitHub