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 votes194 views1 answer
Django load model by name
Python Django
1 vote250 views1 answer
Could not locate a bind configured on mapper mapped class class->tablename, SQL expression or this Session.
Python
1 vote167 views3 answers
How to sort values in python
Python
84 votes217 views6 answers
Python loop through list
Python
0 vote152 views1 answer
Displaying cv2.imshow on specific window position
Python
0 vote189 views2 answers
Print out python
Python
0 vote172 views1 answer
Convert 2 level nested list to one level list in python
Python
7 votes180 views6 answers
Eval()
Python
2 votes175 views2 answers
Big comments python
Python
0 vote189 views1 answer
Return more than one value python
Python