Paul KhuongLet's say you know the input is an exact multiple of your integer divisor. Does that let you come up with a smaller div-by-mul constant?
EDIT: I don't mean a reciprocal inverse mod 2^w, but literally a fixed point div by mul (which also avoids the need to ensure the divisor is odd).
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.