Template:Gcd

From blackwiki
Revision as of 18:07, 3 August 2007 by imported>Ezhiki (balancing parens)
Jump to navigation Jump to search

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 eight iterations of the Euclidean algorithm).

Examples

  • {{gcd|16|6}} → 2
  • {{gcd|544|119}} → 17
  • {{gcd|1787|853}} → Expression error: Unclosed bracket. (algorithm iteration limit reached)