Python nth prime function

def is_prime(n): 
	if n>1: 
		divs=[k for k in range(2,n) if n%k==0] 
		return len(divs)==0 
	else: 
		return False 
		 
def nth_prime(n): 
	primes=[p for p in range(n*n+2) if is_prime(p)] 
	return primes[n-1]

Source: quora.com

Similar codes

17 votes133 views2 answers
How to learn python
Python
0 vote132 views1 answer
ValueError: expected sparse matrix with integer values, found float values
Python
1 vote137 views1 answer
Pyspark take random sample
Python
0 vote156 views1 answer
Case insensitive replace python
Python
0 vote127 views2 answers
Most common letter in string python
Python
4 votes134 views2 answers
Django template for range
Python
17 votes126 views10 answers
Time
Python
1 vote126 views1 answer
How to clear a pickle file
Python
1 vote122 views1 answer
Get int value of char python
Python
-1 vote127 views2 answers
Detect grayscale image in python opencv
Python