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

68 votes244 views6 answers
Python open file
Python
0 vote258 views1 answer
Is python idle an ide
Python
0 vote260 views1 answer
Install pytorch on nvidia jetson nx
Python
0 vote245 views1 answer
Django validate_comma_separated_integer_list
Python
1 vote274 views1 answer
Pyplot bar plot colur each bar custom
Python
0 vote262 views1 answer
Telephone number word generator python
Python
1 vote234 views1 answer
Returns a new DataFrame omitting rows with null values
Python
1 vote243 views1 answer
Python tkinter listbox click event
Python
2 votes274 views3 answers
Insert row at given position in pandas dataframe
Python
6 votes217 views2 answers
Write a python program to print all unique values in a dictionary
Python