/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 vote178 views1 answer
How to read unicode in python
Python
4 votes197 views2 answers
Hpw tp install discord.py
Python
1 vote188 views1 answer
How to draw shape square in python turtle
Python
0 vote191 views1 answer
HTTP Error 403: Forbidden django account signup email
Python
0 vote206 views1 answer
Pandas df where row has na
Python
0 vote207 views1 answer
Selenium get h1 text python
Python
0 vote183 views1 answer
Django admin.py all fields
Python
0 vote195 views1 answer
Pipeline model coefficients
Python
0 vote173 views1 answer
Rest plus
Python
1 vote182 views1 answer
Python check if variable is iterable
Python