I wonder if someone has made a complete list of all the different ways of calculating modular inverses besides the extended Euclidean algorithm. Most of them are a lot easier to remember and derive, too, than the extended Euclidean algorithm (which in my head is matrix reduction over a principal ideal domain like with Smith normal form).
The methods mostly boil down to the same thing but they can look and feel pretty different at the outset.
