Java Program to Find GCD of Two Numbers

In this tutorial, we will write a Java program to find out the GCD of two numbers.

The GCD (Greatest Common Divisor) of two numbers is the largest positive integer number that divides both the numbers without leaving any remainder. For example. GCD of 30 and 45 is 15. GCD also is known as HCF (Highest Common Factor).

Java Program to Find GCD of Two Numbers


import java.util.Scanner;

 * Java Program to Find GCD of Two Numbers
 * @author
public class JavaProgram {
    public static void main(String[] args) {

        try (Scanner scanner = new Scanner( {
            int num1, num2;
            System.out.print("Enter first number:");
            num1 = (int) scanner.nextInt();

            System.out.print("Enter second number:");
            num2 = (int) scanner.nextInt();

            // closing the scanner to avoid memory leaks
            while (num1 != num2) {
                if (num1 > num2)
                    num1 = num1 - num2;
                    num2 = num2 - num1;

            // displaying the result
            System.out.printf("GCD of given numbers is: %d", num2);
Enter first number:10
Enter second number:20
GCD of given numbers is: 10

Related Java Programs

Free Spring Boot Tutorial - 5 Hours Full Course

Watch this course on YouTube at Spring Boot Tutorial | Fee 5 Hours Full Course