Hi there..I have scoured my admittedly limited collection of probability
texts, and am stumped to find the answer to the following, so any help is
most appreciated....a colleague just approached me with the following
problem at work: he wants to know the number of possible combinations of
boxes, with repeats being viable.......so, e.g,. if there are 3 boxes then
what he wants to get at is the following answer (i.e, c = 10):
111
222
333
112
221
332
113
223
331
123
...so there are 10 possible combinations (not permutations, since 331 =
133)...however, when I started playing around with various
combinations/factorial equations, I realized that there really isn't a pool
of 3 boxes..there has to be a pool of 9 numbers, in order to arrive at
combinations such as 111 or 333.............so any assistance would be most
appreciated as I can't seem to find an algorithm in any of my
texts..........thank you.........dale glaser
=================================================================
Instructions for joining and leaving this list and remarks about
the problem of INAPPROPRIATE MESSAGES are available at
http://jse.stat.ncsu.edu/
=================================================================
