Supplemental code Retrieval

I have explained in detail about the CAPTCHA complement and microcomputer principles. Today I am here because I have forgotten some details.

For a code word represented by N-bit binary, the formula for completing the code is defined as: 2 ^ N + and then expressed in binary.

For example, consider n = 8. For positive number 15, the complement code should be: 2 ^ 8 + 15 = 00001111

For negative-15, the complement should be: 2 ^ 8-15 = 11110001

For negative-128, the complement should be: 2 ^ 8 + (-2 ^ 7) = 10000000. This cannot be deduced based on the original code reverse Code complement formula.

This example tells me that sometimes it is convenient, but returning to the source is often a more effective method.