Zadanie 1f
Give the exact sets of bases for which the graphs have (i) two intersections; (ii) no intersections. You may use the unique contact base a∗ = exp(1/(2e2)).
Wczytuję zadania…
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.
Wybierz umiejętność, rok lub poziom trudności.
Pokazujemy tylko poziomy, dla których mamy zadania.
Znaleziono 1343 zadania
Give the exact sets of bases for which the graphs have (i) two intersections; (ii) no intersections. You may use the unique contact base a∗ = exp(1/(2e2)).
Estimate for tomorrow (i) the probability that a kitchen returns at least one container; (ii) the expected number returned per kitchen.
Using the expected total, estimate the minimum number of washing batches needed.
Find (f∘g)(x).
Sketch y=(f∘g)(x) for −0.55≤x≤0.55, labelling local extrema.
For two parameters and budget 18, express their product as a function f of x_1 alone.
(i) State the maximizing x_1. (ii) Hence show that the maximum product is 8.
The proposed formula for two parameters is M_2(S)=(S−2)/2. Verify it at S=18.
(i) Show that the arithmetic and geometric means of z_j=x_j² are equal when all parameters x_j are equal. (ii) Prove Mn(S) = (S/n − 1)n/2 for every admissible n.
Find (i) M_3(18); (ii) M_4(18); (iii) M_5(18).