The greatest common factor of 
and 
is
gcd(m*m*n*n, m*n*n*n) =m*n*n=
what we did, was to see how many m's and how many n's, each expression have, and then pick the smallest of each letter (factor).
the reason is that the common factor, must have enough m's and n's to divide the m's and n's of both expressions
so
also
thus, n is equal to 3
Answer: A)3
is
gcd(m*m*n*n, m*n*n*n) =m*n*n=
what we did, was to see how many m's and how many n's, each expression have, and then pick the smallest of each letter (factor).
the reason is that the common factor, must have enough m's and n's to divide the m's and n's of both expressions
so
also
thus, n is equal to 3
Answer: A)3
