The greatest common divisor (GCD) calculates the largest positive integer that divides both of the two input numbers without leaving a remainder.
Interface
Inputs
| Parameter | Details | Possible Types |
|---|---|---|
| Value | One of the two numbers for which the GCD is calculated. Primary Input | Integer[]Integer |
| Other Value | The other of the two numbers for which the GCD is calculated. Default: | Integer[]Integer |
Outputs
| Product | Details | Possible Types |
|---|---|---|
| Result | The value produced by the node operation. Primary Output | IntegerInteger[] |