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 vote215 views1 answer
Flask stream with data/context
Python Flask
0 vote155 views1 answer
Azure functions read only file system
Python
0 vote130 views1 answer
How to use tkinter in google colab
Python
3 votes229 views2 answers
Django change user password
Python Django
35 votes194 views2 answers
Download pyaudio for python 3.9
Python
0 vote160 views1 answer
Convert list to tree python
Python
22 votes164 views4 answers
Palindrome words python
Python
0 vote162 views1 answer
Dask dataframe csv tutorial
Python
21 votes171 views6 answers
Set to List
Python
27 votes245 views2 answers
Easy sending email python
Python