Greatest Common Divisor

Introduction to Greatest Common Divisor Calculator

The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers without leaving a remainder. The GCD can be found using the Euclidean algorithm, which involves successive division and remainder operations. The formula GCD(num1, num2) represents the GCD of num1 and num2.

Parameter usage:

• num1 = first number
• num2 = second number

Example valid values:

• num1 = 48
• num2 = 18

Output:

• gcd = greatest common divisor of the two numbers

Data validation

The numbers should be greater than zero.

Summary

This calculator computes the greatest common divisor (GCD) of two given numbers, which is useful in various algorithms, such as simplifying fractions and cryptography.