when the remainder is zero, the divisor at this stage is the hcf of given numbers. gcd formula if a and b are any number, then the greatest common divisor of a and b can be given by: gcd (a,b) = [|a.b|]/[lcm(a,b)] applications of greatest common divisor the concept of ...