Template:Gcd/doc

This is a documentation subpage for Template:Gcd (see that page for the template itself).
It contains usage information, categories and other content that is not part of the original template page.

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).

Examples

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