From 93ea7fe5957b62f18e8fbd17a21696bd7de6332d Mon Sep 17 00:00:00 2001
From: mjfernez <mjfernez@gmail.com>
Date: Sun, 9 Feb 2020 15:16:26 -0500
Subject: Organized everything, update README

---
 03-Largest-Prime-Factor/largestprime    | Bin 0 -> 16648 bytes
 03-Largest-Prime-Factor/largestprime.c  |  21 +++++++++++++++++++++
 03-Largest-Prime-Factor/largestprime.py |  16 ++++++++++++++++
 3 files changed, 37 insertions(+)
 create mode 100755 03-Largest-Prime-Factor/largestprime
 create mode 100644 03-Largest-Prime-Factor/largestprime.c
 create mode 100644 03-Largest-Prime-Factor/largestprime.py

(limited to '03-Largest-Prime-Factor')

diff --git a/03-Largest-Prime-Factor/largestprime b/03-Largest-Prime-Factor/largestprime
new file mode 100755
index 0000000..c2afe6f
Binary files /dev/null and b/03-Largest-Prime-Factor/largestprime differ
diff --git a/03-Largest-Prime-Factor/largestprime.c b/03-Largest-Prime-Factor/largestprime.c
new file mode 100644
index 0000000..bf98414
--- /dev/null
+++ b/03-Largest-Prime-Factor/largestprime.c
@@ -0,0 +1,21 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+long lpf(long num){
+    long factor = 2;
+    while(num > factor){
+        if(num % factor == 0){
+            num = num / factor;
+            factor = 2;
+        }
+        else{
+            factor ++;
+        }
+    }
+    return factor;
+}
+
+int main(){
+	printf("%d\n", lpf(600851475143));
+	return 0;
+}
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)
-- 
cgit v1.2.3