- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Kotlin Program to Find GCD of two Numbers

In this article, we will understand how to find the GCD of two numbers in Kotlin. Greatest Common Divisor (GCD) of two numbers is the largest number that divides both.

Below is a demonstration of the same

Suppose our input is

Value 1 : 18 Value 2 : 24

The desired output would be

GCD of the two numbers: 6

## Algorithm

**Step 1**− Start**Step 2**− Declare three integers: input1, input2 and myResult**Step 3**− Define the integer**Step 4**− Check that the number divides both (input1 and input2) numbers completely or not. If divides completely store it in a variable.**Step 5**− Display the ‘i’ value as GCD of the two numbers**Step 6**− Stop

## Example 1

In this example, we will find the GCD of two numbers in Kotlin using while loop. First, declare and set the two inputs for which we will find the GCD later

var input1 = 18 var input2 = 24

Also, set a variable for Result

var myResult = 1

Now, use the while loop and get the GCD

var i = 1 while (i <= input1 && i <= input2) { if (input1 % i == 0 && input2 % i == 0) myResult = i ++i }

Let us now see the complete example

fun main() { var input1 = 18 var input2 = 24 var myResult = 1 println("The input values are defined as $input1 and $input2") var i = 1 while (i <= input1 && i <= input2) { if (input1 % i == 0 && input2 % i == 0) myResult = i ++i } println("The result is $myResult") }

## Output

The input values are defined as 18 and 24 The result is 6

## Example 2

In this example, we will find the GCD of two numbers in Kotlin −

fun main() { val input1 = 18 val input2 = 24 println("The input values are defined as $input1 and $input2") getGCD(input1, input2) } fun getGCD(input1: Int, input2: Int){ var myResult = 1 var i = 1 while (i <= input1 && i >= input2) { if (input1 % i == 0 && input2 % i == 0) myResult = i ++i } println("The result is $myResult") }

## Output

The input values are defined as 18 and 24 The result is 6

## Example 3

In this example, we will find the GCD of two numbers in Kotlin using while loop but with an alternative way −

fun main() { var input1 = 18 var input2 = 24 println("The input values are defined as $input1 and $input2") while (input1 != input2) { if (input1 > input2) input1 -= input2 else input2 -= input1 } println("The result is $input1") }

## Output

The input values are defined as 18 and 24 The result is 6

- Related Questions & Answers
- Java Program to Find GCD of two Numbers
- Find GCD of two numbers
- Java program to find the GCD or HCF of two numbers
- Program to find GCD or HCF of two numbers in C++
- C++ Program to Find GCD of Two Numbers Using Recursive Euclid Algorithm
- Program to compute gcd of two numbers recursively in Python
- Program to find GCD of floating point numbers in C++
- C program to find GCD of numbers using recursive function
- Program to find GCD or HCF of two numbers using Middle School Procedure in C++
- C++ Program to Find the GCD and LCM of n Numbers
- C program to find GCD of numbers using non-recursive function
- C++ Program for GCD of more than two (or array) numbers?
- Python Program for GCD of more than two (or array) numbers
- GCD of more than two (or array) numbers in Python Program
- Java Program for GCD of more than two (or array) numbers
- GCD and LCM of two numbers in Java