Abstract
In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruence to polynomial congruence . For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the form , where and are integers which are not divisible by an odd prime . It is shown that the algorithms suggested in this paper drastically reduce the complexity for such computations to a logarithmic scale. The efficacy of the proposed technique for solving negative exponent equations of the form has also been addressed.
Citation
M. Khalid Mahmood. Farooq Ahmad. "Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques." Abstr. Appl. Anal. 2014 (SI51) 1 - 9, 2014. https://doi.org/10.1155/2014/575064