Review: GCD Problems

gcd problems



See all gcd problems: #gcd

Bezout's identity (also called Bezout's lemma) is a theorem in the elementary theory of numbers:

let a and b be nonzero integers and let d be their greatest common divisor. Then there exist integers x
and y such that ax+by=d

In addition, the greatest common divisor d is the smallest positive integer that can be written as ax + by

every integer of the form ax + by is a multiple of the greatest common divisor d.
https://leetcode.com/problems/water-and-jug-problem/discuss/83715/Math-solution-Java-solution

See more blog_posts.

linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.