Bézout Identity

This animation demonstrates how to find the greatest common divisor (GCD) of three different number pairs using the Euclidean algorithm, visualizing the process with geometric squares and algebraic coefficients. It concludes by showing the specific linear combinations that equal the GCD for each pair, such as (3 = 3\times33 - 4\times24).