Question

(Python) (15 points) Fundamental theorem of number theory states that every natural number n can be expressed as a product of prime numbers, called its prime factorization. E.g. 15 3 x 5,20 2x 2x5. You are required to write a Python function prime factors(n) which accepts a natural number as the input argument and returns a list of all the prime factors of n in ascending order. (Use 20, 666, 4020 to test your program.) 2.

Answer 1

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

def factors(n):
    result = []
    i = 2
    while (n!=1):
        while (n % i == 0 and is_prime(i)):
            result.append(i)
            n = n / i
        i += 1
    return result

def main():
    num = eval(input("Enter number: "))
    result = factors(num)
    print(result)

main()

Note: Please comment below if you have any doubts

Please up vote the solution if it helped. Thanks!