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 vote180 views2 answers
How to store data in python
Python
0 vote180 views1 answer
Django snippet 800
Python
1 vote161 views1 answer
Format listto string pytthon
Python
70 votes186 views6 answers
Python alphabet
Python
2 votes197 views1 answer
Drop column
Python
0 vote199 views1 answer
Computecost pyspark
Python
2 votes195 views1 answer
No module named 'libtorrent'
Python
3 votes204 views1 answer
Pythone csv
Python
27 votes195 views5 answers
Panda python install
Python
11 votes200 views6 answers
For enumerate python
Python