/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 vote162 views1 answer
How to work with django ornm __in
Python
0 vote178 views1 answer
Django queryset group by sum
Python Django
15 votes154 views3 answers
Python get input from console
Python
20 votes142 views4 answers
How to make computer go in sleep mode using pythn
Python
0 vote140 views2 answers
Most common letter in string python
Python
1 vote152 views1 answer
Add help text in Django model forms
Python
0 vote149 views1 answer
Fibonacci series in python using for loop
Python
0 vote152 views1 answer
Padnas get list of rows
Python
0 vote156 views1 answer
Creating a web page in python
Python
0 vote159 views1 answer
Python capitilize
Python