Prime Factorimzation done

4b3dd80d6e20f0a5256c96d8e77002d31c8f39d6 · Karan Goel · Jul 5, 2013 12:40

+24 · 1 file changed

Numbers/prime.py +24 −0

diff --git a/Numbers/prime.py b/Numbers/prime.py
new file mode 100644
index 0000000..f711f08
--- /dev/null
+++ b/Numbers/prime.py
@@ -0,0 +1,24 @@
+# Prime Factorization - Have the user enter a number
+# and find all Prime Factors (if there are any) and
+# display them.
+
+import math
+
+def is_a_prime(x):
+    for i in range(2, x):
+        if x % i == 0:
+            return False
+    return True
+
+# standard boilerplate
+if __name__ == '__main__':
+    n = int(raw_input('Enter the number to find prime factors of: '))
+
+    factors = []
+
+    for i in range(2, n + 1):
+        if n % i == 0:
+            if is_a_prime(i):
+                factors.append(i)
+                n /= i
+    print factors