Zadanie 1a
Take f(x) = (5 − x)−3 and g(x) = (x + 1)3 on x<5. (i) Find f′(x). (ii) Show that 2f′(x)g′(x) = 18(x + 1)2/(5 − x)4. (iii) Show that f(x)g′(x) + g(x)f′(x) has the same value.
Zadania wzorowane na pytaniach z tego arkusza: te same umiejętności, format i punktacja, inne dane i kontekst. Treści arkusza IB nie publikujemy.
W bazie 13 zadań z tego arkusza, razem 55 punktów, każde z kluczem i schematem punktowania.
Take f(x) = (5 − x)−3 and g(x) = (x + 1)3 on x<5. (i) Find f′(x). (ii) Show that 2f′(x)g′(x) = 18(x + 1)2/(5 − x)4. (iii) Show that f(x)g′(x) + g(x)f′(x) has the same value.
For general f,g under the stated assumptions, rearrange the differential identity to show that f′/f = g′/(2g′ − g).
Integrate f′/f = g′/(2g′ − g) to show that , where A>0 is constant.
Use with g(x) = xex/2 to find the positive companion f satisfying f(0)=1.
Use the same companion-function formula, , with on 0<x<2π. Find the positive f satisfying f(π) = eπ/4, in the form f(x) = ex/4h(x).
Explain why the generator has 128 possible quadratics.
Verify that the allowed choice a=4,b=8,c=4 gives a graph with exactly one x-intercept.
Show that the probability of exactly one x-intercept is 3/64.
For generated quadratics with two distinct x-intercepts, determine the possible values of ac.
For quadratics with two distinct x-intercepts: (i) show that ac=1 gives six possible quadratics; (ii) show that ac=2 gives twelve.
Find the probability p that a generated quadratic has two distinct x-intercepts. Show how you count the possibilities.
Now use the continuous model q(x) = x2 + 2Zx + 4, where Z is normal with mean 0.5 and standard deviation 1.5. Find the probability of two distinct x-intercepts.
In the continuous model q(x) = x2 + 2Zx + 4, with Z normal of mean 0.5 and standard deviation 1.5, suppose the graph has two distinct x-intercepts and . Find the conditional probability that both intercepts are greater…
Zapisujemy na Twoim urządzeniu to, bez czego serwis nie działa, np. zalogowanie. Plików analitycznych użyjemy tylko za Twoją zgodą. Szczegóły w polityce prywatności.