/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

18 votes167 views3 answers
Django-admin startproject
Python
0 vote159 views1 answer
Myshop flower notimplementederror
Python
0 vote168 views1 answer
How to copy list python
Python
0 vote160 views1 answer
Tf MaxPooling2D
Python
5 votes162 views2 answers
Python append to csv on new line
Python
0 vote148 views1 answer
Message handler python telegram bot example
Python
0 vote113 views1 answer
Label encoding multiple columns
Python
75 votes155 views2 answers
Python find item in list
Python
8 votes156 views1 answer
Python install module from script
Python
1 vote175 views1 answer
Pandas replace colomns location
Python