+0  
 
0
63
2
avatar

Suppose \(11^5\equiv n\pmod 9\) where \(0\le n<9\)

 

What is the vaule of \(n\)?

 

 

ty in advance

 Aug 9, 2021
edited by Guest  Aug 9, 2021
 #1
avatar
-1

By Fermat's Little Theorem, $11^5 \equiv 2 \pmod{9}$.

 Aug 9, 2021
 #2
avatar+32575 
+1

 

\(11^5-floor(\frac{11^5}{9})\times9=5\)

.
 Aug 10, 2021

27 Online Users