/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

35 votes212 views2 answers
Download pyaudio for python 3.9
Python
51 votes186 views5 answers
Mr robot
Python
7 votes171 views3 answers
Dictionary from two columns pandas
Python
0 vote199 views1 answer
Crank nicholson scheme python
Python
1 vote254 views2 answers
N-largest and n-smallest in list in python
Python
0 vote172 views10 answers
Python open file partially
Python
0 vote179 views1 answer
Python largest common divisor
Python
0 vote191 views1 answer
Get list of all document in django-elasticsearch-dsl
Python
-1 vote182 views1 answer
Python remove \t
Python
3 votes142 views1 answer
Cannot import name 'flask' from partially initialized module 'flask' (most likely due to a circular import)
Python