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

1 vote350 views1 answer
Factorial sequence code in python with while loops
Python
0 vote253 views1 answer
NSDictionary fast access
Python
60 votes293 views6 answers
Python remove duplicates from list
Python
33 votes327 views5 answers
How to filter out all NaN values in pandas df
Python
31 votes339 views6 answers
Python strip whitespace
Python
9 votes293 views2 answers
How to delete specific char in string python
Python
0 vote325 views1 answer
Python How To Remove Commas From String
Python
3 votes325 views1 answer
Csrf token exempt django
Python Django
113 votes304 views6 answers
Conda create new env
Python
0 vote311 views1 answer
Coercion python
Python