/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

16 votes214 views1 answer
Np.load
Python
0 vote211 views1 answer
Check if key exists in sesson python flask
Python
1 vote201 views1 answer
Selenium select element by id
Python
1 vote203 views2 answers
Access element of dataframe python
Python
1 vote205 views1 answer
Random pick any file from directory python
Python
0 vote206 views1 answer
Site:github.com python ssh
Python
1 vote208 views6 answers
Code grepper
Python
5 votes223 views3 answers
Iterating with index in for loops python
Python
0 vote197 views1 answer
Python bug
Python
23 votes254 views2 answers
Flask or django
Python Flask