ProtoFlux:Greatest Common Divisor

From Resonite Wiki
Revision as of 19:02, 27 May 2024 by Decoy (talk | contribs) (Add data types)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
GreatestCommonDivisor
A
*
B
Math

The Greatest Common Divisor node finds the biggest number between input A and B which can be divided by without a decimal.

The node can be int, long, uint or ulong type data.

Inputs

A (Pseudo-generic)

The first value to compare.

B (Pseudo-generic)

The second value to compare.

Outputs

* (Pseudo-generic)

Returns the result.