/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

2 votes148 views1 answer
Matplotlib bar label
Python
0 vote143 views1 answer
Inject dynamic value into string python
Python
0 vote152 views1 answer
Not want to assign all values of a collection of values in python
Python
0 vote165 views1 answer
Poision in chinese
Python
2 votes138 views3 answers
How to reboot a python script
Python
1 vote193 views1 answer
How to pass data between views django
Python
0 vote146 views1 answer
Python exec script
Python
1 vote156 views1 answer
Downgrade python version windows
Python
16 votes148 views2 answers
How to fillna in all columns with their mean values
Python
4 votes153 views2 answers
Replace nan using fillna
Python