How this calculation works
Compute the output bit and carry of a single full-adder stage.
THE FORMULA
Sum=(a+b+c) mod 2, carry=floor((a+b+c)/2)A worked example
1+1+1=11₂, so both outputs equal one.
Good to know
Each input is either zero or one.
Reference: NIST DLMF, Functions of Number Theory (opens in a new tab) ↗
Read the result
Compute the output bit and carry of a single full-adder stage.
The primary result is labeled “Sum bit”. Keep the input definitions in view when comparing this result with another method.
Try a related calculation
Each input is either zero or one.
For a related exercise, try the greatest common divisor.
A few questions, answered
How can I check the default inputs by hand?
1+1+1=11₂, so both outputs equal one.
Which rule does this calculator apply?
Sum=(a+b+c) mod 2, carry=floor((a+b+c)/2)