Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques

M. Khalid Mahmood and Farooq Ahmad

Abstract and Applied Analysis, 2014, vol. 2014, 1-9

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/575064.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/575064.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:575064

DOI: 10.1155/2014/575064

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().