Answer:
a. V = 10*8*x
b. V= 10*8*22.5
Step-by-step explanation:
b. V= 1800
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
Answer:
C. n=23; p^=0.5
Step-by-step explanation:
Normal distribution is symmetrical about the mean.
So, p should be close to ½
Answer:
A. 0.75
B. Elsa can expect to gain 0.75 dollars
Step-by-step explanation:
We have six outcomes
Using the table in the attachment, the expected value was calculated.
Expected value = 0.166667+0.3333+0.5-0.083333-0.083333-0.083333
= 0.75
B. From the answer in part A , we can conclude that Elsa can expect to gain money. She can expect to win 0.75 dollars per roll.
Answer:
is this the answer ur looking for?
vx2−vx−6v
Step-by-step explanation: