This result yields a simple algorithm for finding the base-2 representation for the additive inverse of an integer. If $r_{N - 1}, \, \ldots, \, r_1, r_0$ is a binary representation for an integer $a$, then flipping the digits to $(1 - r_{N - 1}), \, \ldots, \, (1 - r_1), (1 - r_0)$ and adding $1$ yields a binary representation for $-a$.