Answer:
-1/4(5x+3)
Step-by-step explanation:
-1/4(5x+3)
Answer:
n = 29 iterations would be enough to obtain a root of that is at most away from the correct solution.
Step-by-step explanation:
You can use this formula which relates the number of iterations, n, required by the bisection method to converge to within an absolute error tolerance of ε starting from the initial interval (a, b).
We know
a = -2, b = 1 and ε = so
Thus, n = 29 iterations would be enough to obtain a root of that is at most away from the correct solution.
<u>You can prove this result by doing the computation as follows:</u>
From the information given we know:
This is the algorithm for the Bisection method:
- Find two numbers <em>a</em> and <em>b</em> at which <em>f</em> has different signs.
- Define
- If then accept c as the root and stop
- If then set <em>c </em>as the new<em> b</em>. Otherwise, set <em>c </em>as the new <em>a</em>. Return to step 1.
We know that and so we take and then
Because we set as the new <em>b.</em>
The bisection algorithm is detailed in the following table.
After the 29 steps we have that hence the required root approximation is c = -0.50
2+1=3 is not an identity property. The rest are because the value equals itself after dividing, subtracting, and multiplying.
Answer:
5/4×9/10
<u>5*9</u> = <u>45</u> <u>(divide by least common denominator)</u> = <u>9</u>
4*10 40 (divide by least common denominator) 8
Step-by-step explanation:
The least common denominator is 5
Answer:
Four hundred Thirty-three and thirty-eight hundredths
Step-by-step explanation:
the four is four hundred
the two three's after the four are thirty-three
and the three and eight after the decimal are thirty-eight hundredths