In a locality, there are ten houses in a row. On a particular night a thief planned to steal from three houses of the locality. In how many ways can he plan such that no two of them are next to each other?
Explanation:
Out of the 10 houses, we first place the 7 houses in which the thief will not steal. There are 8 spaces in between and at either ends of these 7 houses where we can place the three houses in which he plans to steal. Thus, the three houses can be selected in 8C3 = 56 ways.
Hence, option (a).
» Your doubt will be displayed only after approval.
Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.