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 vote225 views1 answer
Subplots whitespace
Python
1 vote266 views1 answer
If dict.values <= int
Python
0 vote272 views1 answer
Relative import package/module __init__.py
Python
1 vote239 views1 answer
Regression using python seaborn
Python
1 vote208 views1 answer
How to bind close button in tkinter
Python
6 votes291 views2 answers
Lofi hip hop radio online
Python
3 votes188 views1 answer
Colab cuda version
Python
0 vote271 views1 answer
How to create urls in django
Python
2 votes242 views1 answer
Django queryset get all distinct
Python Django
0 vote253 views1 answer
AssertRaises property
Python