Talk:Square root algorithms: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
Line 35:
:The method does not require the initial guess to be the closest perfect square. This was only used to obtain a bound on the error. The 600 value is obtained in the above section on scalar estimates and was used as the initial guess in the previous example. --[[User:Wcherowi|Bill Cherowitzo ]] ([[User talk:Wcherowi|talk]]) 23:27, 26 February 2020 (UTC)
 
The article referenced [https://simplycurious.blog/2018/06/05/bucking-down-to-the-bakhshali-manuscript/ above] makes clear, by numerical example, that the initial guess does not need to be near the closest perfect square. <!-- Template:Unsigned --><span class="autosigned" style="font-size:85%;">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Sramakrishna123|Sramakrishna123]] ([[User talk:Sramakrishna123#top|talk]] • [[Special:Contributions/Sramakrishna123|contribs]]) 22:10, 19 December 2020 (UTC)</span> <!--Autosigned by SineBot-->
 
== Square Root algorithm in 1965 Friden EC-132 Electronic Calculator ==