Use back substitution from division algorithm to write GCD of 292 and 76 as linear combination

The greatest common divisor of 292 and 76 gets "passed along" to each successive step in the division algorithm. The last non-zero remainder of 4 is the GCD. Sebastian Pauli of UNC Greensboro wrote lucid math document detailing what is a special case of Bezout's Identity. Clearly utilizing Universal and Existential quantifiers(Cuantificatorii existențial și universal), ‪@wishizuk‬ also used the well ordering principle to prove this fundamental and prevalent theorem.Mathematics professor Dr. Trefor Bazett produces excellent didactic content on the tricky business of negating these greek letter quantifiers. See July 2021 Kyle Broder interview for insight into fascinating field of differential geometry.