Use the Euclidean algorithm: , , , and . Back-substitution gives the Bezout identity . Multiplying by gives one solution of the linear Diophantine equation, and shifting the coefficients by multiples of reduces it to
Indeed, . More generally all solutions are , , : subtracting this particular solution gives , and the coprime integers force .

Articles by others on the same topic (0)

There are currently no matching articles.