/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

1 vote348 views1 answer
Use incognito in selenium
Python
35 votes349 views6 answers
Python for in range
Python
11 votes281 views2 answers
Renpy
Python
1 vote317 views2 answers
Python get first occurrence in list
Python
0 vote334 views1 answer
Scree plot sklearn
Python
0 vote330 views1 answer
Python - retrieve unconnected node pairs
Python
0 vote342 views2 answers
Dict to bytes python
Python
5 votes315 views2 answers
How to check if text is lower in python
Python
7 votes320 views1 answer
Tkinter give button 2 commands
Python
0 vote317 views2 answers
Pywavelets tutorial
Python