Download Algorithm for finding a square root. 28 39 82 41 5 3 2 9 25 00 3 39

Algorithm for finding a square root.
5 3 2
28 39 82
25 00
103
9
41
3 39
3 09
1062
10649
30 82
21 24
9 58 41
9 58 41
0
1.
2.
3.
4.
5.
6.
7.
Us the number of pairs of digits in the radicand, n, to determine the number of
digits in the root.
Use 10n-1 times the root of the square number just smaller than the left-most 2-digit
number.
Square and double this number.
Subtract the square from the radicand. Divide the result by the doubled value.
Take the root of the remainder.
Add the results of steps 2 and 5.
Repeat steps as needed to obtain all digits of radicand.
For the above example:
1.
2.
3.
4.
5.
6.
7.
8.
Break the radicand is groups of pairs from the right.
Find the integer value that is the square root of the far left pair. Call this value the
current square root solution. In our example, this is 5, because the integer square
root of 28 is 5.
Square the current square root solution, and subtract it from the far two left pair
digits in the radicand. Call this new value r.
Multiple r by 100, then add the next two paired digits in the radicand to r.
Double the value that is currently the square root solution, then multiply it by ten.
Determine the largest units digit of this new number that can divide into r. Call this
value q.
Divide the number found in step 5 into r. Add this quotient to the square solution
above the current paired numbers.
Multiply found digit by q, and subtract this result from r, giving a new value to r.
Repeat steps 4 through 7 until all digits are used in the radicand.