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

8 votes318 views1 answer
Expand all rows pandas
Python
0 vote348 views1 answer
Add text to plot python scatter
Python
0 vote322 views4 answers
Process.join()
Python
1 vote320 views1 answer
Python ascii caesar cipher
Python
0 vote364 views1 answer
Soup findall table
Python
0 vote327 views1 answer
How to fill an array with consecutive numbers
Python
4 votes306 views1 answer
Falsy python
Python
1 vote334 views1 answer
Img read
Python
0 vote305 views2 answers
Pandas groupby aggregate quantile
Python
2 votes319 views3 answers
Convert series to datetime
Python