Let $N > 1$. We present a method for multiplying two integers (called N-residues) modulo N while avoiding division by N. N-residues are represented in a nonstandard way, so this method is useful only if several computations are done modulo one N. The addition and subtraction algorithms are unchanged.
No takes yet. Share an insight, caveat, or question.
Peter L. Montgomery (1985) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: