Formula for: If $X$ is a set of $t$ elements,the number of ordered, $k$-element selections from $X$, limitless repetition allowed is

65 Views Asked by At

So I understand that if it said the number of underordered then it would have been $\binom{k+t-1}{t-1}$ or $\binom{k+t-1}{k}$ but the ordered part is throwing me off so I don't know what to write as this formula.

1

There are 1 best solutions below

6
On

HINT: It’s actually much easier to count the ordered $k$-element selections. These are just the ordered $k$-tuples of elements of $X$, i.e., the members of the set $X^k$. If $|X|=t$, what is $\left|X^k\right|$?