diff options
| author | mjfernez <mjfernez@gmail.com> | 2020-02-03 19:49:58 -0500 |
|---|---|---|
| committer | mjfernez <mjfernez@gmail.com> | 2020-02-03 19:49:58 -0500 |
| commit | e6a7399134b3dc08f9e6e9c9c74e39ac449b8538 (patch) | |
| tree | 2cd7b6ba1a10562d219028aa84aedfc49d872761 /bigfactors2.py | |
| parent | d62ba829dc3a54edc46b7deb581dd244713393f5 (diff) | |
| download | Project_Euler_Solutions-e6a7399134b3dc08f9e6e9c9c74e39ac449b8538.tar.gz | |
Fix dumb mistakes
Diffstat (limited to 'bigfactors2.py')
| -rw-r--r-- | bigfactors2.py | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/bigfactors2.py b/bigfactors2.py index 5758019..41bc13d 100644 --- a/bigfactors2.py +++ b/bigfactors2.py @@ -1,5 +1,4 @@ import PIL, math -import numpy as np #Problem 12 Highly divisible triangular number #finds the first number with over 500 factors @@ -27,5 +26,7 @@ j = 0 while(k < 500): j += i k=countfactors(j) - print str(j) + " has " + str(k) + " factors" + print(str(j) + " has " + str(k) + " factors") i += 1 + +print("Ding! Ding! {} has over 500 factors, wow!".format(j)) |