shows houses to a potential buyer. There are ten houses of the desired price on a list for the area. The buyer has time to visit only three of them. A. In how many ways could the three houses be chosen, if the order of visit is considered? B. In how many ways could the three houses be chosen, if the order is not important? c. If four of the houses are new and six have been previously occupied, and the three houses to visit are chosen at random, what is the probability that they are new?
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 real estate agent shows houses to a potential buyer. There are ten houses of the desired price on a list for the area. The buyer has time to visit only three of them. A. In how many ways could the three houses be chosen, if the order of visit is considered? B. In how many ways could the three houses be chosen, if the order is not important? c. If four of the houses are new and six have been previously occupied, and the three houses to visit are chosen at random, what is the
Step by step
Solved in 3 steps
