Difference between revisions 163980375 and 207772518 on enwiki

The '''shifting nth-root algorithm''' is an [[algorithm]] for extracting the [[Radical (mathematics)|''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)==External links==
* [http://www.mathpath.org/Algor/cuberoot/cube.root.mediant.htm  MATHPATH: Cube roots via Mediants] 
* [http://mathpages.com/home/kmath055.htm  MATHPAGES, Kevin Brown: D. Gomez's Cube-root algorithm] 

[[Category:Root-finding algorithms]]

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

All content in the above text box is licensed under the Creative Commons Attribution-ShareAlike license Version 4 and was originally sourced from https://en.wikipedia.org/w/index.php?diff=prev&oldid=207772518.

This site is not affiliated with or endorsed in any way by the Wikimedia Foundation or any of its affiliates. In fact, we fucking despise them.