/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 vote124 views1 answer
- inf in python
Python
47 votes137 views4 answers
Python format float
Python
0 vote135 views2 answers
Create blog in django
Python
3 votes148 views1 answer
Python initialize multidimensional list
Python
0 vote140 views1 answer
Df select custom index
Python
0 vote133 views1 answer
List comprehension python one line
Python
0 vote126 views1 answer
InsertionSort
Python
1 vote97 views3 answers
Python pdf to excel
Python
1 vote136 views1 answer
Python dictionary if not found
Python
0 vote152 views1 answer
Poision in chinese
Python