Template:Gcd
Revision as of 20:31, 6 August 2007 by imported>Ezhiki (upgraded to ten iterations)
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)