+0  
 
+1
183
1
avatar+545 

Given that \(m\) and \(n\) are positive integers such that \(m\equiv 6\pmod 9\) and \(n\equiv 0\pmod 9\), what is the largest integer that \(mn\) is necessarily divisible by?

 Jul 7, 2019
 #1
avatar
0

The largest such integer is 9*9 = 81.

 Nov 21, 2019

30 Online Users

avatar
avatar
avatar
avatar
avatar