diff options
| author | mjfernez <mjfernez@gmail.com> | 2020-02-09 15:16:26 -0500 |
|---|---|---|
| committer | mjfernez <mjfernez@gmail.com> | 2020-02-09 15:16:26 -0500 |
| commit | 93ea7fe5957b62f18e8fbd17a21696bd7de6332d (patch) | |
| tree | d90aed60d687bcf195f1150777f37cbe8a149814 /03-Largest-Prime-Factor/largestprime.py | |
| parent | 125ec5bc3d8bfc224b7d32bcfbbc37b9fb5d441f (diff) | |
| download | Project_Euler_Solutions-93ea7fe5957b62f18e8fbd17a21696bd7de6332d.tar.gz | |
Organized everything, update README
Diffstat (limited to '03-Largest-Prime-Factor/largestprime.py')
| -rw-r--r-- | 03-Largest-Prime-Factor/largestprime.py | 16 |
1 files changed, 16 insertions, 0 deletions
diff --git a/03-Largest-Prime-Factor/largestprime.py b/03-Largest-Prime-Factor/largestprime.py new file mode 100644 index 0000000..387de01 --- /dev/null +++ b/03-Largest-Prime-Factor/largestprime.py @@ -0,0 +1,16 @@ +import PIL +import math +# Problem 3 Largest Prime Factor +def lpf(number): + factor = 2 + while (number > factor): + if(number % factor == 0): + number = number/factor + factor = 2 + else: + factor += 1 + return factor + + +out = lpf(600851475143) +print(out) |