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 vote273 views1 answer
Loaves
Python
8 votes320 views6 answers
Combine to lists python
Python
0 vote331 views1 answer
Maximum count of replacements in python
Python
0 vote324 views4 answers
Come traferire file python
Python
7 votes290 views1 answer
First position dict python
Python
3 votes296 views4 answers
Drop na dataframe
Python
135 votes304 views6 answers
Replace string
Python
21 votes401 views6 answers
Python avg
Python
13 votes291 views4 answers
Discord.py how to give a user a role
Python
1 vote345 views1 answer
How to make an object set once python
Python