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 vote299 views2 answers
Xpath beautifulsoup
Python
0 vote241 views1 answer
2 liste to a dictionary
Python
0 vote237 views2 answers
Django swagger
Python
1 vote276 views1 answer
If none in column remove row
Python
1 vote282 views1 answer
Download from radio javan python
Python
1 vote281 views1 answer
Set the root directory when starting jupyter notebooks
Python
0 vote280 views1 answer
Date format django template filter
Python
0 vote302 views2 answers
Walrus operator in list comprehensions [Python 3.8.0]
Python
0 vote309 views1 answer
Django save object in view
Python Django
0 vote248 views1 answer
Import re #your code goes here number=input() pattern=r"(1|8|9)[0-9]+" match=re.match(pattern,number) of lane(number)==8: if(match): print("value") else: print("invalid") else print("invalid")
Python