Talk:Square root algorithms: Difference between revisions

Content deleted Content added
Regarding Vedic Method: no notability as maths
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)
:::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)