Question

A Prime Number is an integer which is greater than one, and whose only factors are 1 and itself. Numbers that have more than two factors are composite numbers. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23 and 29. The number 1 is not a prime number.

Write a well-documented, Python program - the main program, that accepts both a lower and upper integer from user entries. Construct a function, isPrime(n), that takes an integer (n) and returns a Boolean value of True if the number is indeed prime. If not, your function should return False. Inside your main program, with isPrime, use a for loop and a counter to increment every time a prime number is found between the lower and upper limits. Also, store that prime number onto a list, myPrimeList. One way to do this is to initialize the list, myPrimeList with the construct myPrimeList =[] before the loop. Inside the for loop, append the number to the list if it is prime.

Answer 1

"Code.py: def is Prime(number): for x in range(2,number): if number%x == 0: return False return True def main(): low = eval(input(""Enter lower limit: "")) high = eval(input(""Enter upper limit: "")) i = low myPrimeList = [] while(i < = high): if(isPrime(i)): myPrimeList.append(i) i += 1 print(myPrimeList) main() Output: Enter lower limit: 5 Enter upper limit: 100 [5, 7, 11, 13, 17, 19, 23, 29,31, 37,41, 43,47, 53,59, 61, 67,71, 73, 79, 83, 89, 97] Process finished with exit code 0"

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

def main():
    low = eval(input("Enter lower limit: "))
    high = eval(input("Enter upper limit: "))
    i = low
    myPrimeList = []
    while(i<=high):
        if(isPrime(i)):
            myPrimeList.append(i)
        i += 1
    print(myPrimeList)

main()

$\color{red}\underline{Output:}$