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

1 vote326 views1 answer
How to use pca using scikit learn
Python
0 vote374 views1 answer
Pyplot savefig
Python
0 vote296 views1 answer
Pandas code
Python
2 votes392 views1 answer
Def multiply(a, b): a * b
Python
2 votes350 views2 answers
Conda create jupyter kernel
Python
0 vote325 views0 answer
Python
1 vote342 views1 answer
Df reanme columns
Python
0 vote357 views1 answer
Gridlayout pyqt5 python using a for loop
Python
2 votes362 views6 answers
Install nltk in python
Python
0 vote325 views1 answer
Pandas dataframe any along row
Python