Question

Write a method LCM() that takes two integers as parameters and outputs the least common multiple of the two integers. That is, given two integers m and n, your method should return the smallest number k divisible by both m and n.

For example, the least common multiple of 3 and 7 is 21 since no smaller integer is divisible by both 3 and 7. However, the least common multiple of 3 and 12 is 12 – this shows that the LCM is not always the product of the two numbers!

Answer 1

public static int LCM(int m, int n) {

int lcm = 0;

int a = Math.max(m, n);

int b = Math.min(m, n);

lcm = (a*b)/gcd(a,b);

return lcm;

}

public static int gcd(int a, int b) {

if (a == 0)

return b;

return gcd(b % a, a);

}

Step-by-step explanation:

Answer 2

In C++, std::lcm() method has already defined in numeric header. You can use.

#include <numeric>

#include <iostream>

int main(int argc, char* argv[]) {

//User variables.

int x,y; std::cin>>x>>y;

//Print the result by using std::lcm method in numeric header.

std::cout << std::lcm(x,y) << std::endl;

return 0;

}