/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

1 vote209 views1 answer
Django genericforeignkey null
Python Django
0 vote148 views1 answer
Create new column pandas and order sequence
Python
10 votes153 views4 answers
Confusion matrix with labels sklearn
Python
0 vote160 views1 answer
[E053] Could not read config.cfg from C:\Users\hp\AppData\Local\Programs\Python\Python37\lib\site-packages\resume_parser\degree\model\config.cfg
Python
15 votes144 views3 answers
How to get the current year in python
Python
0 vote156 views1 answer
How to read a data file in python and build a list of files
Python
0 vote174 views1 answer
Softmax function python
Python
0 vote158 views1 answer
Python resample and interpolate
Python
4 votes145 views3 answers
List element swapping python
Python
0 vote158 views1 answer
LDB SHOP ROBOTIC TANK
Python