Talk:Binary GCD algorithm: Difference between revisions

Revision as of 20:21, 2 October 2009

Revision as of 20:22, 2 October 2009

Line 2:

gcd(x,y) is the integer, that is divided by all common divisors of x and y.

Thus gcd(0,0)=0, because the common divisors of 0 and 0 are all natural numbers, and these are also divisors of 0. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:HenningThielemann|HenningThielemann]] ([[User talk:HenningThielemann|talk]] • [[Special:Contributions/HenningThielemann|contribs]]) 20:1822, 2 October 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->

== unsigned integers ==