/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

1 vote334 views1 answer
Write a Python program to read last n lines of a file
Python
0 vote338 views1 answer
Fetch python
Python
0 vote324 views1 answer
Is enumerate python lazy
Python
70 votes319 views2 answers
Run a for loop in python
Python
5 votes394 views3 answers
How to run flask in port 80
Python
2 votes317 views2 answers
How to print right angle triangle in python
Python
0 vote359 views1 answer
Current page django
Python Django
1 vote314 views1 answer
Numpy vector multiplication
Python
0 vote335 views1 answer
Two input string sum in django
Python
6 votes312 views2 answers
Pytesseract tesseract is not installed
Python