gcd
Calculate the Greatest Common Divisor of two integers using the Euclidean algorithm to find the largest number that divides both without remainder.
Instructions
Calculate the Greatest Common Divisor (GCD) of two integers using Euclidean algorithm. (Domain: arithmetic, Category: number_theory)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | ||
| b | Yes |