<Dd> M × ′ ′ 0 0 1 1 1 1 1 0 ′ ′ = M × (2 5 + 2 4 + 2 3 + 2 2 + 2 1) = M × 62 (\ displaystyle M \ times \, ^ (\ prime \ prime) 0 \; 0 \; 1 \; 1 \; 1 \; 1 \; 1 \; 0 \, ^ (\ prime \ prime) = M \ times (2 ^ (5) + 2 ^ (4) + 2 ^ (3) + 2 ^ (2) + 2 ^ (1)) = M \ times 62) </Dd> <P> where M is the multiplicand . The number of operations can be reduced to two by rewriting the same as </P> <Dl> <Dd> M × ′ ′ 0 1 0 0 0 0 - 1 0 ′ ′ = M × (2 6 − 2 1) = M × 62 . (\ displaystyle M \ times \, ^ (\ prime \ prime) 0 \; 1 \; 0 \; 0 \; 0 \; 0 (\ mbox (- 1)) \; 0 \, ^ (\ prime \ prime) = M \ times (2 ^ (6) - 2 ^ (1)) = M \ times 62 .) </Dd> </Dl> <Dd> M × ′ ′ 0 1 0 0 0 0 - 1 0 ′ ′ = M × (2 6 − 2 1) = M × 62 . (\ displaystyle M \ times \, ^ (\ prime \ prime) 0 \; 1 \; 0 \; 0 \; 0 \; 0 (\ mbox (- 1)) \; 0 \, ^ (\ prime \ prime) = M \ times (2 ^ (6) - 2 ^ (1)) = M \ times 62 .) </Dd>

Multiplication of binary numbers using booth's algorithm