Monday, October 3, 2011

Problem of the Day 3rd Oct 2011

How many ordered pairs of positive integers (m, n) satisfy the system

\begin{align*}\gcd (m^3, n^2) & = 2^2 \cdot 3^2,\\ \text{LCM} [m^2, n^3] & = 2^4 \cdot 3^4 \cdot 5^6,\end{align*}

where \gcd(a, b) and \text{LCM}[a, b] denote the greatest common divisor and least common multiple of a and b, respectively?



(A)   0        (B) 1         (C)  2            (3) More than 2

6 comments:

  1. option (b) 1
    m = 2^2*3^2
    n = 2*3*5^2

    ReplyDelete
  2. the solution is incorrect, please try again.

    ReplyDelete
  3. answer is option C
    2 ordered pairs are possible
    is it right?

    ReplyDelete
  4. hmmm well
    m=2^2*3^2
    n=2*3

    am forgetting the 5 for now...
    see that for gcd to be 2^2*3^2 this is only possi when n^2=this value
    and 2^4,3^4 to be lcm means m^2 is this

    5 can oscillate between m or n
    hence 2 such pairs... one m=2^2*3^2*5^3 , n=2*3
    and once m=2^2*3^2 , n=2*3*5^2

    ReplyDelete