Example 1: LCM
public class LCM { int n1 = 32, n2 = 120, lcm; // maximum number between n1 and n2 is stored in lcm // Always true |
Output : The LCM of 32 and 120 is 480
We can also use GCD to find the LCM of two numbers using the following formula:
LCM = (n1 * n2) / GCD
Example 2: Calculate LCM using GCD
public class LCM { int n1 = 32, n2 = 120, gcd = 1; for(int i = 1; i <= n1 && i <= n2; ++i) int lcm = (n1 * n2) / gcd; |
Output : The LCM of 32 and 120 is 480