Talk:Square root algorithms: Difference between revisions

Revision as of 15:58, 25 May 2018

Revision as of 02:56, 17 June 2018

Line 381:

Also, mentioning that the '20' in '20p' is the product of the base, 10, and the root being sought, 2, may be another effective link to the related article, https://en.wikipedia.org/wiki/Shifting_nth_root_algorithm <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/137.118.149.208|137.118.149.208]] ([[User talk:137.118.149.208#top|talk]]) 21:22, 24 May 2018 (UTC)</small> <!--Autosigned by SineBot-->

: Your suggestion in the first paragraph of your message seems to me to be a good one. Why don't you go ahead and replaced the example with a better one? I'm not so sure about "explicitly noting the values..." That may be a good idea, or it may just add more clutter and make the whole thing more confusing. I suppose to some extent it depends on how it is done. <small>''The editor who uses the pseudonym''</small> "[[User:JamesBWatson|JamesBWatson]]" ([[User talk:JamesBWatson#top|talk]]) 15:58, 25 May 2018 (UTC)

== Double bubble method ==

My grandmother, who was a math teacher, taught me the digit by digit calculation method in the 1970s. She referred to it as the double bubble method, since to gain an additional digit of accuracy, you need to add two zeroes to the end of your remainder (assuming that you are taking the square root of a decimal that is terminating). Has anyone else heard this method called by that name? Google searches bring up nothing. [[User:Jdlawlis|Jdlawlis]] ([[User talk:Jdlawlis|talk]]) 02:56, 17 June 2018 (UTC)