/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

1 vote141 views1 answer
Serving static audio files with flask in react
Python Flask
6 votes97 views1 answer
Python check if number
Python
-1 vote116 views1 answer
Python - how many letters are capital in a string
Python
-3 votes125 views5 answers
Python 3.1 release date
Python
1 vote101 views1 answer
Typage in python
Python
25 votes103 views3 answers
Download youtube video in python
Python
0 vote108 views1 answer
Add dir to path python
Python
3 votes120 views2 answers
Module 'cv2' has no 'imread' member
Python
0 vote103 views1 answer
Python area calculator
Python
79 votes102 views6 answers
Python sort dictionary by value
Python