init

threadfindprime.py

@@ -0,0 +1,39 @@
+from addit import timeit, processit
+
+
+@processit
+def isprime(number, primelist):
+    """
+    checks if a number is prime by finding dividing it by every other prime
+    below floor(number / 2)
+    """
+    print(primelist)
+    for prime in primelist:
+        if prime <= number // 2 and number % prime == 0:
+            return False
+
+    return True
+
+@timeit
+def findxprimes(x):
+    """
+    finds numprimes count of prime numbers
+    """
+    primelist = [2]
+    testnum = 3
+    cores = 4
+    usedcores = 0
+
+    while len(primelist) < x:
+
+        usedcores += 1
+        if isprime(testnum, primelist) and usedcores < 4:
+            primelist.append(testnum)
+            usedcores -= 1
+
+        testnum += 2
+
+    return primelist
+
+
+findxprimes(5)