Template:Gcd
Revision as of 17:28, 3 August 2007 by imported>Ezhiki (+examples)
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 six iterations of the Euclidean algorithm).
Examples
- {{gcd|16|6}} → 2
- {{gcd|544|119}} → 17
- {{gcd|1787|853}} → 0 (algorithm iteration limit reached)