Project Euler Problem #1 is listing all natural numbers under 1000 and summing those divisible by 3 or 5. Kind of like a maths fizz buzz.

1..999 
|> Enum.filter(fn n -> rem(n, 3) == 0 or rem(n, 5) == 0 end) 
|> Enum.sum 
|> IO.puts