mirror of
https://github.com/correl/euler.git
synced 2024-11-30 11:09:52 +00:00
12 lines
248 B
Python
12 lines
248 B
Python
def divisible(n):
|
|
i = 0
|
|
while True:
|
|
i = i + 1
|
|
x = n * i
|
|
for ii in range(n, 0, -1):
|
|
if x % ii != 0:
|
|
break
|
|
if ii == 1:
|
|
return x
|
|
|
|
print 'Smallest number: ', divisible(20)
|