/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 vote167 views1 answer
How to call a python self-defined function in VSCode Terminal
Python
42 votes173 views6 answers
Create requirements.txt python
Python
1 vote162 views1 answer
Pip uninstalled itself
Python
23 votes169 views6 answers
Python decorator
Python
22 votes135 views7 answers
Remove special characters from string python
Python
1 vote160 views1 answer
Python seconds counter
Python
0 vote158 views1 answer
Python get number of arguments of a function
Python
2 votes168 views1 answer
Interviewbit with Python questions solutions
Python
14 votes166 views1 answer
Export a dataframe to excel pandas
Python
0 vote153 views1 answer
Semicircle
Python