DEV Community

loading...
Cover image for Smallest multiple - Project Euler Solution

Smallest multiple - Project Euler Solution

Deepak Raj
Skilled in Data Science, Machine Learning, Deep Learning, As Well As Web Development Knowledge. React ❤️ to encourage Author.
Updated on ・1 min read

Smallest multiple - Project Euler Solution

Topic: Smallest multiple

Problem Statement:

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?

You can find the original question here -> Project Euler

Smallest multiple - Project Euler Solution in python

from math import gcd
def lcm(a,b):
    "Calculate the lowest common multiple of two integers a and b"
    return a*b//gcd(a,b)

from functools import reduce

result = reduce(lcm, range(1,11))
print(result)
Enter fullscreen mode Exit fullscreen mode

Share Your Solutions for smallest multiple

Discussion (0)

Forem Open with the Forem app