An urn contains 5 red marbles, 4 black marbles and 3 white marbles. Then, the number of ways in which 4 marbles can be drawn so that at the most three of them are red is
The urn has red, black and white marbles, so the total number of marbles is .
We must select marbles. When every marble is distinguishable, the basic counting rule for choosing objects from distinct objects is the combination formula
Applying this formula to the complete set of marbles, the total number of possible samples of marbles is
However, the condition “at the most three of them are red” forbids exactly one case: all four chosen marbles being red. We therefore compute how many selections consist of four red marbles and then subtract those unwanted selections from the total.
Among the red marbles, the number of ways to choose red marbles is
No other selection violates the condition, because any mixture containing or red marbles is allowed. Thus the required number of favourable selections is obtained by excluding the completely red selections from the total selections:
So, the answer is .
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.