Professor Penn, thank you for a fantastic example using the Extended Euclidean Algorithm to write the greatest common divisor of two natural number as a linear combination of them. These mathematical tools have been with us for forever.
I thought that he did give the general solution by saying that x = 126k + 31 and y = -439k - 108 for all integers k, and then saying that those were the only solutions.
