A person buys eight packets of TIDE detergent. Each packet contains one coupon, which bears one of the letters of the word TIDE. If he shows all the letters of the word TIDE, he gets one free packet. If he gets exactly one free packet then the number of different possible combinations of the coupons is :
A person buys eight packets of TIDE detergent. Each packet contains one coupon, which bears one of the letters of the word TIDE. If he shows all the letters of the word TIDE, he gets one free packet. If he gets exactly one free packet then the number of different possible combinations of the coupons is :
The correct option is B 7C3−1
Let x1,x2,x3,x4 be the number of times T, I, D, E letter appears on the coupon.
Then we must have :
x1+x2+x3+x4=8,
where 1≤x1,x2,x3,x4≤8
(as each letter must appear once).
Then the required number of combinations of coupons is equivalent to number of positive integral solutions of the above equation, which is further equivalent to number of ways of 8 identical objects distributed among 4 persons when each gets at least one objects, which is given by
8−1C4−1= 7C3
But since he get exactly one packet means all the letters of the word TIDE should not occur again i.e. when x1=2,x2=2,x3=2,x4=2
So the required answer is 7C3−1
Let x1,x2,x3,x4 be the number of times T, I, D, E letter appears on the coupon.
Then we must have :
x1+x2+x3+x4=8,
where 1≤x1,x2,x3,x4≤8
(as each letter must appear once).
Then the required number of combinations of coupons is equivalent to number of positive integral solutions of the above equation, which is further equivalent to number of ways of 8 identical objects distributed among 4 persons when each gets at least one objects, which is given by
8−1C4−1= 7C3
But since he get exactly one packet means all the letters of the word TIDE should not occur again i.e. when x1=2,x2=2,x3=2,x4=2
So the required answer is 7C3−1
