
doi: 10.1119/1.1942015
In a recent paper, McLachlan and Chamberlain have proposed and solved the following problem: To find the number W(n,m,M) of ways of distributing m indistinguishable objects into n boxes with no more than M in each box. We present in this paper two additional methods for solving this problem and give solutions to four problems proposed but not solved by McLachlan and Chamberlain.
combinatorics
combinatorics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
