Revision as of 03:19, 8 October 2020 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,228 edits m Archiving 1 discussion(s) to Talk:Methods of computing square roots/Archive 1) (bot ← Previous edit		Revision as of 22:10, 19 December 2020 edit undo Sramakrishna123 (talk \| contribs) 19 edits m →"nearest perfect square" in Bakhshali method? Next edit →
Line 34: :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. == Square Root algorithm in 1965 Friden EC-132 Electronic Calculator ==

Talk:Square root algorithms: Difference between revisions