Answer:
-3/5
Step-by-step explanation:
2/3 *-9/8*-4/5*-1= -3/5
9514 1404 393
Answer:
Step-by-step explanation:
A recursive formula consists of two parts:
- initialization (rule for the first term(s))
- rule for the next term
When we look at the differences between terms in the sequence 3, -4, -11, ..., we find that they are constant at -7. That is each term can be found from the previous one by subtracting 7. This is our recursive rule. The first term is obviously 3, so the recursive formula is ...
a[1] = 3
a[n] = a[n-1] -7
Answer:
.
Step-by-step explanation:
Since repetition isn't allowed, there would be choices for the first donut, choices for the second donut, and choices for the third donut. If the order in which donuts are placed in the bag matters, there would be unique ways to choose a bag of these donuts.
In practice, donuts in the bag are mixed, and the ordering of donuts doesn't matter. The same way of counting would then count every possible mix of three donuts type times.
For example, if a bag includes donut of type , , and , the count would include the following arrangements:
Thus, when the order of donuts in the bag doesn't matter, it would be necessary to divide the count by to find the actual number of donut combinations:
.
Using combinatorics notations, the answer to this question is the same as the number of ways to choose an unordered set of objects from a set of distinct objects:
.