Fast GCD with Euclidean


#1
    def gcd(self, A, B):
        while(B):
            A , B = B, A%B
        return A