Does anyone know of a package that has implemented fast algorithms for finding multiplication inverses modulo n? E.g. 3*5 = 15 == 1 (mod 7) and hence 3 and 5 are inverses modulo 7. I looked at AbstractAlgebra and it doesn’t look like it has inverse algorithms?

Finding multiplicative inverse modulo n

xiaodai January 14, 2019, 2:29am 2

invmod is the function e.g. invmod(5,7) == 3

1 Like