diff options
author | mjfernez <mjfernez@gmail.com> | 2020-02-03 23:04:10 -0500 |
---|---|---|
committer | mjfernez <mjfernez@gmail.com> | 2020-02-03 23:04:10 -0500 |
commit | 8e431d287c0e89041506da4c4da57e3e3d657d72 (patch) | |
tree | b6cd296fbdd75d1421fe84a82cf3eec859407dcb /smallmult.py.orig | |
parent | e6a7399134b3dc08f9e6e9c9c74e39ac449b8538 (diff) | |
download | Project_Euler_Solutions-8e431d287c0e89041506da4c4da57e3e3d657d72.tar.gz |
cleanup, added c translations for some
Diffstat (limited to 'smallmult.py.orig')
-rw-r--r-- | smallmult.py.orig | 26 |
1 files changed, 26 insertions, 0 deletions
diff --git a/smallmult.py.orig b/smallmult.py.orig new file mode 100644 index 0000000..d672ef0 --- /dev/null +++ b/smallmult.py.orig @@ -0,0 +1,26 @@ +#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 + +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))) |