/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 votes122 views2 answers
Reverse an array pyton
Python
1 vote125 views1 answer
Flask api with parameter
Python
0 vote128 views1 answer
List object attributes python
Python
8 votes107 views3 answers
Import turtle as t
Python
4 votes99 views1 answer
Python data structures
Python
1 vote113 views1 answer
Why do we use graphs?
Python
0 vote123 views1 answer
NotImplementedError: cannot instantiate 'PosixPath' on your system fast ai
Python
-1 vote110 views1 answer
How to print multiple integers in python in different line
Python
1 vote118 views1 answer
Frequency
Python
0 vote117 views2 answers
Python sort isdigit
Python