/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

3 votes167 views2 answers
Vertical line in matplotlib
Python
0 vote146 views1 answer
Compter des valeur consecutives en python
Python
0 vote161 views1 answer
Python get file path from in os.walk
Python
23 votes158 views1 answer
Python hour from datetime
Python
0 vote158 views1 answer
Convert string ranges list python
Python
0 vote150 views1 answer
Python how to make a movement controler
Python
0 vote192 views2 answers
Generate random password django
Python Django
0 vote152 views1 answer
Ssl server python
Python
4 votes153 views1 answer
Read value from entry tkinter
Python
1 vote152 views2 answers
Javascript func
Python