Dear All,
I will highly appricitate your help. The problem is attached as a PDF, pleas take a look.
Regards
[QUOTE=Rafael;714765]The problem is attached as a PDF, pleas take a look./QUOTE]
First a comment in the form of a question. Why do you expect us to open another file? You could easily type the question yourself.
The question is: You have N bottles and n balls. You need to calculate the number of all possible distributions (configurations, states) of balls in the bottles considering that all balls and bottles are identical.
Now here is another critical comment: the formula in that post has nothing to do with the solution of the problem as it is stated. Because the bottles are identical as are the balls this is simply a question of how one partitions the integer n into N or fewer summands.
Here is an example: .
We could have: that is four ways.
Now there is no neat closed solution to this question. All solutions to the integer partition problem are recursively defined sequences (functions).
Here are some examples: if then , while then .
Now I actually question the use of the word identical in the original question. The suggested answer implies otherwise.
Dear Plato thanks for your reply. I am new here and I decided to attach the problem since I already
had it as a PDF in my computer.
According to you one can to find the number of states analytically
as a function of N and n.
Identical in the original question means that for example balls can not be distinguished from one another.
May I ask you for reference of your solution if there is any, in order to understand it in more detailed way.
Thanks for suggesting the book.
[QUOTE/Now there is no neat closed solution to this question. All solutions to the integer partition problem are recursively defined sequences (functions)./QUOTE]
So the recursive expression about which you were talking is PN(n)=PN-1(n)+PN(n-N) for 1<N<n right ?
Now regarding point b. in my problem "you have two different types of balls let us say n blue and m red balls, and you need to partition them into N identical bottles ".
What can you suggest for this case? In chapter 8.2 of above mentioned book there is being discussed problem of distribution of m different elements into k identical boxes.
G(m,k) denoted as the number of distributions of m different things into k identical boxes. And g(m,k) denoted the number of distributions of m different objects in k identical boxes, with no empty boxes. is it right to say that g(m,k) = G(m-k,k) (assuming that m>k>1) ?
Thanks in advance.