/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

8 votes178 views6 answers
How to convert categorical data to numerical data in python
Python
-1 vote177 views1 answer
Python how to find the highest even in a list
Python
0 vote195 views1 answer
Using strip() method to remove the newline character from a string
Python
1 vote217 views1 answer
Filter with different operator in django
Python Django
0 vote238 views1 answer
Flask put request example
Python Flask
10 votes242 views3 answers
Django make migrations
Python Django
0 vote171 views1 answer
Python max function recursive
Python
0 vote189 views1 answer
Python string lower method
Python
6 votes194 views3 answers
No matching distribution found for tensorflow==2.2.0
Python
0 vote264 views1 answer
Python class tostring
Python