+0  
 
0
91
1
avatar+172 

Let n be a positive integer and a, b be invertible integers modulo n such that \(a\equiv b^{-1}\pmod n\). What is the remainder when ab is divided by n?

 Jul 8, 2020
 #1
avatar+8342 
0

\(a\equiv b^{-1}\pmod n\\ a\cdot b\equiv b^{-1}\cdot b \pmod n\\ ab \equiv 1 \pmod n\)

The required remainder is 1.

 Jul 8, 2020

12 Online Users

avatar