# Java program to calculate the Lowest Common Multiple of two numbers using recursion

Given two numbers, we have to calculate the Lowest Common Multiple of them using the recursion.
Submitted by Nidhi, on June 02, 2022

Problem Solution:

In this program, we will read two integer numbers from the user and then we will calculate the Lowest Common Multiple of given numbers using recursion.

Program/Source Code:

The source code to calculate the Lowest Common Multiple of two numbers using recursion is given below. The given program is compiled and executed successfully.

```// Java program to calculate the Lowest Common Multiple of
// two numbers using the recursion

import java.util.*;

public class Main {
static int res = 1;
public static int calculateLCM(int num1, int num2) {
if (res % num1 == 0 && res % num2 == 0)
return res;

res++;
calculateLCM(num1, num2);

return res;
}

public static void main(String[] args) {
Scanner X = new Scanner(System.in);

int num1 = 0;
int num2 = 0;
int res = 0;

System.out.printf("Enter number1: ");
num1 = X.nextInt();

System.out.printf("Enter number2: ");
num2 = X.nextInt();

res = calculateLCM(num1, num2);
System.out.printf("LCM is: " + res);
}
}
```

Output:

```Enter number1: 4
Enter number2: 3
LCM is: 12
```

Explanation:

In the above program, we imported the "java.util.*" package to use the Scanner class. Here, we created a public class Main. The Main class contains two static methods calculateLCM(), and main(). The calculateLCM() is a recursive method that finds the LCM of two numbers and returns the result to the calling method.

The main() method is the entry point for the program. Here, we read two integer numbers from the user and called the calculateLCM() method to calculate the Lowest Common Multiple of input numbers and printed the result.