• retagged by
1,564 views

1 Answer

Best answer
3 3 votes

The given problem can be formulated as :

x1 + x2 + x3 = 10 subjected to constraints :

0 <= x1 <= 6 ,

0 <= x2 <= 7

0 <= x3 <= 8

So solution to the given problem is nothing but finding coefficient of x10  in (1 + x ..+ x6) . (1 + x .. + x7) . ( 1 + x ....+ x8)

                                                         ==>   coefficient of x10  in  (1 - x7) . (1 - x8) . (1 - x9 ) .( 1 - x ) -3

Now out of the terms of (1 - x7) . (1 - x8) . (1 - x9 ) , we extract only those terms which contribute to x10 ..

So

(1 - x7 ) . (1 - x8 - x9 + x17 )    =  1  -  x8  - x9  -  x7  [ Only those terms which contribute to x10 are mentioned ]..

Now for each of the 4 terms we find the corresponding coefficient in ( 1 - x ) -3  and then finally sum up to find the answer.

So due to the term 1 , we have :   3-1+10C10   =   66

      due to the term 2 , we have :  3-1+2C2  =  6

        due to the term 2 , we have :  3-1+1C1  =  3

        due to the term 2 , we have :  3-1+3C3  = 10

Hence , no of ways  =   66  -  6 - 3 - 10 

                              =   47

Hence 47 should be the correct answer.

• selected by
Position:
Show:

Related questions

1 1 vote
2 2 answers
1.0k
1.0k views
agoh asked Dec 28, 2016
1,044 views
Please explain how to solve the following:There are 3 boxes and 5 balls. a. Distribute into [1,1,3] a.1. Boxes are different and balls are different a.2. Boxes are undist...
4 4 votes
2 2 answers
740
740 views
GO Classes asked Jun 11, 2025
740 views
How many $8-permutations$ are there of the $10$ $letters$ of the word $CALIFORNIA$ (with repeated letters)?A. $\frac{47}{4} \cdot 8$ !B. $\frac{47}{2} \cdot 8$ !C. $8!\cd...
1 1 vote
5 5 answers
689
689 views
0 0 votes
2 2 answers
434
434 views
GO Classes asked Jun 11, 2025
434 views
How many ways are there to form a $3-letter$ word (i.e. sequence) containing the letter $C$ using the letters $A, B, C, D, E$ with repetitions of letters allowed?