largest_prime.py
def primeFactorization(current, num):
    '''
    current: current number we are on -> integer
    num: original number -> integer
    description:
        essentially a prime factorization loop with an exit condition of two last
        "factors" being prime meaning the prime factorization would be complete
    '''
    while True:
        if isFactor(current, num): # checks if the current term is a prime factor of the current number
            num = num // current # divide the current number by the current factor to reset the prime factorization process for the next iteration
            primes.append(current) # add current factor to primes list
        else:
            current += 1 # go to next number

        if isFactor(current, current) and isFactor(num, num): # essentially if all factors are prime, we have completed the prime factorization
            primes.append(num) # add the transformed num to the primes as it is now also a prime factor of the original num
            break

    current: current number we are on -> integer
    num: original number -> integer
    description:
        essentially a prime factorization loop with an exit condition of two last
        "factors" being prime meaning the prime factorization would be complete
    
current number we are on -> integer
num: original number -> integer
description:
essentially a prime factorization loop with an exit condition of two last
"factors" being prime meaning the prime factorization would be complete
current number we are on - > integer num : original number - > integer description : essentially a prime factorization loop with an exit condition of two last " factors " being prime meaning the prime factorization would be complete
def primeFactorization(current, num):
    while True:
        if isFactor(current, num): 
            num = num // current 
            primes.append(current) 
        else:
            current += 1 
        if isFactor(current, current) and isFactor(num, num): 
            primes.append(num) 
            break
def primeFactorization ( current , num ) : while True : if isFactor ( current , num ) : num = num // current primes . append ( current ) else : current += 1 if isFactor ( current , current ) and isFactor ( num , num ) : primes . append ( num ) break
current: current number we are on -> integer
num: original number -> integer
description:
essentially a prime factorization loop with an exit condition of two last
"factors" being prime meaning the prime factorization would be complete
current : current number we are on - > integer num : original number - > integer description : essentially a prime factorization loop with an exit condition of two last " factors " being prime meaning the prime factorization would be complete
'''
    current: current number we are on -> integer
    num: original number -> integer
    description:
        essentially a prime factorization loop with an exit condition of two last
        "factors" being prime meaning the prime factorization would be complete
    ''' # checks if the current term is a prime factor of the current number # divide the current number by the current factor to reset the prime factorization process for the next iteration # add current factor to primes list # go to next number # essentially if all factors are prime, we have completed the prime factorization # add the transformed num to the primes as it is now also a prime factor of the original num
current
num