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 vote319 views1 answer
Get param function python
Python
3 votes332 views1 answer
How set dely in python
Python
0 vote325 views1 answer
NotImplementedError: cannot instantiate 'PosixPath' on your system fast ai
Python
77 votes327 views5 answers
Python remove last 4 characters from string
Python
0 vote333 views1 answer
How to change pi hostname in python file
Python
9 votes332 views1 answer
How to create a keylogger in python
Python
3 votes345 views2 answers
Django timezone india
Python Django
5 votes308 views1 answer
If statement in one-line for loop python
Python
7 votes268 views4 answers
'numpy.ndarray' object is not callable
Python
0 vote321 views1 answer
Pandas qcut
Python