1. Divide the integer part of the square root into a paragraph every two bits from the unit to the left, and divide it into several paragraphs with an apostrophe, indicating how many bits there are in the square root.

2. According to the number in the first paragraph on the left, find the number with the highest square root.

3. Subtract the square of the highest digit from the number in the first paragraph, and write the number in the second paragraph to the right of their difference to form the first remainder.

4. Multiply the highest digit by 20 and try to divide it by the first remainder, and the largest integer is taken as the trial quotient.

5. Multiply the quotient by 20 times the highest digit of the quotient, and then multiply the quotient. If the product is less than or equal to the remainder, the quotient is the second digit of the square root; If the product is greater than the remainder, reduce the trial quotient and try again.

6. In the same way, continue to look for numbers on other bits of the square root.

Extended data

Theoretical basis of square root:

The square root is the inverse of the square. As long as you know the calculation method of the square root, the square root can be solved easily.

Let the digital value of 10 be a and the digital value be b, then it is A * 10+B, and according to the square of the sum of the two numbers, it is: (ax10+b) 2 = (ax10) 2+2 (ax/2).

Example: Example 359 2 Calculation method

1、3^2=9,

2 、( 20x3+5)x5=325，

3、(20*35+9)*9=638 1,

4. Combine these numbers into two paragraphs: 90000+32500+6381=128881. Get 359 2 = 12888 1.

Reversing these calculation steps is the square root. In the same way, we can get the method of square root and n power.

References:

Baidu encyclopedia-square root