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

22 votes198 views6 answers
How to install pygame in python
Python
0 vote224 views1 answer
Flask google analytics
Python Flask
10 votes203 views1 answer
Pandas select columns where value is true
Python
0 vote215 views1 answer
How delete element from list python
Python
0 vote226 views1 answer
Python von konsoleeinlesen
Python
0 vote189 views1 answer
How to show bar loading in python in cmd
Python
0 vote200 views1 answer
R - scale data from 0 to 1
Python
0 vote213 views1 answer
Autopytoexe
Python
2 votes205 views2 answers
Python isdigit negative
Python
30 votes213 views4 answers
How to round a number in python
Python