+123 Let 
be a fraction, where 
and 
are positive integers. Consider the operation defined by replacing by 
and then writing the result in lowest terms. For example, applying this operation to 
would give 
How many times must this operation be repeatedly applied to 
before we obtain 
How many ordered pairs of positive integers (M,N) satisfy GCD(M, N)=3 and LCM(M, N)=108
