/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 vote137 views1 answer
Check is string is nan python
Python
0 vote107 views1 answer
FunÃ§Ã£o anonima python
Python
0 vote131 views1 answer
Jinja flask
Python Flask
8 votes154 views2 answers
How to launch an application using python
Python
45 votes141 views6 answers
'type' object is not subscriptable
Python
32 votes129 views4 answers
Python logging level
Python
1 vote136 views1 answer
Count no of time element present in a string
Python
19 votes112 views2 answers
Install selenium python
Python
1 vote195 views2 answers
How to access cookies in django
Python Django
0 vote135 views1 answer
Fetch last record from django model
Python