A problem by Rohan Mukhopadhyay
In how many ways can a committee of 5 members be selected from 10 aspirants provided that the* youngest* is excluded when the oldest is included? (please write the solution if you have solved it.)
The answer is 196.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Total Number of Possible Committees: 10 c 5
Committees that have both the oldest and the youngest member: 8 c 3
Required Number = (10 c 5) - (8 c 3)