Inverses Modulo N

Explanations 3

• Suppose that we have the following congruence, and we want to solve for xxx: ax≡b(modn)ax \equiv b \pmod{n}ax≡b(modn) Well, let's think about what we would do if this were just …

  By Sujay Kazi, Expii Team

• Let ppp be a prime, and xxx be the inverse of aaa, which is not divisible by ppp. Find xxx in terms of aaa and ppp. Hint: Fermat's Little Theorem.

  By amaterasu

• This is generalization of the previous one. Let nnn be co-prime to aaa and xxx be the inverse of aaa modulo nnn. Express xxx as a function of terms of aaa and nnn. Hint: Euler-F…

  By amaterasu