Renee, Melissa, Xavier, Tamika and David have all been invited to Mr. Akins's birthday party. They arrive randomly and at different times. In how many ways can they arrive? In how many ways can Xavier arrive first and Renee last? Find the probability that Xavier will arrive first and Renee will arrive last.
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
Renee, Melissa, Xavier, Tamika and David have all been invited to Mr. Akins's birthday party. They arrive randomly and at different times.
In how many ways can they arrive?
In how many ways can Xavier arrive first and Renee last?
Find the probability that Xavier will arrive first and Renee will arrive last.
Step by step
Solved in 2 steps with 3 images
