Euler_Perfects.py

Using Euler's algorithm about "Perfect Numbers" to calculate all numbers of "Perfect Numbers".
linye1111 · Jan 12, 2018 · eecd37a · eecd37a
1 parent 216da7b
commit eecd37a
Showing 1 changed file with 23 additions and 0 deletions.
diff --git a/Euler_Perfects.py b/Euler_Perfects.py
@@ -0,0 +1,23 @@
+import time
+start = time.time()
+def isprime(num):
+    if num < 2:
+        return False
+    if num == 2:
+        return True
+    for i in range(2, int(num*0.5+1)):
+        if num%i == 0:
+            return False
+    return True
+L = list()
+for i in range(10000):
+    if isprime(i):
+        L.append(i)
+print(L)
+
+for i in L:
+    j = 2**i-1
+    if isprime(j):
+        print(time.time()-start)
+        print(2**(i-1)*(j))
+    i += 1