/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

4 votes202 views5 answers
Numpy add new column
Python
0 vote147 views1 answer
Python crear variables
Python
0 vote132 views1 answer
Print lowercase in python
Python
82 votes138 views4 answers
Python object to json file
Python
13 votes136 views3 answers
Python input list of ints
Python
7 votes136 views3 answers
Make exe file pycharm
Python
0 vote139 views1 answer
Reading a cell from another cell in colab
Python
-1 vote127 views1 answer
Numpy apply function to array
Python
0 vote151 views1 answer
Create python package ros 2
Python
1 vote141 views1 answer
How to convert 24 hours to 12 hours in python
Python