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