Edit the isPrime function so that it returns False when any number less than 3 is passed (including negative numbers). Then write a function called nPrimes that accepts an integer parameter called n and then prints the first n prime numbers. Start looking for prime numbers at 3, and keep looking until you find n of them. Your nPrimes function should use the isPrime function to determine if a number is prime. Both of these functions should be placed in a file called NPrimes.py. Here is a sample run of the completed program: Enter the number of primes you want to find: 10 3 5 7 11 13 17 19 23 29 31
Edit the isPrime function so that it returns False when any number less than 3 is passed (including negative numbers). Then write a function called nPrimes that accepts an integer parameter called n and then prints the first n prime numbers. Start looking for prime numbers at 3, and keep looking until you find n of them. Your nPrimes function should use the isPrime function to determine if a number is prime. Both of these functions should be placed in a file called NPrimes.py.
Here is a sample run of the completed program:
Enter the number of primes you want to find: 10
3
5
7
11
13
17
19
23
29
31
from NPrimes import nPrimes
def main():
n = int(input("Enter the number of primes you want to find: \n"))
nPrimes(n)
main()
def isPrime(num):
prime = True
for x in range(2, num):
if num % x == 0:
prime = False
break
return prime;
Step by step
Solved in 2 steps with 2 images
