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 :: how to find most repeated word in a string in python
Python :: python script header
Python :: Delete file in python Using the pathlib module
Python :: python for loop in one line
Python :: make dataframe index a column
Python :: dataframe choose random
Python :: pi in python math
Python :: python binary search algorithm
Python :: pandas check if value in column is in a list
Python :: how to add a cooment in python
Python :: replace transparent pixels python
Python :: finding the index of an item in a pandas df
Python :: Adding new column to existing DataFrame in Pandas by assigning a list
Python :: rename key in python dictionary
Python :: append record in csv
Python :: flask read form data
Python :: remove idx of list python
Python :: small factorial codechef solution
Python :: get table selenium python pandas
Python :: transform categorical variables python
Python :: case in python
Python :: converting binary to octal in python
Python :: barplot syntax in python
Python :: how to check whole number in python
Python :: jupyter notebook delete the output
Python :: python numpy array to list
Python :: python remove multiple characters from string
Python :: python check if string is in input
Python :: show image with opencv2
Python :: extend a class python

Search

PYTHON

python nth prime function

ADD CONTENT