/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

0 vote168 views1 answer
Python convert exponential to int
Python
1 vote222 views1 answer
Can't convert np.ndarray of type numpy.object_.
Python
0 vote162 views1 answer
How to input a full array in one input in python
Python
1 vote178 views2 answers
Fast fourier transform python
Python
-1 vote165 views1 answer
Turtle write function in turtle package python
Python
2 votes173 views1 answer
Get local timezone python
Python
0 vote172 views1 answer
Sklearn model persistence
Python
32 votes158 views4 answers
Python logging level
Python
1 vote173 views1 answer
Python months between two dates
Python
0 vote203 views3 answers
Numpy.dot
Python