Bézout’s identity (GCD Calculator)

Example run with the numbers 771 and 991 as input. The resulting gcd is 3 and the bezout identy is 24 and -31.

As my first complete Java project in the university, this tool can calutate the greatest common divisor together with the Bézout identity of the input.

Bézout’s identity – Let a and b be integers with greatest common divisor d. Then, there exist integers x and y such that ax + by = d. More generally, the integers of the form ax + by are exactly the multiples of d.


The motivation for creating this tool was the repetitive work that would have been needed for completing the university homework this was programmed for.

Be the first to comment

Leave a Reply

Your email address will not be published.