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]`

Source: www.daniweb.com