I was planning to learn one of the function programming language and finally settled on Haskell. Just started reading Learn You a Haskell for Great Good!, and decided to solve the problems from Project Euler.

**Problem**

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.

Here is my first solution using **haskell**

sum [ x | x <- [0..999], x `mod` 3 == 0 || x `mod` 5 == 0]

### Like this:

Like Loading...

*Related*