Last active
September 5, 2016 07:14
-
-
Save rayyildiz/189f45621fc45409cfbb2ac23bb279e5 to your computer and use it in GitHub Desktop.
Multiples of 3 and 5 (Project Euler Question 1)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
sum1 = sum [x| x <- [1..9], x `mod` 3 == 0 || x `mod` 5 == 0] | |
sum2 = sum [x| x <- [1..999], x `mod` 3 == 0 || x `mod` 5 == 0] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.