From aa099169baec428643bf9028940b1e7e394de8b2 Mon Sep 17 00:00:00 2001
From: xlnxeksix <43644330+xlnxeksix@users.noreply.github.com>
Date: Sat, 12 Oct 2019 23:50:05 +0300
Subject: [PATCH] Create sieve of erathones prime finder.py

created a prime list finder
---
 sieve of erathones prime finder.py | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 sieve of erathones prime finder.py

diff --git a/sieve of erathones prime finder.py b/sieve of erathones prime finder.py
new file mode 100644
index 0000000..03c9fba
--- /dev/null
+++ b/sieve of erathones prime finder.py	
@@ -0,0 +1,13 @@
+#finds primes using sieve of erathones 2 through n
+def find_prime(n):
+    num_prime = []
+    primes = [True for i in range(n)]
+    for j in range(2, int(n ** (1/2)) + 1):
+        if primes[j]:
+            for i in range(2 * j, n, j):
+                primes[i] = False
+
+    for i in range(2, n):
+        if primes[i]:
+            num_prime.append(i)
+    return num_prime