/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

25 votes291 views4 answers
Python pil
Python
1 vote342 views1 answer
Ses mail name
Python
2 votes289 views3 answers
Binary tree
Python
0 vote336 views2 answers
Python read file from same directory
Python
22 votes313 views4 answers
Python count appearances in list
Python
65 votes301 views5 answers
Convert date to datetime python
Python
0 vote341 views2 answers
Python list all youtube channel videos
Python
0 vote295 views1 answer
Name =input ("hello how are you ") if name==("good"): print ("Thats nice") else print("stfu")
Python
1 vote309 views1 answer
Dataframe drop rows by column value
Python
-1 vote295 views1 answer
How to write pretty xml to a file python
Python