Number of combinations with limited repetition

  • Thread starter Thread starter EmileMaras
  • Start date Start date
  • Tags Tags
    Combinations
AI Thread Summary
The discussion revolves around calculating the number of ways to distribute n equivalent atoms among M distinct objects, with each object having a maximum limit of nlim atoms. When nlim is less than n, the problem diverges from the classical combinations with repetition. The user seeks an analytical solution, as their current method using summations becomes computationally intensive with large values of M and n. An example with n=3, M=3, and nmax=2 illustrates the complexity, yielding 7 valid combinations. The thread highlights the need for a more efficient approach to solve this combinatorial problem.
EmileMaras
Messages
2
Reaction score
0
Hello

I have the following combinatoric problem :
I want to distribute n (equivalent) atoms among M distinct objects. Each object can contain from 0 to nlim atoms. How many combination do I have for this system?

If nlim>n, this problem actually corresponds to the classical "Number of combinations with repetition". But in my case nlim<n. In fact, I am interested in the limit of (lnΩ)/n (Ω beeing the number of combination) when M and n tend toward infinity (with n=a M where a is a constant) while nlim is finite (and actually rather small)..

I found a solution for that problem using some series of summations but it will be impossible to caculate as soon as M and n become large (even for M=100, n=300 and nmax=10, it took my laptop more than one hour to solve it).
Is there a simple analytical solution to this problem?

Thank you for your help.

Emile Maras
 
Mathematics news on Phys.org
For the first atom,there is M choices...for the second,again M choices...for the third,again M choices...and so on!
So there is always M possible choices and all that we should do is to multiply the number of choices for each of the atoms which becomes M^n. But because the atoms are identical,we should decrease this amount by dividing it by n!.
 
I guess that it is not the correct answer. Maybe I did not state my problem properly, so I will just give an exemple.
Let's say I have n=3 atoms and M=3 object. An object can contain at max nmax=2 atoms. Then the possible combinations are 111, 012, 021, 102, 120, 201, 210 (where xyz gives the number of atom in each object) which corresponds to 7 combinations.
 
EmileMaras said:
I guess that it is not the correct answer. Maybe I did not state my problem properly, so I will just give an exemple.
Let's say I have n=3 atoms and M=3 object. An object can contain at max nmax=2 atoms. Then the possible combinations are 111, 012, 021, 102, 120, 201, 210 (where xyz gives the number of atom in each object) which corresponds to 7 combinations.

Yeah,my answer is wrong.It even gives a non-integral value!
Anyway,Check here!
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top