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 vote127 views1 answer
Django dump previous migrations
Python
2 votes119 views1 answer
Flask minimul app
Python
0 vote122 views1 answer
How to get all links from a google search using python
Python
6 votes110 views2 answers
Remove index in pd.read
Python
0 vote157 views1 answer
Django cms api
Python Django
0 vote130 views1 answer
Onetoone vs foreign key django
Python
1 vote200 views1 answer
Django foreign key error Cannot assign must be a instance
Python
2 votes122 views3 answers
Convert categorical data type to int in pandas
Python
0 vote122 views1 answer
Matplotlib pie chart move autotext
Python
0 vote126 views1 answer
Scaling pkl file?
Python