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
75
4
avatar+432 

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

 Jul 9, 2019
 #3
avatar+22892 
+3

Given that m and n are positive integers such that m is congruent to 6 (mod 9) and n is congruent to 0 (mod 9), 

what is the largest integer that mn is necessarily divisible by?

 

I assume,

 

\(\begin{array}{|rclcl|} \hline m &\equiv& 6 \pmod {9} & \text{or} & m=6+9u,\quad u \in \mathbb{Z} \\ n &\equiv& 0 \pmod {9} & \text{or} & n=9v,\quad v \in \mathbb{Z} \\\\ mn &=& 9v(6+9u) \\ &=& 54v + 81uv \quad &|\quad gcd(54,81)=27 \\ \hline \end{array} \)

 

If m and n are positive integers, then the largest integer that mn is necessarily divisible by is 27

 

laugh

 Jul 10, 2019

21 Online Users

avatar