Originally Posted by

**Wolfy1984** "How many license plates containing seven characters can be created from letters and numbers if the first two characters must be uppercase letters and the last five characters must be digits from 0 to 9? Repetition of numbers is allowed. Repetition of letters is not allowed".

Here's my solution.

1) I assumed a universal set for the license plate as U = {uppercase letter, uppercase letter, number, number, number, number, number}.

2) For the first two characters I assumed a sample set A ={A,B,C...Z}, for the last five characters there's the sample set B = {0,1,2,3...9}.

3) Considering the repetition of letters is not allowed and that the order matters in set U, I determined 650 possible permutations in set A, following the formula n!/(n-r)!, which comes down to 26!/(26-2)! = 650 permutations. So set A has 650 possible permutations.

4) Considering the repetitions of numbers is allowed and that the order in set U matters, I determined 100.000 possible permutations in set B, following the formula n^r, which comes down to 10^5 = 100.000 permutations. So set B has 100.000 possible permutations.

5) Now set A and B are __added__ together, giving what I think are 100.650 possible license plates.