⩔ Greatest Common Divisor r←x⩔y
r is the result of the scalar application of the GCD function, .
It is defined using the Euclidean algorithm:
- if
yis divisible byx(0=x|y),risx - otherwise,
ris(x|y)⩔x.
Supports the tolerance extra argument for the comparisons.