/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 votes104 views4 answers
Merge multiple dataframs
Python
-1 vote96 views1 answer
Create file in a specific directory python
Python
6 votes128 views5 answers
Django logout
Python Django
14 votes107 views5 answers
Python while continue
Python
0 vote114 views1 answer
Python add 1 to 100
Python
0 vote93 views1 answer
Decimal places django template
Python
0 vote110 views1 answer
Boto3 rename file s3
Python
6 votes103 views2 answers
Count similar values in list python
Python
0 vote106 views1 answer
Last executed query in flask api
Python
0 vote110 views1 answer
Django loop through form errors
Python