×

LCM Program in Java

LCM Program in Java

The LCM program in Java outputs the LCM of the given numbers. In Arithmetic, the lowest common multiple, least common multiple or smallest common multiple of the two numbers p and q are represented by LCM(p, q). It is a lowest positive number that is completely divisible by the numbers p and q. Since, the division of any number by zero is undefined, therefore, the definition of LCM only holds true when both the numbers p and q are not equal to zero. Let’s discuss different approaches to find LCM.

Using the Java for Loop

Filename: LCMExample.java

public class LCMExample
{             
public static void main(String argvs[])
{
               int a = 78, b = 117; // Given numbers
               int ans; // contains LCM of the given numbers
               // finding maximum between the given numbers.
               ans = ( a > b) ? a : b;
               // finding LCM
               for( ; ; )
               {
                   if(ans % a == 0 && ans % b == 0)
                   {
                       // We found our LCM.
                       // No need to check further.
                       break;
                   }
                   // Increamenting by 1.
                   ans = ans + 1;
               }
               // Displaying result
               System.out.println("The LCM of the numbers " + a + " and " + b + " is " + ans);
}
} 

Output:

The LCM of the numbers 78 and 117 is 234

Explanation: The LCM of any two numbers is always greater than or equal largest of the given numbers. Therefore, we have assigned the largest of the given two numbers in ans variable. Since, there is no condition in the for loop, it is evaluated true. In each iteration, we are incrementing the ans variable by 1 and checking whether the updated ans value is completely divisible by the given numbers or not. If it is divisible, we forcefully terminate the loop using the break statement; otherwise, the iteration continues.

Using Multiples of the Given Numbers

In this approach, we find the multiples of the given numbers and then find the smallest multiple, which is common in both the given numbers. The smallest common multiple is answer. Let’s understand it with the help of an example.

The LCM of 9 and 12 will be:

Multiples of 9: 9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, 108, 117, 126, 135, 144, 153, …

Multiples of 12: 12, 24, 36, 48, 60, 72, 84, 96, 108, 120, 132, 144, 156, 168, 180, 192, …

Common multiples are: 36, 72, 108, 144

Lowest Common Multiple is 36. Hence, LCM(9, 12) = 36.

Filename: LCMExample1.java

import java.util.List;
import java.util.ArrayList;
public class LCMExample1
{
public static void main(String argvs[])
{
               int a = 78, b = 117; // Given numbers
               int ans = 0; // contains the LCM of the given numbers
               // List for storing multiples
               List<Integer> al1 =  new ArrayList<Integer>();
               List<Integer> al2 = new ArrayList<Integer>();
               // Finding and storing multiples of the given numbers
               for(int i = 1; i <= b; i++)
               {
                               // generating multiples in increasing order
                               int multiples = i * a;  
                               al1.add(multiples); // storing in the list
               }
               for(int i = 1; i <= a; i++)
               {
                               // generating multiples in increasing order
                               int multiples = i * b;
                               al2.add(multiples); // storing in the list
               }
               // Converting the lists into Integer arrays.
               Integer[] f1 = new Integer[al1.size()];
               f1 = al1.toArray(f1);
               Integer[] f2 = new Integer[al2.size()];
               f2 = al2.toArray(f2);
               // Two pointer approach to find the lowest multiple
               for(int i = f1.length - 1, j = f2.length - 1; i >= 0 && j >= 0;)
               {
                               if((int)f1[i] == (int)f2[j])
                               {
                                              ans = f1[i]; // updating our result
                                              i--;
                                              j--;
                               }
                               else if(f1[i] > f2[j])
                               {
                                              i--;
                               }
                               else
                               {
                                              j--;
                               }
               }
               System.out.println("The LCM of the numbers " + a + " and " + b + " is " + ans);
}             
} 

Output:

The LCM of the numbers 78 and 117 is 234

Explanation: In the above approach, we are finding and storing all the multiples of the first number till the second number and vice-versa. This is because LCM(a, b) <= a*b. Then we are converting the lists into integer arrays. The first integer array contains all the multiples of the first input number, and the second integer array contains the multiples of the second input number in ascending order. Finally, using the two-pointers approach, we are finding the LCM of the given numbers. This approach is not widely used because the numbers become large and finding the multiples of a large number takes a lot of time. Also, the two-pointers approach becomes time consuming.

Using GCD of the Given Numbers

In Mathematics, the multiplication of two numbers is always equal to the product of LCM and GCD of the numbers. That is,

a * b = LCM(a, b) * GCD(a, b)

Therefore,

LCM(a, b) =

The following program implements the above-written formula to get the LCM of the given numbers.

Filename: LCMExample2.java

public class LCMExample2
{
// Method for finding GCD of two numbers
public static int findGCD(int a, int b)
{
               // Base cases
               if(a == 0)
               {
                               return b;
               }
               if(b == 0)
               {
                               return a;
               }
               // recursively finding GCD
               return findGCD(b, a % b);
}
public static void main(String argvs[])
{
               int a = 78, b = 117; // Given numbers
               int ans; // contains LCM of the given numbers
               int product = a * b; // calculating product
               int gcd = findGCD(a, b); // invoking the method findGCD() and storing the result                    
               ans = product / gcd; // calculating LCM
               // Displaying result
               System.out.println("The LCM of the numbers " + a + " and " + b + " is " + ans);
}
} 

Output:

The LCM of the numbers 78 and 117 is 234

Explanation: In the above approach, first we calculate the product of the given numbers. Then using Euler’s algorithm, we are finding GCD. Finally, we are doing the division of the product of numbers and GCD of the given numbers to get the required LCM.

Finding LCM of more than two numbers

So far, we have only discussed the LCM of the two given numbers. However, it is also possible to find the LCM of more than two numbers. The following program illustrates the same.

Filename: LCMExample3.java

public class LCMExample3
{             
//Method implementing Euclid's algorithm
public static int findGCD(int n1, int n2)
{
               // base cases
               if(n1 == 0) return n2;
               if(n2 == 0) return n1;
               // recursively finding the GCD
               return findGCD(n2, n1 % n2);
}
public static void main(String argvs[])
{
               // input array
               int arr[] = {6, 10, 16, 28, 78, 90, 112, 188, 200, 290, 310, 444};
               int size = arr.length; // Calculating size of the input array
               // ans contains the LCM of the entire array
               // Initializing ans with the first element of the input array
               int ans = arr[0];
               for(int i = 1; i < size; i++)
               {
                              int product = ans * arr[i]; // calculating product
                              // invoking method fingGCD() and storing the result
                              int gcd = findGCD(ans, arr[i]);
                              ans = product / gcd; // updating our ans
               }
               // Displaying result
               System.out.println("The LCM of the given numbers is " + ans);
}
} 

Output:

The LCM of the given numbers is 161387600

Explanation: The above approach is similar to the previous one. The only difference is instead of two numbers, we have taken multiple numbers in an array. Therefore, we have used the Java for-loop to iterate over each element of the array to calculate the LCM of the whole array.

Finding LCM of Fractions

Not only numbers, but LCM of fractions can also be found. In Mathematics, the LCM of fractions is equal to the LCM of all the numerator numbers divided by the GCD of all the numbers of denominators. That is,

LCM( ,  =

The following Java program demonstrates the same.

Filename: LCMExample3.java

public class LCMExample3
{             
//Method implementing Euclid's algorithm
public static int findGCD(int n1, int n2)
{
               // base cases
               if(n1 == 0) return n2;
               if(n2 == 0) return n1;
               // recursively finding the GCD
               return findGCD(n2, n1 % n2);
}
public static void main(String argvs[])
{
               // input arrays
               // Array for numerators
               int numerators[] = {6, 10, 16, 28, 78, 90, 112, 188, 200, 290, 310, 444};
               // Array for denominators
               int denominators[] = {8, 4, 10, 36, 98, 112, 180, 198, 222, 788, 888, 990};
               int size = numerators.length; // Calculating size of the input arrays
               // lcmOfNum contains the LCM of all the numerators
               // Initializing lcmOfNum with the first element of the numerators array
               int lcmOfNum = numerators[0];
               // gcdOfDnm contains the GCD of all the denominators
               // Initializing gcdOfDnm with the first element of the denominators array
               int gcdOfDnm = denominators[0];
               // Loop for calculating LCM of numerators and GCD of denominators
               for(int i = 1; i < size; i++)
               {
                              int product = lcmOfNum * numerators[i]; // calculating product
                              // invoking method fingGCD() and
                               // storing the result
                              int gcdOfNum = findGCD(lcmOfNum, numerators[i]);
                              lcmOfNum = product / gcdOfNum; // updating our LCM of numerators
                               // calculating GCD of all the denominators
                              gcdOfDnm = findGCD(gcdOfDnm, denominators[i]);
               }
               int ans = lcmOfNum / gcdOfDnm; // calculating the final result
               // Displaying result
               System.out.println("The LCM of the given numbers is " + ans);
}
} 

Output:

The LCM of the given fractions is 80693800

Explanation: The two input arrays contain the numerators and denominators of the fractions. numerators[0] and denominators[0] constitute the first fraction ( . numerators[1] and denominators[1] constitute the second fraction ( , and so on. In a single Java for-loop, we are calculating the LCM for the numerators and GCD for the denominators. Finally, we are dividing the calculated LCM and GCD to get our result.

Comparison of The Above Approaches

Those approaches that do not include Euclid’s algorithm to find the LCM should be avoided if given liberty. We have already discussed that Euclid’s algorithm is the best algorithm to find the GCD. Also, we can easily find LCM if we know the GCD of the given numbers. Therefore, the use of Euler’s algorithm should be encouraged to find LCM. However, it is important to know all the mentioned approaches present in the section from the interview point of view.


Related Topics

Rehashing in Java

The most crucial idea mostly in the data structure is hashing, which is utilized to change a particular key into some other value. The hash function can be used to...

7 minutes read.

Check whether a Number is a Power of 4 or Not in Java

There are many ways to figure out if an integer is a power of 4. This section will go over a variety of techniques for figuring out whether or not...

11 minutes read.

Hollow Diamond Pattern in Java

Why are patterns important? Programmers frequently create Java pattern programs to practice coding and ace interviews. Interviewers frequently test candidates' logical reasoning and implementation by asking about pattern programs. Hollow Diamond Pattern The...

7 minutes read.

Java Math copySign() Method

The copySign() method of Math class returns the first floating-point argument with the sign of the second argument. Syntax: public static float copySign(float magnitude, float sign)public static double copySign(double magnitude, double sign) Parameters: The...

1 minute read.

Why are generics used in Java

Java has a feature called generics that allows you to make a class, interface, and function accepting any (reference) type as a parameter. In other words, it is the idea...

4 minutes read.

Java Anon Proxy

The Java Anon Proxy (JAP), also known as JonDonym, is a proxy system designed to enable Web browsing with revocable (the use of or publication under a pseudonym, a false...

4 minutes read.

Java Interface Keyword

An interface is also known as the blueprint in Java. It has constants of static values and methods of abstraction. The interface is a mechanism used by Java to declare...

3 minutes read.

Zygodromes in Java

Zygodrome is a positive number created by the same digits running non-trivially. A number is called a zygodrome if identical digits constantly occur together (in pairs). The Greek word "zyg"...

4 minutes read.

Producer consumer problem in Java using Synchronised block

The producer-consumer problem in Java, commonly known as the bounded-buffer problem, is a well-known multi-process synchronization challenge where we attempt to synchronize many processes. Two processes are involved in the producer-consumer problem:...

3 minutes read.

Java Hello World

Let’s start by writing a simple program that prints “Hello World” to the output window. Write the program into any text editor or IDE (Eclipse, Netbeans, etc.) and save the file with the...

2 minutes read.

Difference between print() and println() in Java

In this tutorial, we will discuss the differences between print and println in Java language. There are mainly two methods to display the text on the console printprintln The above two methods are...

4 minutes read.

Java Comparator Interface

Java comparator interface is used in a situation when we have to sort an object which does not implement Comparable or do sorting in a different way than the Comparable....

1 minute read.

PriorityBlockingQueue Class in Java

What is the Queue? An abstract data structure like Stacks is a queue. A queue is open on both ends. Data is always pushed to one end, called enqueue, and removed...

4 minutes read.

Java vs Golang

Java Java is both a programming language and a platform. Java is a high-level, dependable, object-oriented, and secure programming language. Java was developed in 1995 by Sun Microsystems, which is now an...

4 minutes read.

Star Pattern Programs in Java

Star Pattern Programs in Java The star pattern programs in Java is the part of pattern programs in Java, which we discussed earlier. Right Triangle Star Pattern Filename: StarPatternExample.java public class StarPatternExample {              public static void...

4 minutes read.

How to Develop Programming Logic in Java?

Introduction In the world of software development, Java programming language is one of the most powerful programming languages that is used to create a wide range of applications. It includes desktop,...

18 minutes read.

Minimum Number of Taps to Open to Water a Garden in Java

Problem Statement The issue is that a gardener wants to water a (single-dimensional) garden using the fewest possible tap openings. The goal is to determine the minimum necessary taps to be...

8 minutes read.

Java String compareTo() Method

compareTo() method is used to compare the two specified Strings based on the alphabetical order(lexicographical order) of their characters.It returns positive number ,negative number or 0 Syntax: public int compareTo(String anotherString) Parameters: anotherString: the...

2 minutes read.

Java Math with Methods and Examples

Java Math class contains various methods for performing math operations like min(), max(), avg() and various trigonometric functions like sin(), cos(), tan() etc. Methods: The java.lang.Math class contains various methods for performing...

5 minutes read.

Literals in Java

In this article we acknowledge ourselves about the term literals in java, types of literals and an example to each of them. Literal Literal refers to any constant value that can be...

4 minutes read.