Question

Write a program using method name Glcm(int,int) to find the Lowest Common Multiple (LCM) of two numbers by GCD (Greatest Common Divisor) of the numbers. GCD of two integers is calculated by continued division method. Divide the larger number by the smaller, the remainder then divides the previous divisor. The process is repeated till the remainder is zero. The divisor then results in the GCD.

LCM = `"product of two numbers"/("GCD")`

Answer 1

// LCM = (NUM1 * NUM2) / GCD
import java.util.*;
public class FQ7
{
void Glcm (int n1, int n2)
{ int x, gcd = 0, 1cm;
x = Math.min(n1, n2);
for (int i = 1; i <= x; i++)
{if (n1 % i == 0 && n2 % i == 0)
gcd = i; // the last divisor gives the gcd
}
lcm = (n1 * n2) / gcd;
System.out.println("LCM " + 1cm);
}

public static void main(String args[])
{FQ7 qq = new FQ7();
Scanner ob = new Scanner(System.in);
System.out.println("Enter the two numbers for which LCM is required");
qq.Glcm(ob.nextInt(),ob.nextInt());
}}