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 vote195 views1 answer
Keylogger to exe
Python
0 vote186 views1 answer
Python multiclass inheritance with inputs
Python
0 vote159 views1 answer
Create button in pyqt
Python
2 votes154 views1 answer
Mongodb not in
Python
1 vote156 views1 answer
Connecting Kaggle to Google Colab
Python
3 votes155 views3 answers
Pandas date_range
Python
0 vote134 views1 answer
Finetune vision model huggingface pytorch github
Python
1 vote174 views2 answers
Python delete key if exists
Python
-1 vote154 views1 answer
Python : search file for string
Python
0 vote150 views1 answer
Raising a new style class which doesn't inherit from baseexception python
Python