Zane is picking out some movies to rent, and he has narrowed down his selections to 4 horror films, 5 mysteries, 6 comedies, and 4 action movies. How many different combinations of 9 movies can he rent if he wants all 5 mysteries?

He can rent 1001 different combinations of 9 movies can he rent if he wants all 5 mysteries.

Step-by-step explanation:

The order is not important.

For example watching horror movie A and then horror movie B is the same combination as watching horror movie B then horror movie A. So we use the combinations formula to solve this problem.

Combinations formula:

is the number of different combinations of x objects from a set of n elements, given by the following formula.

How many different combinations of 9 movies can he rent if he wants all 5 mysteries?

There are 4+5+6+4 = 19 total movies.

He wants to watch all five mysteries(combination of 5 from a set of 5) and 4 of the other 19-5 = 14 movies. So

He can rent 1001 different combinations of 9 movies can he rent if he wants all 5 mysteries.

for me what is finding a good play list and going out because i can not lay down and relax so i usually go to a coffee shop. i also use the gum trick and this actually works. another advice is highlighting subjects it really does me remember certain things

step-by-step explanation:

∡ eia and ∡ kij are congruent

step-by-step explanation: