/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 vote356 views1 answer
Django model make the field caseinsensitive
Python
0 vote341 views1 answer
Powershell not printing until ctrl c
Python
22 votes394 views4 answers
ModuleNotFoundError: No module named 'sklearn.cross_validation'
Python
0 vote377 views1 answer
Turn list of arrays into array
Python
0 vote361 views1 answer
Supprimer fichier pythpn
Python
2 votes371 views1 answer
Pandas find top 10 values in column
Python
1 vote367 views1 answer
Python requests force ipv4
Python
1 vote418 views1 answer
Discord.py commands.group
Python
0 vote349 views1 answer
Colorbar font size python
Python
0 vote335 views2 answers
Dropna threshold
Python