dear sir ,
There are unlimited number of coupons each bearing one of the letters of A,B,C .In how many ways m coupons can be selected such that the word BAC cannot be spelt. [answer is 3*(2^m - 1) ]
dear sir ,
There are unlimited number of coupons each bearing one of the letters of A,B,C .In how many ways m coupons can be selected such that the word BAC cannot be spelt. [answer is 3*(2^m - 1) ]










