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 vote154 views2 answers
Flask upload file to s3
Python
6 votes180 views1 answer
Python merge two array into one
Python
0 vote139 views1 answer
Manage python environment in jupyterlab
Python
21 votes163 views6 answers
How to concatenate two lists in python
Python
0 vote156 views1 answer
Celery periodic tasks
Python
0 vote153 views1 answer
Os.system('clear')
Python
0 vote147 views1 answer
Updating many to many field in django using pk
Python
3 votes159 views1 answer
Python plot frequency of column values
Python
0 vote152 views2 answers
How do I stop Selenium from closing my browser
Python
1 vote166 views1 answer
Aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaple
Python