Here is my question:
Show that a two's complement number can be converted to a representation with more bits by "sign extension".
That is given an n-bit two's complement number "X".
Show that the m-bit two's complement representation of "X", where "m>n" can be obtained by appending "m - n" copies of X's sign bit to the left of the n-bit representation of X.
Thanks in advance (Hi)