Question

3. Primes primes.py We're going to solve a popular interview question! Write a function that checks whether a number is prime. Handle the case where the argument is not a positive integer. Next, write a function that returns the first N primes. Can you optimize your code? Note that any number that is not prime is always divisible by at least one prime that comes before it. Ensure your program passes the tests provided.

Answer 1

def isPrime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    return True


def nPrimes(n):
    lst = []
    i = 2
    while len(lst) < n:
        if isPrime(i):
            lst.append(i)
        i += 1
    return lst


def main():
    n = int(input("Enter a positive integer: "))
    print("First", n, "primes are")
    for num in nPrimes(n):
        print(num)


main()

Enter a positive integer: 10 First 10 primes are