/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
Pyqt create a qmenu on a button click
Python
9 votes142 views3 answers
How to detect when a key is pressed in pygame
Python
12 votes138 views3 answers
Python print on file
Python
0 vote132 views2 answers
Rename keys in dictionary python
Python
1 vote161 views1 answer
Indices of true boolean array pyton
Python
11 votes145 views6 answers
How to add to a list python
Python
0 vote127 views1 answer
Networkx node attribute from a dataframe
Python
6 votes162 views2 answers
Convert negative to positive in python
Python
3 votes176 views2 answers
Split imagedatagenerator into x_train and y_train
Python
7 votes129 views3 answers
Python open encoding utf-8
Python