GCD as Linear Combination Finder (Extended Euclidean Algorithm)

GCD as Linear Combination Finder

This tool calculates the Greatest Common Divisor (GCD) of two numbers and expresses it as a linear combination of the form gcd = ax + by, where a and b are the input numbers, and x and y are the coefficients. Powered by the Extended Euclidean Algorithm, it's perfect for solving math problems and understanding number theory!