7, 13, 19 and 25 have a common difference: 6.
6 added to 7 gives us 13; 6 added to 13 gives us 19, and so on.
Explicit formula: a(n) = 7 + 6(n-1), where 7 is the first term and n is the counter (1, 2, 3, ...).
The first term is 7 (given). This corresponds to n=1.
The second term is a(2) = 7 + 6(2-1), or 7 + 6, or 13. This corresponds to n = 2.
and so on.
B. is the answer if you look closely
1.8, Problem 37: A lidless cardboard box is to be made with a volume of 4 m3
. Find the
dimensions of the box that requires the least amount of cardboard.
Solution: If the dimensions of our box are x, y, and z, then we’re seeking to minimize
A(x, y, z) = xy + 2xz + 2yz subject to the constraint that xyz = 4. Our first step is to make
the first function a function of just 2 variables. From xyz = 4, we see z = 4/xy, and if we substitute
this into A(x, y, z), we obtain a new function A(x, y) = xy + 8/y + 8/x. Since we’re optimizing
something, we want to calculate the critical points, which occur when Ax = Ay = 0 or either Ax
or Ay is undefined. If Ax or Ay is undefined, then x = 0 or y = 0, which means xyz = 4 can’t
hold. So, we calculate when Ax = 0 = Ay. Ax = y − 8/x2 = 0 and Ay = x − 8/y2 = 0. From
these, we obtain x
2y = 8 = xy2
. This forces x = y = 2, which forces z = 1. Calculating second
derivatives and applying the second derivative test, we see that (x, y) = (2, 2) is a local minimum
for A(x, y). To show it’s an absolute minimum, first notice that A(x, y) is defined for all choices
of x and y that are positive (if x and y are arbitrarily large, you can still make z REALLY small
so that xyz = 4 still). Therefore, the domain is NOT a closed and bounded region (it’s neither
closed nor bounded), so you can’t apply the Extreme Value Theorem. However, you can salvage
something: observe what happens to A(x, y) as x → 0, as y → 0, as x → ∞, and y → ∞. In each
of these cases, at least one of the variables must go to ∞, meaning that A(x, y) goes to ∞. Thus,
moving away from (2, 2) forces A(x, y) to increase, and so (2, 2) is an absolute minimum for A(x, y).
You would be subtracting by 5 so the next three would be -16, -21, -26
Answer:
84 different lineups are possible
Step-by-step explanation:
The order in which the songs are chosen is not important. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In this question:
6 musics from a set of 9. So
84 different lineups are possible
