**Kotlin Program to Find GCD of two Numbers**: The HCF or GCD of two integers is the largest integer that can exactly divide both numbers (without a remainder). This is done by using a while loop with the help of the if-else statement.

**Kotlin Program to Find GCD of two Numbers**

**Source Code **

```
fun main(args: Array<String>) {
val n1 = 81
val n2 = 153
var gcd = 1
var i = 1
while (i <= n1 && i <= n2) {
// Checks if i is factor of both integers
if (n1 % i == 0 && n2 % i == 0)
gcd = i
++i
}
println("G.C.D of $n1 and $n2 is $gcd")
}
```

**Output**