/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

33 votes315 views6 answers
Chocolatey install
Python
0 vote285 views1 answer
Tkinter delete toplevel
Python
-1 vote327 views1 answer
Python convert integer to signed base 2 complement
Python
0 vote322 views1 answer
Medium how to interact with jupyter
Python
0 vote310 views1 answer
Dir template
Python
0 vote312 views1 answer
Operation that returns True if all values are equal
Python
2 votes316 views2 answers
Likeliness python
Python
2 votes338 views1 answer
Python open url in incognito
Python
58 votes333 views6 answers
Python Remove a character from a string
Python
0 vote298 views1 answer
Functional conflict definition
Python