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 vote236 views1 answer
Django templateview
Python Django
7 votes215 views2 answers
Dataframe slice by list of values
Python
225 votes389 views6 answers
Import random python
Python
0 vote253 views1 answer
Python log with timestamp
Python
57 votes206 views6 answers
Int to string python
Python
0 vote226 views1 answer
Run exe for python and wait until finish
Python
0 vote225 views1 answer
Python Split list into chunks using for loop
Python
0 vote212 views1 answer
Increment dic with for loop
Python
5 votes223 views1 answer
How to rezize image in python tkinter
Python
2 votes226 views1 answer
Filter by row contains pandas
Python