Talk:Square root algorithms: Difference between revisions

Content deleted Content added
Line 294:
::such that <math>X_m \geq 0</math> for all <math>1 \leq m \leq n-1</math>, with initialization <math>X_0 = N - a_0^2.</math> Here the <math>X_m</math> is the dividend. When <math>X_m = 0</math> the algorithm terminates and the sum of <math>a_i</math>s give the square root.([[User:Manoguru|Manoguru]] ([[User talk:Manoguru|talk]]) 12:43, 18 December 2013 (UTC))
:::Notability is determined by third party sources, not by the source book or paper. Have a look at [[Vedic Mathematics (book)]], it seems to be mostly controversy about 'Vedic' and people pushing it as that and the use in schools has been under the impression it helps nationalism rather than anything to do with its merits as maths. It doesn't have much in the way of notability as maths. [[User:Dmcq|Dmcq]] ([[User talk:Dmcq|talk]]) 15:00, 18 December 2013 (UTC)
::::I agree with your sentiments. I too think that the title of Vedic is a misnomer and it is best to label the method simply as the duplex method.([[User:Manoguru|Manoguru]] ([[User talk:Manoguru|talk]]) 04:16, 19 December 2013 (UTC))
:::Personally I see very little point in going into the system in detail. I mean why do you want to learn off by heart a quicker way of doing square roots by hand? Does it confer greater understanding? You said you didn't find it obvious. Is it useful? I think it is worth showing students how to do things by hand but learning a more complicated algorithm which is faster is not a real gain when they'd use calculators if they really needed to know the result without error. I think it should just be described in the sort of detail given for the other methods, this isn't a how to manual. [[User:Dmcq|Dmcq]] ([[User talk:Dmcq|talk]]) 15:12, 18 December 2013 (UTC)
::::The flaw in this argument is that all the algorithms are done by hand before people can trust it for machine implementation. If hand computation yields faster results, then so will the machine implementation. For instance, the digit-by-digit square root method for binary strings is often implemented in computers. Also for much of history, the Babylonian method was done by hand. That being said, I agree with the last point that you make. A concise description of the duplex method is not given and one example would have been sufficient. But I don't dare make the edits myself, lest I incite edit wars. ([[User:Manoguru|Manoguru]] ([[User talk:Manoguru|talk]]) 04:16, 19 December 2013 (UTC))