10-4. Signed Division by Divisors ≥ 2
At this point you may wonder if other divisors present other problems. We see in this section that they do not; the three examples given illustrate the only cases that arise (for d ≥ 2).
Some of the proofs are a bit complicated, so to be cautious, the work is done in terms of a general word size W.
Given a word size W ≥ 3 and a divisor d, 2 ≤ d < 2W − 1, we wish to find the least integer m and integer p such that
Equation 1a
Equation 1b
with 0 ≤ m < 2W and p ≥ W.
The reason we want the least integer m is ...
Get Hacker's Delight now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
