Is it usually to not have a carry in the two's complement method for subtracting two binary numbers when we subtract a large number from small one ?

# Binary Numbers – Subtracting Using 2’s Complement

binary

###### Related Topic

- Electrical – Binary Division with Signed Numbers
- Electronic – Why does signed (2’s complement) binary multiplication have different procedure than unsigned
- Electrical – Problem in overflow detection in signed 2’s complement 3-bit numbers
- How to Subtract a Larger Binary Number from a Smaller Binary Number
- Electronic – Converting hexadecimal digit to two’s complement

## Best Answer

Carry behaves as if all numbers are unsigned. Just subtract as you were taught in school, i.e. going from right to left with 'borrow':

Whenever a borrow remains, a binary adder-subtractor will set carry out. It is fairly obvious this will happen if and only if the first operand is less than the second. So far for positive numbers.

So what about negative numbers? As I already pointed out, carry behaves as if all numbers are unsigned. For a negative number, you first need to look up which unsigned number has the same binary representation as the negative number. For example,

`-3`

is represented by`1101`

in (4-bit) two's complement.`1101`

represents`13`

when considered an unsigned number. That means:In binary:

In general, the unsigned equivalent of a negative number in two's complement is

alwaysgreater than the unsigned equivalent of a positive number in two's complement. So as far as carry is concerned, a negative number is always greater than a positive number. If you keep that in mind, then the answer to your question should be: yes.