2006 AMC 10A Problems/Problem 18

From AoPSWiki

Revision as of 20:52, 26 February 2007 by Azjps (Talk | contribs)

(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

A license plate in a certain state consists of 4 digits, not necessarily distinct, and 2 letters, also not necessarily distinct. These six characters may appear in any order, except that the two letters must appear next to each other. How many distinct license plates are possible?

$\mathrm{(A) \ } 10^4\times 26^2\qquad\mathrm{(B) \ } 10^3\times 26^3\qquad\mathrm{(C) \ } 5\times 10^4\times 26^2\qquad\mathr...$

Solution

There are $10\cdot10\cdot10\cdot10 = 10^4$ ways to choose 4 digits.

There are $26 \cdot 26 = 26^2$ ways to choose the 2 letters.

For the letters to be next to each other, they can be the 1st and 2nd, 2nd and 3rd, 3rd and 4th, 4th and 5th, or the 5th and 6th characters. So, there are $6 - 1 = 5$ choices for the position of the letters.

Therefore, the number of distinct license plates is $5\times 10^4\times 26^2 \Longrightarrow \mathrm{C}$ .

2006 AMC 10A (Problems • Resources)
Preceded by Problem 17	Followed by Problem 19
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25

Personal tools

Navigation

Search

Toolbox

2006 AMC 10A Problems/Problem 18

From AoPSWiki

Problem

Solution

See also