diff options
author | mjfernez <mjfernez@gmail.com> | 2018-12-02 19:12:42 -0500 |
---|---|---|
committer | mjfernez <mjfernez@gmail.com> | 2018-12-02 19:12:42 -0500 |
commit | d62ba829dc3a54edc46b7deb581dd244713393f5 (patch) | |
tree | 637d985d70fff70c4dedc14a45c559747ea18b84 /smallmult.py | |
parent | c15221f10ed2ea4a55b474a57b6ee39f6b24ac85 (diff) | |
download | Project_Euler_Solutions-d62ba829dc3a54edc46b7deb581dd244713393f5.tar.gz |
add code
Diffstat (limited to 'smallmult.py')
-rw-r--r-- | smallmult.py | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/smallmult.py b/smallmult.py new file mode 100644 index 0000000..88c3dcc --- /dev/null +++ b/smallmult.py @@ -0,0 +1,27 @@ +#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, math +import numpy as np + +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)) |