This repository stores a quick and dirty program used to find a multiplier and shift variable assignment to implement division and modulo of a n/d where d is constant using just multiplication and bitshifts.
jawline/efficient-integer-remainder
Library to compute the division or remainder of arbitrary integers using only division and bitshifts when the divisor is fixed
Rust