![](/images/graphics-bg.png)
Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques
Joint Authors
Mahmood, M. Khalid
Ahmad, Farooq
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-05-15
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruence mod p to polynomial congruence mod pk.
For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the form axn≡b(mod pk), k≥1, where a,b, and n>0 are integers which are not divisible by an odd prime p.
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 ax-n≡b(mod pk) has also been addressed.
American Psychological Association (APA)
Mahmood, M. Khalid& Ahmad, Farooq. 2014. Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques. Abstract and Applied Analysis،Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1033845
Modern Language Association (MLA)
Mahmood, M. Khalid& Ahmad, Farooq. Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques. Abstract and Applied Analysis No. 2014 (2014), pp.1-9.
https://search.emarefa.net/detail/BIM-1033845
American Medical Association (AMA)
Mahmood, M. Khalid& Ahmad, Farooq. Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques. Abstract and Applied Analysis. 2014. Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1033845
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1033845