같이 보이 좋은 정수론.
이 부분이 싫어 대충했다.
1의 보수는 특히 싫었다. 0이 +0과 -0이 구분되기 때문이다.
One‘s complement representations of integers are used to simplify computer arithmetic. Torepresent positive and negative integers with absolute value less than 2ⁿ, a total of n + 1 bitsis used.
The leftmost bit is used to represent the sign. A 0 in this position is used for positive integers,
and a 1 in this position is used for negative integers.
For positive integers, the remaining bits are identical to the binary expansion of the integer.
For negative integers, the remaining bits are obtained by first finding the binary expansion of theabsolute value of the integer, and then taking the complement of each of these bits, where thecomplement of a 1 is a 0 and the complement of a 0 is a 1. - P51
Two‘s complement representations of integers also are used to simplify computer arithmetic (infact, they are used much more commonly than one‘s complement representations). To representan integer x with -2ⁿ-1 ≤x≤2^(n-1)-1, n bits are used. - P51
|