Greatest Common Divisor

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	`i32[]` `i32` `u32[]` `u32` `u64[]` `u64`
Other Value	The other of the two numbers for which the GCD is calculated. Default: `0`	`i32[]` `i32` `u32[]` `u32` `u64[]` `u64`

One of the two numbers for which the GCD is calculated.

Primary Input

i32[]
i32
u32[]
u32
u64[]
u64

Other Value

The other of the two numbers for which the GCD is calculated.

Default: 0

i32[]
i32
u32[]
u32
u64[]
u64

Product Details Possible Types

Result

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

The value produced by the node operation.

Primary Output

u32
u32[]
u64
u64[]
i32
i32[]