Suppose we are given $n$ different objects. I wanted to find the number of unordered $k$-tuples with entries from this set of objects and with repetition allowed for arbitrary $k$. It turns out that it is not that easy and I'm finding it hard to find a closed form formula or at least something in terms of an elementary function. Can someone help me on this one?
Asked
Active
Viewed 309 times
0
-
Welcome to math stackexchange! You'll get a better response if you format your question using MathJax. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to. – platty Nov 30 '18 at 04:51
-
1You'll find an answer here https://math.stackexchange.com/questions/208377/combination-with-repetitions – Viera Čerňanová Nov 30 '18 at 04:57
-
You might be interested in "multisets": https://en.wikipedia.org/wiki/Multiset – awkward Nov 30 '18 at 16:19