title: How to get the modular inverse by using Extended Eucledian Algorithm?
body: <p>Given a mod b and find its inverse, then doing the extended GCD.</p>
  
  <pre><code>ax + by = gcd(a,b)
  </code></pre>
  
  <p>After I get x and y, how do I get its inverse?</p>