Skip to content

Instantly share code, notes, and snippets.

@DavidBrower

DavidBrower/Euler1.fs

Last active March 12, 2016 13:44
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save DavidBrower/9f8e662855b29637e0eb to your computer and use it in GitHub Desktop.
Save DavidBrower/9f8e662855b29637e0eb to your computer and use it in GitHub Desktop.
Download ZIP
Sum of Multiples
Raw
Euler1.fs
//Find the sum of all the multiples of 3 or 5 below 1000.
[1..999]
|> List.filter (fun x -> x % 3 = 0 || x % 5 = 0)
|> List.sum
//Almost identical to http://theburningmonk.com/2010/09/project-euler-problem-1-solution/
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment