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.
Your email address will not be published. Required fields are marked *
Comment *
Name *
Email *
Website
Δ
This site uses Akismet to reduce spam. Learn how your comment data is processed.
