/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 vote280 views1 answer
Python - Cómo comprobar si dos cuerdas son anagramas
Python
1 vote371 views1 answer
Sum values in django models
Python
8 votes320 views2 answers
Firefox selenium python
Python
0 vote292 views1 answer
Python join tuple integer to string
Python
0 vote290 views1 answer
Zeromq pub sub example python
Python
2 votes316 views2 answers
Python sentence splitter
Python
4 votes339 views2 answers
Convert array to dataframe python
Python
0 vote327 views1 answer
Dateentry python centered
Python
6 votes319 views2 answers
Django read mesage
Python Django
0 vote325 views1 answer
Rotating circular queue in python
Python