Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques
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 integ...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2014/575064 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|