project euler problem 3 https projecteuler netproblem3 largest prime factor the prime factors of 13195 are 5 7 13 and 29 what is the largest prime factor of the number 600851475143 references https en wikipedia orgwikiprimenumberuniquefactorization returns the largest prime factor of a given number n solution13195 29 solution10 5 solution17 17 solution3 4 3 solution0 traceback most recent call last valueerror parameter n must be greater than or equal to one solution17 traceback most recent call last valueerror parameter n must be greater than or equal to one solution traceback most recent call last typeerror parameter n must be int or castable to int solutionasd traceback most recent call last typeerror parameter n must be int or castable to int returns the largest prime factor of a given number n solution 13195 29 solution 10 5 solution 17 17 solution 3 4 3 solution 0 traceback most recent call last valueerror parameter n must be greater than or equal to one solution 17 traceback most recent call last valueerror parameter n must be greater than or equal to one solution traceback most recent call last typeerror parameter n must be int or castable to int solution asd traceback most recent call last typeerror parameter n must be int or castable to int
def solution(n: int = 600851475143) -> int:
    

    try:
        n = int(n)
    except (TypeError, ValueError):
        raise TypeError("Parameter n must be int or castable to int.")
    if n <= 0:
        raise ValueError("Parameter n must be greater than or equal to one.")
    i = 2
    ans = 0
    if n == 2:
        return 2
    while n > 2:
        while n % i != 0:
            i += 1
        ans = i
        while n % i == 0:
            n = n // i
        i += 1
    return int(ans)


if __name__ == "__main__":
    print(f"{solution() = }")