/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 vote339 views2 answers
Handdle close window action in pyqt5
Python
2 votes419 views2 answers
Count gabarit django
Python Django
1 vote349 views2 answers
Datetime.time to seconds
Python
0 vote323 views1 answer
Como escribir letras griegas en python
Python
1 vote366 views2 answers
Django get settings
Python
21 votes365 views6 answers
Select columns from dataframe pandas
Python
16 votes378 views2 answers
What is my python working directory
Python
1 vote390 views5 answers
Generate a list with random length and with random numbers python
Python
7 votes342 views2 answers
What does // mean in python
Python
0 vote316 views1 answer
In <lambda> tk.Button(self.frame, text = text, command= lambda:self.new_window(number, _class)).grid(padx= 5, pady= 5, sticky= N + E + W + S) File "C:\Users\CSB\Desktop\python program\triple_window.py", line 50, in new_window
Python