Re:Faster remainders when the divisor is a constant: beating...
by bonzini on Friday February 08, 2019 @05:32PM
(#19119318)
The second edition of Hacker's Delight does have a section on "Testing for zero reminders after division by a constant", but it uses the multiplicative inverse.
[ Parent
| on HN ]
There are no comments on this comment yet.