Talk:Square root algorithms: Difference between revisions

Revision as of 05:54, 19 August 2016

Revision as of 01:38, 4 October 2016

Line 331:

While playing around with numbers, I discovered this, but if you're reading this, feel free to check this method: To approximate the square root of a positive integer n, start with a fraction that has 1 as the numerator and 0 as the denominator. For each subsequent fraction, the numerator is the numerator of the previous fraction + n*the denominator of the previous fraction, and the denominator is the sum of the numerator and denominator of the fraction before it. Although the fraction will never exactly reach the square root of n, it will keep coming closer. ---- <small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/2601:2C1:C003:EF7A:58A9:3D2:9198:302A|2601:2C1:C003:EF7A:58A9:3D2:9198:302A]] ([[User talk:2601:2C1:C003:EF7A:58A9:3D2:9198:302A|talk]]) 01:22, 13 February 2016 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

:I noticed that your contribution was removed from the article because wikipedia is not meant for publishing own research. In any case, if for some n your method converges, it will indeed converge to the square root of n. Bye, [[User:Bob.v.R|Bob.v.R]] ([[User talk:Bob.v.R|talk]]) 22:07, 13 February 2016 (UTC)

::Sounds a lot like continued fraction expansion. [[User:Manoguru|Manoguru]] ([[User talk:Manoguru|talk]]) 01:38, 4 October 2016 (UTC)

== Note: 20p + x is simply twice p, with the digit x appended to the right). ==