/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 vote138 views1 answer
Aws lambda Unable to import module 'lambda_function': No module named 'requests'
Python
0 vote135 views1 answer
Screen size tkinter
Python
0 vote124 views2 answers
Pandas read_csv column names
Python
-1 vote154 views1 answer
Python scatter size
Python
-1 vote129 views1 answer
Http python lib
Python
0 vote136 views1 answer
Open file in python network url
Python
0 vote139 views1 answer
Why tensorflow not working in .py file
Python
0 vote116 views1 answer
Install simple audio in python
Python
9 votes124 views1 answer
Delete object from table django
Python
0 vote137 views1 answer
Python overwrite print on same line
Python