A comedian knows four jokes. One joke is old, one joke is new, and the other jokes are somewhere between. If the order in which these jokes are told makes a difference in terms of how thye are received, how many ways can they be delivered if the old joke is told first and the new joke is told last? The jokes can be delievered in _______ different ways.
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.
A comedian knows four jokes. One joke is old, one joke is new, and the other jokes are somewhere between. If the order in which these jokes are told makes a difference in terms of how thye are received, how many ways can they be delivered if the old joke is told first and the new joke is told last?
The jokes can be delievered in _______ different ways.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
