/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 vote139 views1 answer
Numpy get count of list
Python
0 vote230 views2 answers
Create multi new column from apply pandas
Python
0 vote153 views1 answer
Pickle.load from gpu device to cpu
Python
9 votes180 views1 answer
Drop last row pandas
Python
1 vote181 views1 answer
Python append several values
Python
0 vote211 views1 answer
Export a Pandas dataframe as a table image
Python
0 vote204 views1 answer
Python look up how many rows in dataframe
Python
1 vote144 views1 answer
Create a response object python
Python
0 vote195 views1 answer
Pie chart add outline python
Python
0 vote188 views1 answer
Python check if 3 values are equal
Python