diff options
author | mjfernez <mjfernez@gmail.com> | 2020-02-09 15:16:26 -0500 |
---|---|---|
committer | mjfernez <mjfernez@gmail.com> | 2020-02-09 15:16:26 -0500 |
commit | 93ea7fe5957b62f18e8fbd17a21696bd7de6332d (patch) | |
tree | d90aed60d687bcf195f1150777f37cbe8a149814 /smallmult.py | |
parent | 125ec5bc3d8bfc224b7d32bcfbbc37b9fb5d441f (diff) | |
download | Project_Euler_Solutions-93ea7fe5957b62f18e8fbd17a21696bd7de6332d.tar.gz |
Organized everything, update README
Diffstat (limited to 'smallmult.py')
-rw-r--r-- | smallmult.py | 29 |
1 files changed, 0 insertions, 29 deletions
diff --git a/smallmult.py b/smallmult.py deleted file mode 100644 index a8a6344..0000000 --- a/smallmult.py +++ /dev/null @@ -1,29 +0,0 @@ -# Problem 5 smallest multiple -# 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? - -import PIL -import math - - -def isDivisible(num, divisors): - divisible = True - for j in divisors: - if(num % j != 0): - divisible = False - break - return divisible - - -divs = range(1, 21) - -found = False -start = 2520 -while (not found): - start += 20 - found = isDivisible(start, divs) - -print(start) -print(str(isDivisible(start, divs))) |