/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

22 votes92 views2 answers
How to drop a row in pandas
Python
40 votes121 views6 answers
Send email python
Python
0 vote126 views2 answers
Java to python conversion
Python
0 vote157 views1 answer
Pandas Columns Calling using read_csv
Python
0 vote127 views1 answer
Load Data From JSON PYQT5
Python
12 votes123 views6 answers
Check for missing values in pandas
Python
1 vote126 views1 answer
Fastest way to output text file in python + Cout
Python
0 vote164 views2 answers
Generate random password django
Python Django
2 votes134 views1 answer
From Crypto.Cipher import AES ModuleNotFoundError: No module named 'Crypto'
Python
0 vote113 views1 answer
S3 pre signed url python
Python