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 vote114 views1 answer
Untrack local changes
Python
0 vote125 views1 answer
Python Print Variable Using the string formatting with positional arguments {}
Python
4 votes120 views6 answers
If statement python
Python
-1 vote120 views1 answer
Autopy python not installing
Python
5 votes125 views3 answers
Os system python
Python
7 votes116 views6 answers
Python function
Python
0 vote112 views1 answer
Location of matploitlibrc file
Python
0 vote118 views1 answer
Python not equal to symbol
Python
1 vote167 views1 answer
Django manager
Python Django
0 vote113 views2 answers
Discord.py read embed on message
Python