edited by
4,552 views
3 votes
3 votes

In how many ways can $15$ indistinguishable fish be placed into $5$ different ponds, so that each pond contains at least one fish?

  1. $1001$
  2. $3876$
  3. $775$
  4. $200$
edited by

3 Answers

Best answer
2 votes
2 votes
This given question is equivalent to distribution of 15 identical objects into 5 distinct boxes where each box contains at least one object.

Number of  ways it can be done = number of positive integer solutions of

=>  x1+x2+x3+x4+x5=15x1+x2+x3+x4+x5=15  
=> (15-1)C4 = 14C4 = 1001

A is ans.
selected by
1 votes
1 votes

given that distribution of 15 identical fish into 5 distinct ponds where each box contains at least one fish. 

Number of ways fishes placed in ponds

= $\binom{n-1}{r-1}$=$\binom{14}{4}$ =1001

Hence.Option(A)1001.

0 votes
0 votes
This is simple IODB template where 15 fishes are stars and 5 ponds means 4 bars.

 

Therefore 15stars and a+b+c+d+e=15stars.

 

Now you directly give 1 fish to each pond

 

THen the equation becomes a+b+c+d+e=10

 

Now there are 10 stars and 4 bars.-→ (14)C4===1001
Answer:

Related questions

5 votes
5 votes
2 answers
1
go_editor asked Jul 30, 2016
2,758 views
How many strings of $5$ digits have the property that the sum of their digits is $7$?$66$$330$$495$$99$
0 votes
0 votes
4 answers
4
go_editor asked Jul 31, 2016
3,901 views
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...