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 vote127 views2 answers
ArgumentParser(parent)
Python
0 vote130 views1 answer
Soustraire deux listes python
Python
0 vote122 views1 answer
Iso date convert in python
Python
0 vote135 views1 answer
Lose your django secret key
Python
-1 vote128 views1 answer
Gdscript iterate over dictionary
Python
0 vote115 views1 answer
NSDictionary fast access
Python
1 vote123 views1 answer
Def __init__ python not overwrite parrent class
Python
6 votes145 views3 answers
Import pandas
Python
0 vote135 views6 answers
List comprehension
Python
0 vote131 views1 answer
Codeforces 233 a solution python
Python