Processing math: 100%
 
+0  
 
0
428
2
avatar

Suppose 115n(mod9) where 0n<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+33660 
+1

 

115floor(1159)×9=5

.
 Aug 10, 2021

3 Online Users

avatar