Explanation
This is the easiest type of question when it comes to permutation and combination problems.
While we’d be quick to call this a combination question (because we’re familiar with “combination” locks), this is actually a permutation type of question.
Combination refers to problems where the order of things (or digits in this case) is not important.
Permutation refers to problems where the order or position of things is important.
Simply use the formula for permutations when repetition is allowed:
\(P=n^{r}\).
P is the number of permutations possible, n is the number of things to choose from and r is the number of things we choose.
\(P=10^{3}=1,000\)