Number of combinations with limited repetition

In summary, the conversation is discussing a combinatoric problem involving distributing n equivalent atoms among M distinct objects. The possible combinations for this system are M^n divided by n!, with n representing the number of atoms and M representing the number of objects. The person asking the question is interested in finding the limit of (lnΩ)/n as M and n tend towards infinity, with n being a constant multiple of M and a finite maximum number of atoms allowed per object. The person has found a solution using summations, but it becomes complicated for large values of M and n. They are seeking a simple analytical solution to this problem.
  • #1
EmileMaras
2
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
  • #2
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 [itex] M^n [/itex]. But because the atoms are identical,we should decrease this amount by dividing it by [itex] n! [/itex].
 
  • #3
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.
 
  • #4
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!
 
  • #5


Hello Emile,

Thank you for presenting your combinatoric problem. From my understanding, you are interested in finding the number of combinations for distributing n equivalent atoms among M distinct objects, where each object can contain from 0 to a finite number nlim of atoms. The limit of (lnΩ)/n is of interest to you as M and n tend towards infinity while nlim remains finite.

Unfortunately, there is no simple analytical solution to this problem. As you have mentioned, even for relatively small values of M, n, and nlim, the calculations become extremely complex and time-consuming. In fact, this problem falls under the category of "combinatorial explosion," where the number of possible combinations increases exponentially with the number of variables.

However, there are some approaches that can help simplify this problem. One approach is to use generating functions, which can help represent the combinations in a compact form. Another approach is to use asymptotic analysis, which approximates the solution for large values of M and n. Both of these approaches may be useful in finding an approximate solution to your problem.

I hope this helps in your research. Best of luck in finding a solution to your combinatoric problem.

Sincerely,
 

What is the formula for calculating the number of combinations with limited repetition?

The formula for calculating the number of combinations with limited repetition is n^k, where n represents the total number of options and k represents the number of items being selected.

How do you calculate the number of combinations with limited repetition?

To calculate the number of combinations with limited repetition, use the formula n^k, where n represents the total number of options and k represents the number of items being selected. Simply plug in the values and solve for the total number of combinations.

What is an example of calculating the number of combinations with limited repetition?

For example, if you have 3 different colors and you want to select 2 of them, the number of combinations with limited repetition would be 3^2, which equals 9. This means there are 9 different ways to select 2 colors from a total of 3 options.

How is the number of combinations with limited repetition different from the number of permutations?

The number of combinations with limited repetition only considers the different ways to select a certain number of items from a larger set, while the number of permutations also takes into account the order in which the items are selected. In other words, combinations do not care about the order, while permutations do.

When would you use the concept of combinations with limited repetition?

This concept is commonly used in situations where you need to select a certain number of items from a larger set, but the order of the items does not matter. This can include things like choosing a team from a pool of players, selecting a combination for a lock, or picking a certain number of items from a menu.

Similar threads

Replies
6
Views
1K
  • Precalculus Mathematics Homework Help
Replies
34
Views
2K
  • Introductory Physics Homework Help
Replies
7
Views
755
Replies
3
Views
254
  • Set Theory, Logic, Probability, Statistics
Replies
12
Views
964
  • Calculus and Beyond Homework Help
Replies
3
Views
981
  • Science Fiction and Fantasy Media
Replies
0
Views
971
  • Math Proof Training and Practice
2
Replies
69
Views
3K
  • General Math
4
Replies
125
Views
16K
Back
Top