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

3 votes148 views3 answers
Text to pandas
Python
2 votes147 views2 answers
How to import somthing from another directory in pyhon
Python
1 vote147 views1 answer
Python get cpu info
Python
0 vote146 views1 answer
How to make a world wide web server python
Python
0 vote97 views1 answer
Print g
Python
2 votes142 views2 answers
Standard module
Python
1 vote134 views2 answers
Changes not showing on website server odoo
Python
0 vote148 views1 answer
How to access a file from root folder in python project
Python
0 vote113 views1 answer
Get value of variable in session django
Python Django
0 vote141 views1 answer
Accessing list inside dict python
Python