diff options
| author | mjfernez <mjfernez@gmail.com> | 2020-02-04 20:17:47 -0500 |
|---|---|---|
| committer | mjfernez <mjfernez@gmail.com> | 2020-02-04 20:17:47 -0500 |
| commit | c1a037eaa8198935dd4bf5f20e8df398f5f0d910 (patch) | |
| tree | f73a20777f817e654d57178017c55eb627a60731 /sumofprimes.py | |
| parent | 6e19bf3ce11c8722e3260c0457f0389193fd9251 (diff) | |
| download | Project_Euler_Solutions-c1a037eaa8198935dd4bf5f20e8df398f5f0d910.tar.gz | |
more cleanup, more c examples
Diffstat (limited to 'sumofprimes.py')
| -rw-r--r-- | sumofprimes.py | 17 |
1 files changed, 0 insertions, 17 deletions
diff --git a/sumofprimes.py b/sumofprimes.py index e85e394..d0db224 100644 --- a/sumofprimes.py +++ b/sumofprimes.py @@ -2,23 +2,6 @@ import PIL import math # Problem 10 sum of primes -###INEFFICIENT### -# def isPrime(number): -# if (number <=1): -# return False -# for i in range(2,number): -# if(number%i==0): -# return False -# return True - -# def prime_factors(number): -#primes = [] -# for i in range(number, 2, -1): -# if(number%i==0): -# if (isPrime(i)): -# return i -# return primes - def prime_factors(number): primes = [] |