Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This question already has an answer here:

The number of ways in which an examiner can assign 15 marks to 5 questions giving not less than 2 marks to any question is
a.1 b.126 c.120 d.240
I am getting no clue!

share|cite|improve this question

marked as duplicate by Marc van Leeuwen, T. Bongers, Dennis Gulko, Lord_Farin, azimut Nov 6 '13 at 8:15

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

This problem is very similar:… – Byron Schmuland Sep 30 '12 at 18:20
So, we need to find $a,b,c,d,e\ge 0$ such that $a+b+c+d+e=5$. By divide & conquer approach, I've arrived at $^{5+5-1}C_4=126$ possible values which must be available from some standard formula of which I'm unfortunately not aware. – lab bhattacharjee Sep 30 '12 at 18:53
up vote 2 down vote accepted

This is a straightforward stars-and-bars question. Since each question must receive at least two marks, you have $15-2\cdot5=5$ marks left to distribute as you please amongst the $5$ questions, so you’re putting $5$ indistinguishable objects into $5$ distinguishable containers. As is explained quite clearly in the article to which I linked, this can be done in $$\binom{5+5-1}{5-1}=\binom94=126$$ ways.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.