Content deleted Content added
signed →gcd(0,0) |
GCD in hardware |
||
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)
== GCD in hardware ==
The comparison of the Binary GCD with GCD implemented by hardware division lead me to the question, how fast GCD could be when implemented as hardware instruction. I assume it must be as fast or slow as one division. [[User:HenningThielemann|HenningThielemann]] ([[User talk:HenningThielemann|talk]]) 20:33, 2 October 2009 (UTC)
== unsigned integers ==
| |||