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

11 votes332 views2 answers
Pandas shuffle rows
Python
2 votes340 views1 answer
Tkinter input popup
Python
0 vote284 views1 answer
How to django template character limit
Python
25 votes411 views3 answers
Global in python
Python
0 vote319 views1 answer
Possessive in python
Python
17 votes330 views6 answers
Prime number in python
Python
1 vote324 views1 answer
How to add three conditions in np.where in pandas dataframe
Python
0 vote322 views1 answer
Return all values in a list python
Python
1 vote318 views2 answers
Python file open try except error
Python
3 votes331 views2 answers
How to check if text is in upper case in python
Python