/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

3 votes268 views2 answers
How to fill a list in python
Python
-1 vote304 views1 answer
Hue seaborn
Python
0 vote338 views1 answer
Check even or odd in single line
Python
37 votes249 views4 answers
How to create miniconda environment
Python
0 vote267 views1 answer
How to access dataframe row by datetime index
Python
0 vote281 views1 answer
How to send Email verification codes to user in Firebase using Python
Python
0 vote251 views1 answer
Python create point from coordinates
Python
13 votes282 views4 answers
Pandas take first n rows
Python
0 vote272 views1 answer
Python sum 1-50
Python
0 vote264 views1 answer
Access host database django docker
Python