/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 vote206 views1 answer
Jupyter notebook plot background dark theme
Python
33 votes188 views6 answers
Pandas dropna specific column
Python
7 votes307 views4 answers
Pandas.get_dummies
Python
69 votes237 views4 answers
Python csv dictwriter
Python
0 vote248 views1 answer
Django phone number
Python Django
0 vote201 views1 answer
Python tkinter fenstergröße
Python
0 vote248 views1 answer
Docker opencv python libGL.so.1: cannot open shared object file: No such file or directory
Python
1 vote277 views1 answer
Python replace all new lines with space
Python
0 vote202 views1 answer
How to use list compression with conditional formatting
Python
0 vote158 views1 answer
Get label text tkinter
Python