Suppose the sample space for a probability experiment has 8 elements. If elements from the sample are selected without replacement, how many different ways can you select all of them?
Remember that "without replacement" means that the items are not returned to the sample space after they are chosen.

step-by-step explanation:

always plug in x. in this case, x equals 4.

i'm going to first solve 4(2+3x)

1) 4(2+3(4)) use pemdas to solve.

i'm going to multiply whats in the parenthesis first, so 3 times 4=12.

2)4 (2+12) i'm then going to multiply 4 by both numbers in the parenthesis (because multiplying comes before adding)

4 times 2= 8.   4 times 12= 48

4) (8+48)= 56 (answer)

i'm then going to solve 8+12x and plug in 4 for x.

1) 8 +12(4)

multiplying comes before adding, so i'm gonna multiply 12 and 4.

12 times 4= 48.

2) 8+48=56

both equal the same!

2160ft3

step-by-step explanation:

both graphs increase on their domain

neither graph has a y-intercept

step-by-step explanation:

the following points can be visualized easily from the graph