python_basics/fraction.py
def gcd(self, m, n):
        """
        GCD (Greatest common divisor) of m or n is if n divides m evenly
        if it does not divide evenly then,
        Greatest of common divisor of n and remainder of m divided by n
        """
        while m % n != 0:
            old_m, old_n = m, n
            m, n = old_n, old_m % old_n
        return n

        GCD (Greatest common divisor) of m or n is if n divides m evenly
        if it does not divide evenly then,
        Greatest of common divisor of n and remainder of m divided by n
        
GCD (Greatest common divisor) of m or n is if n divides m evenly
if it does not divide evenly then,
Greatest of common divisor of n and remainder of m divided by n
GCD ( Greatest common divisor ) of m or n is if n divides m evenly if it does not divide evenly then Greatest of common divisor of n and remainder of m divided by n
def gcd(self, m, n):
        while m % n != 0:
            old_m, old_n = m, n
            m, n = old_n, old_m % old_n
        return n
def gcd ( self , m , n ) : while m % n != 0 : old_m , old_n = m , n m , n = old_n , old_m % old_n return n
GCD (Greatest common divisor) of m or n is if n divides m evenly
if it does not divide evenly then,
Greatest of common divisor of n and remainder of m divided by n
GCD ( Greatest common divisor ) of m or n is if n divides m evenly if it does not divide evenly then Greatest of common divisor of n and remainder of m divided by n
"""
        GCD (Greatest common divisor) of m or n is if n divides m evenly
        if it does not divide evenly then,
        Greatest of common divisor of n and remainder of m divided by n
        """
self
m
n