Skip to content

Instantly share code, notes, and snippets.

@klen
Created March 26, 2014 15:35
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 klen/9786162 to your computer and use it in GitHub Desktop.
Save klen/9786162 to your computer and use it in GitHub Desktop.
""" Project Euler problem #5. """
from fractions import gcd
def problem():
""" Solve the problem.
2520 is the smallest number that can be divided by each of the numbers
from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of
the numbers from 1 to 20?
Answer: 232792560
"""
def _lowest_common_multi(a, b):
return a * b // gcd(a, b)
return reduce(_lowest_common_multi, range(1, 21))
if __name__ == '__main__':
print problem()
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment