Let be the congruence equation with f(x) a Polynomial of grade k then:(adsbygoogle = window.adsbygoogle || []).push({});

[tex] f(x)=0mod(p) [/tex]

then if we have as a first approximation [tex] f(x_{n+1})=0mod(p) [/tex]

then using a linear interpolation: [tex] f(x_{n})+f'(x_{n})(x_{n+1}-x_{n})=0mod(p) [/tex] or [tex] x_{n+1}=(x_{n}+\frac{f(x_{n}}{f'(x_{n})})0mod(p/f'(x_{n}) [/tex]

So we have 'modified' Newton method for solving Polynomial congruences. :Bigrin:

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Newton method and f(x)=0mod(p)

**Physics Forums | Science Articles, Homework Help, Discussion**