Revision as of 20:18, 2 October 2009 edit HenningThielemann (talk \| contribs) Extended confirmed users 668 edits gcd(0,0) ← Previous edit		Revision as of 20:21, 2 October 2009 edit undo SineBot (talk \| contribs) Bots 2,564,855 edits m Signing comment by HenningThielemann - "gcd(0,0)" Next edit →
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:18, 2 October 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> == unsigned integers ==

Talk:Binary GCD algorithm: Difference between revisions