Python

Search

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]

Comment

PREVIOUS	NEXT

Code Example
Python :: registration of path in urls.py for your apps for views
Python :: matlab to python
Python :: opencv python image capture
Python :: python how to create dict from dataframe based on 2 columns
Python :: python password hashing
Python :: concatenate 2 array numpy
Python :: pandas groupby apply list
Python :: set seed train test split
Python :: python extend list
Python :: python check if int
Python :: random string generate python of 2.7
Python :: wordle python
Python :: delete values with condition in numpy
Python :: check for missing values in pandas
Python :: discord.py fetch channel
Python :: multiply each element in list python
Python :: get number of rows pandas
Python :: python opencv imresize
Python :: np random seed
Python :: creating a list in python
Python :: use a dictionary to make a column of values
Python :: python ssh into server
Python :: rename columns
Python :: delete all elements in list python
Python :: pil crop image
Python :: python bitwise operators
Python :: how to use csv in python
Python :: indentation levels in programming
Python :: find size of mongodb collection python
Python :: play sound on python

Search

PYTHON

python nth prime function

ADD CONTENT