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 /sumofprimes.py | |
| parent | d62ba829dc3a54edc46b7deb581dd244713393f5 (diff) | |
| download | Project_Euler_Solutions-e6a7399134b3dc08f9e6e9c9c74e39ac449b8538.tar.gz | |
Fix dumb mistakes
Diffstat (limited to 'sumofprimes.py')
| -rw-r--r-- | sumofprimes.py | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/sumofprimes.py b/sumofprimes.py index 7c1646b..3799e94 100644 --- a/sumofprimes.py +++ b/sumofprimes.py @@ -1,5 +1,4 @@ import PIL, math -import numpy as np #Problem 10 sum of primes ###INEFFICIENT### @@ -25,7 +24,7 @@ def prime_factors(number): primes = [] if (number <=1): return [1] - a = np.ones(number) + a = [1] * number a[0]=0 a[1]=0#not prime for i in range(2,int(math.ceil(math.sqrt(number)))): @@ -42,4 +41,4 @@ def prime_factors(number): return primes out = prime_factors(2000000) -print str(sum(out)) +print(str(sum(out))) |