/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 vote170 views1 answer
Return a new RDD containing only the elements that satisfy a predicate.
Python
3 votes227 views2 answers
For loop python start at 1
Python
0 vote186 views1 answer
CSRF verification failed. Request aborted.
Python
12 votes205 views6 answers
How to print a variable in python
Python
0 vote165 views1 answer
Pandas plot heatmap
Python
2 votes193 views1 answer
Creating a new folder in python
Python
0 vote180 views1 answer
Reading a cell from another cell in colab
Python
0 vote169 views1 answer
Dataframe plot conditional formatting
Python
2 votes171 views1 answer
How to update pandas
Python
0 vote175 views1 answer
Installing intelpython3_core using anaconda
Python