/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

2 votes276 views2 answers
Pypi
Python
0 vote282 views1 answer
How do i get auth user model dynamically in django?
Python
0 vote264 views1 answer
Input np.array
Python
-2 votes290 views4 answers
DFS
Python
-1 vote292 views1 answer
Django custom primary key field
Python Django
3 votes275 views1 answer
Python iterate letters
Python
0 vote273 views1 answer
Return array of odd rows and even columns from array using numpy
Python
0 vote274 views1 answer
How to print a groupby object
Python
0 vote282 views1 answer
Pandas description of dataframe
Python
3 votes273 views2 answers
How to create a network scanner in python
Python