Answer Happy

1/ Let f (x) = e' - 2x Question 1 of 4 1 Points Bepaal al die opsies wat impliseer dat daar 'n unieke nulpunt p van fin [2,3] is? / Determine all the options which imply that there is a unique zero poffin [2,3]? O A. f(2) f(3)<0 B. f'(X)>0 on [2,3]. Oc.fe C[2,3] OD. f is 'n onewe funksie / f is an odd function.
Question 2 of 4 1 Points Die halveeringsmetode genereer intervalle [ao,bol. [1,01], ... en benaderings po=(ac+bo)/2, P1=(a+b)/2, ... Watter van die volgende stellings is waar? The bisection method generates intervals (a,bol, (a1,01), ... and approximations po=(ao+bo)/2, P1=(a +61)/2, ... Which of the following assertions are true? In bo-ao) In e As die halveringsmetode met fouttoleransie & > 0 gebruik word, benodig dit n = herhalings In 2 In (bo - 2o) - Ine A. If the bisection method is used with error tolerance E > 0 then it requires n = iterations. In 2 OB.IP.-P. Slao-bol/21 C. /Pn+-p/SC/Pn-p/ OD. an-b, (ao-bo)/2" vir 'n / for some C >0.
Question 3 of 4 1 Points Click to see additional instructions Gebruik 3 iterasies van die halveringmetode om die nulpunt pe [2,3] van f te benader. /Use 3 iterations of the bisection method to approximate the zero pe [2,3] off antwoord/answer: p3=
Question 4 of 4 1 Points Click to see additional instructions Hoeveel stappe van die halveringsmetode is ten minste nodig om die nulpunt p E [2,3] met 'n fout van hoogstens 0.5x10-6 te bepaal? / At least how many steps of the bisection method are needed to determine the zero pe [2,3] with an error of at most 0.5x10-6 ? antwoord/answer: stappe/steps