/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 vote209 views1 answer
Xtick for axvline
Python
1 vote191 views1 answer
Listas en python
Python
35 votes193 views2 answers
Convert into date python
Python
1 vote202 views1 answer
How to count stopwords in df
Python
0 vote198 views1 answer
Unreadable Notebook: jupyter
Python
0 vote220 views1 answer
Tensorflow.keras.utils.to_categorical
Python
1 vote200 views1 answer
Raatatatatatatatatatatatatatatatatatatatatatatatatatatattatana
Python
0 vote203 views1 answer
Check if string equals string in list python
Python
3 votes214 views1 answer
Python variable not in list
Python
26 votes203 views2 answers
Dictionary from two list
Python