Ahenket: Nieuwe pagina aangemaakt met ':''This is the documentation of Template:gcd.'' {{Intricate template}} This template calculates the '''greatest common divisor''' (...'

2013-07-18T09:08:14Z

Nieuwe pagina aangemaakt met '<noinclude>:''This is the documentation of Template:gcd.''</noinclude> {{Intricate template}} This template calculates the '''greatest common divisor''' (...'

Nieuwe pagina

<noinclude>:''This is the documentation of [[Template:gcd]].''</noinclude>

{{Intricate template}}

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==
*<nowiki>{{gcd|16|6}}</nowiki> → {{gcd|16|6}}
*<nowiki>{{gcd|544|119}}</nowiki> → {{gcd|544|119}}
*<nowiki>{{gcd|2089|3571}}</nowiki> → {{gcd|2089|3571}} (algorithm iteration limit reached)

<includeonly>
[[Category:Mathematical function templates|GCD]]
[[ja:Template:Gcd]]
</includeonly>

Sjabloon:Gcd/doc - Bewerkingsoverzicht

Ahenket: Nieuwe pagina aangemaakt met ':''This is the documentation of Template:gcd.'' {{Intricate template}} This template calculates the '''greatest common divisor''' (...'