Modular Inverses and Chinese Remainder Algorithm
Number Theory
2013-09-03 v1
Abstract
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is also shown to be applicable for the Chinese Remainder problem, i.e., simultaneous linear congruence equations, for co-prime moduli as well as non-co-prime moduli.
Cite
@article{arxiv.1308.6411,
title = {Modular Inverses and Chinese Remainder Algorithm},
author = {W. H. Ko},
journal= {arXiv preprint arXiv:1308.6411},
year = {2013}
}