RECIP.COM tells you what you've got to do if you want to divide
a 32bit number by a constant (replacing division with multiplication
by the reciprocal). Don't give it larger numbers than 2^32.
Remainder can not be calculated this way. Use SHR if dividing by 2^n.

For example, AMD K6 has fast integer multiply (two cycles) but slow
integer division (roughly 18 cycles for 32b divides). For Pentium, IDIV/DIV
take 46/45 cycles for 32b divides and 10 cycles for IMUL/MUL.
For PPro/PII, the figures are similar to that of K6's (MUL is about 9 times
faster). For Cyrix 6x86, MUL is about 2.6 times faster.

That's why one shouldn't use 45 cycle integer division when there are
better ways, for example RECIP.COM ( :) ), FPU for some cases, better
optimizing compilers, assembly optimizing the code etc.
A lot of programs do stupid DIVs, for example Photoshop (good proggy, though).
