/Python/Python program to find first n prime numbers

Python program to find first n prime numbers

n = int(input("Enter a number : "))
c = 2
while n!=0:
  for i in range(2,c):
    if c%i==0:
      break
  else:  
    print(c,end=" ")  
    n-=1
  c+=1

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

6 votes199 views1 answer
How to get just the filename in python
Python
31 votes212 views6 answers
Count list python
Python
0 vote208 views1 answer
Increase recursion depth google colab
Python
0 vote294 views1 answer
Load local data to django
Python Django
0 vote215 views1 answer
Django.core.exceptions.ImproperlyConfigured: Application labels aren't unique, duplicates: auth
Python
0 vote206 views1 answer
Password protected mongo server
Python
0 vote284 views1 answer
F-string print
Python
0 vote241 views1 answer
Isupper() in python
Python
1 vote200 views1 answer
How to print numbers from 1 to 20 in python
Python
0 vote238 views1 answer
Django cms api
Python Django