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 vote229 views1 answer
Bouon arrondi tkinter
Python
2 votes180 views2 answers
Python replace newline
Python
4 votes190 views1 answer
Python loop for i =0 i<len
Python
2 votes193 views1 answer
Python read text file into a list
Python
0 vote193 views1 answer
How to use rbind() to combine dataframes
Python
0 vote212 views2 answers
Converting pandas._libs.tslibs.timedeltas.Timedelta to days
Python
15 votes181 views3 answers
Python flask sample application
Python
0 vote332 views1 answer
How to make a var in pycode
Python
0 vote273 views1 answer
Fix the debug_mode = false django
Python Django
0 vote222 views1 answer
Set remove in python
Python