How are Bezout’s Theorem and Inverse related? – Number Theory by Ashani Dasgupta The inverse of a number (modulo some specific integer) is inherently related to GCD (Greatest Common Divisor). Euclidean Algorithm and Bezout’s Theorem forms the bridge between these ideas. We explore them in a very lucid manner. Related Leave a Reply Cancel reply This site uses Akismet to reduce spam. Learn how your comment data is processed.