/Python/First n prime number finder in python

First n prime number finder in python

>>> def getprimes(x):	primes = []	# Loop through 9999 possible prime numbers	for a in range(1, 10000):		# Loop through every number it could divide by		for b in range(2, a):			# Does b divide evenly into a ?			if a % b == 0:				break		# Loop exited without breaking ? (It is prime)		else:			# Add the prime number to our list			primes.append(a)		# We have enough to stop ?		if len(primes) == x:			return primes		>>> getprimes(5)[1, 2, 3, 5, 7]>>> getprimes(7)[1, 2, 3, 5, 7, 11, 13]

-1

Source: daniweb.com

Similar codes

11 votes302 views3 answers
Rotate axis labels matplotlib
Python
0 vote289 views1 answer
Get information about dataframe
Python
1 vote275 views1 answer
How to distribute a dataset in train and test using scikit
Python
6 votes300 views4 answers
Datetime python timezone
Python
0 vote283 views1 answer
Python Ordered dict to dict
Python
0 vote300 views1 answer
Gspread send dataframe to sheet
Python
1 vote276 views1 answer
Th2=cv2.adaptiveThreshold(img, 255 ,cv2.ADAPTIVE_THRESH_MEAN_C, cv2.THRESH_BINARY, 11 # no of block size , 2 #c)
Python
0 vote282 views1 answer
Picture plot
Python
0 vote341 views1 answer
Build an ai writer web crapper
Python
0 vote356 views1 answer
Recall calculate confusion matrix .ravel()
Python