There are three rooms (I, II and III) with occupancy capacity of three each. P, Q, R, S and T are five friends. R and S occupied room I; T occupied room II. In how many different ways can P and Q occupy the rooms if there is no additional restriction?
8
Each room holds at most 3 people. Room I already has R and S (1 slot free), Room II has T (2 slots free), Room III is empty (3 slots free).
Place P first: it can go to Room I, II or III (3 choices), since all still have space.
If P → Room I (now full), Q can go to Room II or III: 2 choices.
If P → Room II (1 slot left there), Q can go to Room I, II or III: 3 choices.
If P → Room III (2 slots left there), Q can go to Room I, II or III: 3 choices.
Total ways = 2 + 3 + 3 = 8.
A person has to make a payment of ₹56. He has twenty-five ₹2 coins and nine ₹5 coins. In how many different ways can he make this payment?
In a matching problem, there are two columns. The first column has 4 statements whereas the second column has 5 statements. Every statement of the first column is to be matched with exactly one statement of the second column. In how many different ways can one student match the two columns if the student has no idea of the correct match?
If Quantity A is the number of ways to assign a number from 1 to 5 without repetition to each of four people, and Quantity B is the number of ways to assign a number from 1 to 5 without repetition to each of 5 people, then which of the following statements is correct with respect to Quantities A and B?
Which of the following muscles regulates the exit of food from the stomach into the small intestine?
There are 9 cups placed on a table arranged in equal number of rows and columns out of which 6 cups contain coffee and 3 cups contain tea. In how many ways can they be arranged so that each row should contain at least one cup of coffee?
In how many different ways can the letters of the word 'OPTICAL' be arranged so that the vowels always come together?
There are $15$ distinct points on a plain sheet of paper. If $4$ of these points are collinear, find the maximum number of triangles that can be drawn using these points.