2. Calculate the maximum common divisor and least common multiple of m and n (maximum common divisor: Rotary Rolling phase Division)

2. Calculate the maximum common divisor and least common multiple of m and n (maximum common divisor: Rotary phase division ). PublicclassJiejue2 {publicstaticvoidmain (Stringargs []) {System. out. println (gongyue (8, 6); System. out. println (gongbei (8, 6);} calculate the maximum approximate number of m and n publicstaticintgon

2. Calculate the maximum common divisor and least common multiple of m and n (maximum common divisor: Rotary phase division ). Public class Jiejue2 {public static void main (String args []) {System. out. println (gongyue (8, 6); System. out. println (gongbei (8, 6);} // calculates the maximum public approx. of m and n. public static int gon

2. Calculate the maximum common divisor and least common multiple of m and n (maximum common divisor: Rotary phase division ).

Public class Jiejue2 {

Public static void main (String args []) {
System. out. println (gongyue (8, 6 ));
System. out. println (gongbei (8, 6 ));
}

// Calculate the maximum public approx. of m and n
Public static int gongyue (int m, int n ){
While (m % n! = 0 ){
Int temp = m % n;
M = n;
N = temp;
}
Return n;
}

// Obtain the minimum public multiples of m and n.
Public static int gongbei (int m, int n ){
Return m * n/gongyue (m, n );
}

}