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

0 vote379 views3 answers
Run cronjob
Python
5 votes356 views1 answer
Turn pandas entries into strings
Python
-2 votes341 views3 answers
Python i++
Python
0 vote331 views1 answer
Python set remove if exists
Python
2 votes357 views1 answer
Python turtle window not responding
Python
0 vote343 views1 answer
Max deviation in pandas
Python
0 vote379 views1 answer
Weather api python
Python
0 vote362 views1 answer
Markers are not visible on line plot
Python
0 vote343 views1 answer
No python 3.10 installation was detected
Python
1 vote364 views1 answer
Python fibonacci generator
Python