Newton's Method of converging on the nth root of C, represented as an Integer computation:
Newton's method is known to converge slowly, and I do not have an associated margin of error at this time.
Newton proved: x(k+1) = x(k) - [x(k)^n + C]/[n * x(k)^n-1] converges on the nth root of C.
My first step is to rewrite x(k) as (a/b)(k) or a(k)/b(k)
From this we obtain:
(a/b)(k+1) = (a/b)(k) - [(a/b)(k)^n - C / n * (a/b)(k) ^ (n-1)]
Focusing on x(k), we begin:
I do not know how to use the editor that does notation.
Comments
Post a Comment