## Extended Euclid Algorithm

Articles, Blog 0 Commentsok so ah we have seen the multiplicative inverse modulo ah n or modulo some integer m so now we will talk talk about how to find the that inverse a so suppose with like n b a prime i know n be an integer then we have seen the ah an a a is