Difference between revisions 309681986 and 312630839 on enwiki

< previous diff
next diff >
Shifting nth root algorithm
{{Cleanup|date=December 2008}}
{{howto}}
The '''shifting ''n''th root algorithm''' is an [[algorithm]] for extracting the [[nth root|''n''th root]] of a positive [[real number]] which proceeds iteratively by shifting in ''n'' [[numerical digit|digits]] of the radicand, starting with the most significant, and produces one digit of the root on each iteration, in a manner similar to [[long division]].

==Algorithm==
===Notation===

(contracted; show full)           1 1295 2830 2447 6799

[[Category:Root-finding algorithms]]
[[Category:Articles lacking sources (Erik9bot)]]

[[de:Schriftliches Wurzelziehen]]
[[fr:Algorithme de décalage n-racines]]
[[nl:Worteltrekken]]