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

1 vote184 views1 answer
Discord bot python on reaction
Python
0 vote172 views1 answer
'NoneType' object has no attribute 'isnull'
Python
0 vote173 views1 answer
Python break out of function
Python
0 vote169 views1 answer
Escape brackets in regex python
Python
0 vote204 views1 answer
Shebnag python
Python
17 votes244 views5 answers
Find all occurrences of an element in a list python
Python
0 vote187 views1 answer
How to get all distinct substrings in a string python
Python
1 vote158 views1 answer
Django crispy forms foundation for site
Python Django
0 vote190 views1 answer
Add percentage column pandas
Python
0 vote185 views1 answer
Draw box with mouse on image in canvas tkinter
Python