파이썬 최대공약수와 최소공배수

def solution(n, m):
    answer = [1, n * m]
    a = min(n, m)
    b = max(n, m)
    
    
    for i in range(a, 1 - 1, -1):
        if a % i == 0 and b % i == 0:
            answer[0] = i
            break
    
    i = 2
    while i <= a:
        if a % i == 0 and b % i == 0:
            answer[1] /= i
            a /= i
            b /= i
        else:
            i += 1
    
    
    
    
    return answer