/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 vote77 views1 answer
How to subtract up everything in a list python
Python
0 vote124 views1 answer
Reverse a list using slice operator
Python
0 vote283 views1 answer
Simple click counter in python
Python
0 vote108 views1 answer
How to return only fractional part in python
Python
0 vote175 views1 answer
Program in python to print first 10 natural number.
Python
3 votes117 views2 answers
Pandas normalize columns
Python
25 votes143 views6 answers
Python remove spaces
Python
14 votes102 views6 answers
Installing django on windows
Python
11 votes127 views6 answers
Pandas group by count
Python
0 vote133 views1 answer
Mutiple condition in dataframe
Python