Show that a two’s-complement number can be converted to a representation with fewer bits by removing higher-order bits. That is, given an n-bit two’s-complement number X, show that the m-bit two’s-complement number Y obtained by discarding the d leftmost bits of X represents the same number as X if and only if the discarded bits all equal the sign bit of Y.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.