Use the computer to find the approximate value of the following number, and keep the following three digits. Because there is no computer, please (1) negative root sign 5 (2) positive and negative root sign 6.21 (3) root sign 1 and 1 / 6

Use the computer to find the approximate value of the following number, and keep the following three digits. Because there is no computer, please (1) negative root sign 5 (2) positive and negative root sign 6.21 (3) root sign 1 and 1 / 6

Hello!
(1) - √5 ≈ - 2.236
(2) ±√6.21 ≈ ±2.492
(3) √(7/6) ≈ 1.080

Use a calculator to calculate the approximate value of √ 7 √ 12, and take three places after the decimal point

Root 7 ≈ 2.646, root 12 ≈ 3.464

Find the approximate value of the cube root of 2 (accurate to 0.01) by dichotomy,

int main(){
double a=1,b=2;
while (fabs(b-a)>0.01){
double c = (a+b)/2.0;
if ((2-a*a*a)*(2-c*c*c) < 0)
b=c;
else
a=c;
}
printf("%8.3lg\n",(a+b)/2.0);
return 0;
}

Compare (√ 3 + √ 5) and (2 √ 5) without calculator
Such as the title

Compare (√ 3 + √ 5) and (2 √ 5) without calculator
√3

The true value range of complement of computer composition principle
Binary code 10 million (the highest bit is the sign bit), the corresponding true value of the original code is - 0, and the corresponding true value of the inverse code is - 127, which can be understood. But why is the complement - 128? (when 10 million is negated, the sign bit does not change, it is 1111 1111, and then after adding 1 at the end, how to deal with the carry?)

-The complement of 0 is also 0000 0000, and carry is module. No matter what, you first see that the complement of - 127 is 1000 0001 (- add 1 at the end of the inverse of 127), right? That 1000 0000 is 1000 0001-1 = - 127-1 = - 128. Right

The decimal number 254.25 is converted into 8421BCD code,

The method is to convert one decimal number into four binary numbers
(254.25) decimal = (0010 0101 0100.0010 0101) BCD code

Convert the following decimal numbers into 8421BCD code and the remaining 3 codes
（1）74,（2）45.36,（3）136.5,（4）374.51

These two are as long as each number corresponds to each other
Here I will give an example of the previous two (in the order of 8421BCD code and the remaining three codes)
(1) (0) 1110100 10100111 (the first 0 of integer bit can be omitted)
(2) (0) 1000101.0011011 (0) (0) 11110000.01101001 (the last 0 of decimal place can be omitted)

The decimal number 658 is converted into 8421BCD code and 3bcd code respectively

0110 0101 1000 and 1001 1000 1011

Decimal decimal converted to 8421BCD code, such as 0.9743 converted to 8421BCD code is how much?
Is there a decimal point?

8421BCD is to replace decimal numbers 0-9 with four binary numbers. For example, the 8421BCD code of decimal 0 is (0000), the 8421BCD code of 1 is (0001), and the 8421BCD code of. 9 is (1001),
The 8421BCD of 0.9743 is 0000.1001011101000011

When 10011 is used as 8421BCD code, it is equivalent to decimal number ()

10010011 is 94 as 8421BCD code; it is equal to decimal number (94)