Modular Arithmetic: Multiplicative inverse
9039
What is the best way to solve modular arithmetic equations such as $9x \equiv 33 \pmod{43}$?
20161
Prove that the multiplicative inverse of $a$ modulo $m$ exists if and only if $a$ and $m$ are coprime.
45014
Modular exponentiation by repeated squaring
30045
Solving linear congruences by hand: modular fractions and inverses
46110
how many 2x2 matrices are invertible in mod p
122519
Multiplicative Functions
126025
Computing the inverse of a permutation
145481
Extended Euclidean Algorithm for Modular Inverse
57846
Multiplicative inverse in $\operatorname{GF}(2^8)$?
17584
Integer matrices with integer inverses
147982
Exercise 1.10 from Silverman "The Arithmetic of Elliptic Curves "
80754
A slight modification in Chinese Remainder Theorem
127764
Showing that $\mathbb{Q}[\sqrt{2}, \sqrt{3}]$ contains multiplicative inverses
47148
Complete balanced (signed) residue System of an odd modulo m
52530
There exists a prime congruent to $m$ mod $p$
45882
Solving a congruence without Fermat's little theorem
2904
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation