Talk:Binary GCD algorithm: Difference between revisions

Content deleted Content added
GCD in hardware
a source would clearly be needed to support your contention. gcd(0,0)
Line 3:
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. [[User:HenningThielemann|HenningThielemann]] ([[User talk:HenningThielemann|talk]]) 20:22, 2 October 2009 (UTC)
 
:A quality source would be needed to confirm this. Cursory examination of the literature shows that, indeed, gcd(0,0) is typically ''not'' defined. (See, for instance, Niven, Montgomery, Zuckerman, "Introduction to the theory of numbers".) [[Special:Contributions/71.182.236.76|71.182.236.76]] ([[User talk:71.182.236.76|talk]]) 20:55, 31 October 2009 (UTC)
 
== GCD in hardware ==