<u>Options</u>
- Counting rule for permutations
- Counting rule for multiple-step experiments
- Counting rule for combinations
- Counting rule for independent events
Answer:
(C)Counting rule for combinations
Step-by-step explanation:
When selecting n objects from a set of N objects, we can determine the number of experimental outcomes using permutation or combination.
- When the order of selection is important, we use permutation.
- However, whenever the order of selection is not important, we use combination.
Therefore, The counting rule that is used for counting the number of experimental outcomes when n objects are selected from a set of N objects where order of selection is not important is called the counting rule for combinations.
Answer:
Step-by-step explanation:
a1 = - 2
an = a1 * r^(n - 1)
a6 = -486
-486 = - 2 * r^(6-1) Divide by 2
243 = r^5
The largest value that r could be is 3.
4^5 = 1024
(243)^(1/5) = 3
So the general formula
an = -2*(3)^(n - 1)
Answer:
It is 9x^3.
Step-by-step explanation:
36x^4 and 45x^3.
GCF of 36 and 45 = 9
GCF of x^4 and x^3 = x^3
GCF of 36x^4 and 45x^2 = 9x^3.
16 tens = 16 x 10 = 160 ones
Answer:
D) 0.35
Step-by-step explanation:
The table gives the area between z=0 and the given magnitude of z. That is, the area between z = 0 and z = -0.6 is 0.23, as found in the 0.6 column of the table. Similarly, the area between z = 0 and z = 0.3 is 0.12, as found in the 0.3 column of the table.
The area between z = -0.6 and z = +0.3 is the sum of these areas:
p(-.6<z<.3) = 0.23 +0.12 = 0.35
