Question: Let n be a positive integer. For X {0, . . . , 2^n 1}, let Y denote the integer obtained by inverting the bits

Let n be a positive integer. For X {0, . . . , 2^n 1}, let Y denote the integer obtained by inverting the bits in the n-bit, binary representation of X (note that Y {0, . . . , 2n 1}).

Show that Y + 1 -X (mod 2^n). This justifies the usual rule for computing negatives in 2s complement arithmetic.

Hint: what is X + Y ?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!