Talk:Square root algorithms: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by 2601:2C1:C003:EF7A:58A9:3D2:9198:302A - ""
move new section of talk "Are We Going to Add This to the Main Page?" to the bottom of the page where it should be
Line 1:
{{Maths rating|class= Start|importance= low|field= analysis}}
 
==Are We Going to Add This to the Main Page?==
 
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-->
 
==Ibn al-Banna==
Line 329 ⟶ 325:
 
:So, how does this compare to the Odd-integer methods? As used by operators of hand-cranked decimal calculators or even electrically-cranked ones such as Friden.[[User:NickyMcLean|NickyMcLean]] ([[User talk:NickyMcLean|talk]]) 04:12, 26 February 2015 (UTC)
 
==Are We Going to Add This to the Main Page?==
 
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-->