An Interesting GCD problem from Harvard Math 21B. If you wish to see the question then visit 5.(c) qurstion in the below pdf https://sites.fas.harvard.edu/~math21b ...

Greatest common divisor GCD(a, b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are divisible by d. There are many efficient algorithms to find ...

Abstract: The problem of finding a greatest common divisor (GCD) of any two nonzero polynomials is fundamental to algebraic and symbolic computations, as well as to the decoder implementation for a ...