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 vote209 views1 answer
Scrollable table tkinter
Python
0 vote249 views1 answer
How to insert a placeholder text in django modelform
Python Django
0 vote221 views2 answers
Convert numpy array to HSV cv
Python
0 vote211 views1 answer
Change increment in for loop python
Python
13 votes221 views5 answers
Finding the maximum value in a list python
Python
0 vote216 views1 answer
Any value in list will retrun true python
Python
0 vote259 views1 answer
How to config django templates with pathlib
Python Django
0 vote237 views1 answer
Django phone number
Python
2 votes215 views1 answer
Django mysql
Python Django
9 votes214 views3 answers
Python array from 1 to n
Python