B
Brian Drummond
Guest
On 5 Dec 2005 14:21:02 -0800, juendme@yahoo.com wrote:
.... one sign bit.
And the surprise of this is ... ?
- Brian
Second, since obviously not everyone here knows enough about binary
arithmetics to understand my questions, let me illustrate on an example
of adding/subtracting 2 3-bit signed numbers:
Using 2's complement representation, we can represent the following
numbers with 3 bits:
[...]
Clearly if you add two sign bits together, you can store the result inTo store the valid result, we only need 4 bits.
However, if one of the numbers is unsigned, 4 bits are not enough. We
can illustrate that using the following example:
.... one sign bit.
And the surprise of this is ... ?
- Brian