/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

70 votes262 views6 answers
Python alphabet
Python
-1 vote243 views1 answer
Heads or tails python
Python
0 vote274 views1 answer
Print elements without print function in python
Python
1 vote279 views2 answers
Dfs algorithm python
Python
0 vote266 views1 answer
View back of list in python
Python
7 votes225 views3 answers
How to update list in python
Python
0 vote301 views1 answer
Python string contains substring ignore case
Python
1 vote262 views1 answer
Pandas normalize groupby
Python
0 vote253 views1 answer
Unable to import flask pylint
Python
1 vote274 views3 answers
Management commands django
Python