/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 vote254 views1 answer
Flask buildspec.yml
Python Flask
0 vote175 views1 answer
Substring in a django template?
Python
0 vote159 views1 answer
Python urlparse get domain
Python
0 vote165 views1 answer
Triu function in numpy
Python
0 vote159 views1 answer
TypeError: add() got an unexpected keyword argument 'kernel_regularizer'
Python
0 vote164 views1 answer
How to implement nfa in python
Python
-1 vote184 views1 answer
ValueError: cannot reshape array of size 98292 into shape (16382,1,28) site:stackoverflow.com
Python
0 vote165 views1 answer
Python print not working
Python
2 votes167 views1 answer
Not scientific notation python
Python
0 vote162 views1 answer
Matplotlib convert color string to int
Python