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

4 votes103 views1 answer
Python today - 1 day
Python
0 vote106 views1 answer
Install easygui
Python
0 vote130 views1 answer
Cannot cast type smallint to boolean django
Python Django
0 vote102 views1 answer
How to repeat a python file
Python
0 vote101 views1 answer
Optimize images in python using pillow
Python
13 votes66 views1 answer
Install python2.7 ubuntu
Python
5 votes102 views3 answers
ImportError: No module named flask
Python
0 vote103 views1 answer
Can paypal be hacked by email
Python
0 vote101 views1 answer
Streamlit cheatsheet
Python
10 votes101 views4 answers
How to append a dataframe to another dataframe in pandas
Python