Greatest Common Divisor

This page documents the development version of Graphite at dev.graphite.art, which may differ from the current release.

The greatest common divisor (GCD) calculates the largest positive integer that divides both of the two input numbers without leaving a remainder.

Interface

Parameter Details Possible Types

Value

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: `0`	`Integer[]` `Integer`

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: 0

Integer[]
Integer

Product Details Possible Types

Result

Product	Details	Possible Types
Result	The value produced by the node operation. Primary Output	`Integer` `Integer[]`

The value produced by the node operation.

Primary Output

Integer
Integer[]