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

2 votes339 views1 answer
Average within group by pandas
Python
0 vote286 views1 answer
Pandas slice of time
Python
0 vote344 views1 answer
Python access class variable by string
Python
1 vote322 views1 answer
Python program to keep your computer awake
Python
-4 votes364 views1 answer
Hello world python 2
Python
17 votes315 views2 answers
Python calculate factorial
Python
2 votes343 views3 answers
Python seaborn color map
Python
0 vote313 views1 answer
Installing python3.9 on linux mint 20
Python
0 vote404 views1 answer
Quill get content flask
Python Flask
0 vote303 views1 answer
Align columns to left pandas python
Python