Content deleted Content added
Line 292:
::Now the computation can proceed by recursively guessing the values of <math>a_m</math> so as that
:::<math>X_m = X_{m-1} - qa_m - d_m, </math>
::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))
| |||