/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

0 vote213 views1 answer
How to slice a set in python
Python
-1 vote186 views3 answers
How to use a variable from another function python
Python
0 vote211 views1 answer
Calculate angle between 3 points python
Python
0 vote226 views1 answer
Python if index not out of range
Python
0 vote245 views1 answer
Python enum declare
Python
0 vote243 views1 answer
Scatter matrix plot
Python
-1 vote222 views1 answer
Lasso regression implementation python
Python
6 votes268 views4 answers
Django change password command line
Python Django
8 votes215 views1 answer
Pygame draw rect syntax
Python
1 vote228 views1 answer
Create a vector of zeros in r
Python