increment 1

project_euler/Problem 07/sol1.py

@@ -0,0 +1,30 @@
+'''
+By listing the first six prime numbers:
+2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
+What is the Nth prime number?
+'''
+from __future__ import print_function
+from math import sqrt
+def isprime(n):
+    if (n==2):
+        return True
+    elif (n%2==0):
+        return False
+    else:
+        sq = int(sqrt(n))+1
+        for i in range(3,sq,2):
+            if(n%i==0):
+                return False
+    return True
+n = int(raw_input())
+i=0
+j=1
+while(i!=n and j<3):
+    j+=1
+    if (isprime(j)):
+        i+=1
+while(i!=n):
+    j+=2
+    if(isprime(j)):
+        i+=1
+print(j)

project_euler/Problem 07/sol2.py

@@ -0,0 +1,16 @@
+# By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the Nth prime number?
+def isprime(number):
+	for i in range(2,int(number**0.5)+1):
+		if number%i==0:
+			return False
+	return True
+n = int(raw_input('Enter The N\'th Prime Number You Want To Get: ')) # Ask For The N'th Prime Number Wanted
+primes = []
+num = 2
+while len(primes) < n:
+	if isprime(num):
+		primes.append(num)
+		num += 1
+	else:
+		num += 1
+print(primes[len(primes) - 1])