Template:Euclidean algorithm

The greatest common divisor (g.c.d.) of {{{1}}} and {{{2}}} is
( {{{1}}},{{{2}}} ) {{subst:subst}}Euclidean algorithm/running|{{{1}}}|{{{2}}}}}

Substituting this template produces one or more new substitution template calls, allowing recursive change of a page, see m:Help:Recursive conversion of wikitext.