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 vote237 views1 answer
Msg91 python
Python
-1 vote235 views1 answer
Compute Count2(AACAAGCTGATAAACATTTAAAGAG, AAAAA). in python
Python
0 vote229 views2 answers
Def check_zip_code(text): result = re.search(r'\d{5}(?:-\d{4})?', text) return result != None
Python
29 votes314 views5 answers
Static dirs django
Python Django
0 vote237 views1 answer
Python coalesce
Python
2 votes236 views2 answers
Nth root of a number python
Python
0 vote231 views1 answer
Infix to postfix python code
Python
0 vote334 views1 answer
Flask request file push request(uploadedfile= request.file) uploadedfile.read()
Python
0 vote254 views1 answer
Fibonacci numbers in lamda python
Python
2 votes235 views1 answer
Python how to replace a certain string in text
Python