/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 vote270 views1 answer
Check if file already existing
Python
1 vote269 views1 answer
Rum system commands python
Python
20 votes300 views6 answers
Python append to list
Python
0 vote323 views1 answer
Subprocess.popen no output
Python
2 votes266 views1 answer
Ascii values in python of
Python
4 votes275 views1 answer
How to import reverse
Python
0 vote298 views1 answer
Plt turn legend off
Python
0 vote270 views2 answers
Eval(
Python
2 votes279 views1 answer
Qradiobutton example
Python
5 votes285 views2 answers
Read matlab file in python
Python