Loading [MathJax]/jax/output/SVG/jax.js
 
+0  
 
0
590
1
avatar+174 

Let n be a positive integer and a, b be invertible integers modulo n such that ab1(modn). What is the remainder when ab is divided by n?

 Jul 8, 2020
 #1
avatar+9675 
0

ab1(modn)abb1b(modn)ab1(modn)

The required remainder is 1.

 Jul 8, 2020

1 Online Users