Let a and b be integers with greatest common divisor d. Then there exist integers r and s such that d = ar + bs. Thus, the greatest common divisor of a and b is an integer linear combination of a and b.
( Didn't know that this theorem was called Bézout's Theorem. )
13-2016 Open letter to Open Source for You (OSFY)
4 months ago