/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 vote366 views1 answer
Feature importance naive bayes python
Python
14 votes329 views1 answer
Pandas cheat sheet pdf
Python
0 vote312 views1 answer
Reate the "soup." This is a beautiful soup object:
Python
0 vote340 views1 answer
How to write manual querry in drf
Python
1 vote309 views2 answers
How to find the shortest word in a list python
Python
0 vote309 views1 answer
Replace all the empty rows in the column with the value that you have identified
Python
3 votes349 views2 answers
Draw bounding box on image python opencv
Python
0 vote350 views1 answer
Tuples unpacking
Python
5 votes322 views2 answers
Convert every element in list to string python
Python
2 votes311 views1 answer
Print all keys having same value
Python