We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website. cookie policy and privacy policy.
 
+0  
 
+1
164
1
avatar+544 

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

15 Online Users

avatar