FilesExpand file tree

 master

/

sol2.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (31 loc) · 904 Bytes

 master

/

sol2.py

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (31 loc) · 904 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

"""

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(divisible with no

remainder) by all of the numbers from 1 to N?

"""

""" Euclidean GCD Algorithm """

def gcd(x, y):

return x if y == 0 else gcd(y, x % y)

""" Using the property lcm*gcd of two numbers = product of them """

def lcm(x, y):

return (x * y) // gcd(x, y)

def solution(n):

"""Returns the smallest positive number that is evenly divisible(divisible

with no remainder) by all of the numbers from 1 to n.

>>> solution(10)

2520

>>> solution(15)

360360

>>> solution(20)

232792560

>>> solution(22)

232792560

"""

g = 1

for i in range(1, n + 1):

g = lcm(g, i)

return g

if __name__ == "__main__":

print(solution(int(input().strip())))