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

3 votes268 views1 answer
Tf.squeeze()
Python
0 vote306 views1 answer
Python Django How To Bulk Update
Python Django
1 vote290 views1 answer
Import CSV Files into R Using read_csv() method
Python
0 vote230 views2 answers
How to remove element from nested list in python
Python
0 vote284 views1 answer
Python () vs [] vs {\
Python
0 vote263 views1 answer
Excelwriter python
Python
0 vote284 views1 answer
How to check if a cell is empty in openpyxl
Python
0 vote290 views1 answer
Web socket in python
Python
22 votes268 views6 answers
Pyinstaller windows
Python
0 vote271 views1 answer
Can I convert python code to C++?
Python