a question on constraint dividers(PC)

ram has to attempt 4 papers each paper containing maximum 'n' marks
in how many ways he can get a total of 2n marks .....
note:if u want to use multinomial theorem then also provide proof of multinomial thoerem :)

3 Answers

62
Lokesh Verma ·

I dont know of a solution outside of multinomial thoerem..

what you will have to do is to look at the coefficient of

x2n in (1+x+x2+...+xn)4

which is same as the coefficient of x2n in (1-xn+1)4(1-x)4

this is a dirty quesiton and if someone has a better proof, i would love to see it

62
Lokesh Verma ·

btw.. the proof of multinomial theorem i remember is something we had probably discussed sometime back!

19
Debotosh.. ·

we search for the coefficient of x2n in (1+x+x2+......xn)4
.........same thing as above ! what is the other way in this ?

Your Answer

Close [X]