This is the documentation of Template:gcd.

This template calculates the greatest common divisor (gcd) of two parameters. It returns the value of gcd. Zero is returned when calculation is too complex (this implementation only allows for ten iterations of the Euclidean algorithm).


  • {{gcd|16|6}} → 2
  • {{gcd|544|119}} → 17
  • {{gcd|2089|3571}} → 0 (algorithm iteration limit reached)

Community content is available under CC-BY-SA unless otherwise noted.