/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

3 votes150 views2 answers
Initialise a 2d array python
Python
21 votes96 views5 answers
No module named cv2
Python
3 votes112 views3 answers
Pygame python3.8
Python
1 vote107 views1 answer
Python print how long it takes to run
Python
0 vote129 views1 answer
Django url patterns static
Python Django
0 vote96 views1 answer
Print pattern a shape in python
Python
10 votes93 views2 answers
TypeError: can only concatenate str (not “int”) to str
Python
0 vote101 views1 answer
How to redirect in django rest framework
Python
0 vote104 views1 answer
Python run module with and without "-m" option and import path setting
Python
-1 vote162 views2 answers
Python timestamp to yyyy-mm-dd
Python