Revision as of 17:03, 23 October 2008 edit Balabiot (talk \| contribs) Extended confirmed users 909 edits →Implementation in assembly ← Previous edit		Revision as of 20:18, 2 October 2009 edit undo HenningThielemann (talk \| contribs) Extended confirmed users 668 edits gcd(0,0) Next edit →
Line 1: == gcd(0,0) == 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. == unsigned integers ==

Talk:Binary GCD algorithm: Difference between revisions