AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

1983 AIME Problems/Problem 10

From AoPSWiki

Revision as of 21:42, 1 March 2009 by Eshen (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

The numbers 1447, 1005, and 1231 have something in common. Each is a four-digit number beginning with 1 that has exactly two identical digits. How many such numbers are there?

Solution

Suppose the two identical digits are both one. Since the thousands digits must be one, the other one can be in only one of three digits,

11xy,\qquad 1x1y,\qquad1xy1.

Because the number must have exactly two identical digits, x\neq y, x\neq1, and y\neq1. Hence, there are 3\cdot9\cdot8=216 numbers of this form.

Suppose the two identical digits are not one. Therefore, consider the following possibilities,

1xxy,\qquad1xyx,\qquad1yxx.

Again, x\neq y, x\neq 1, and y\neq 1. There are 3\cdot9\cdot8=216 numbers of this form as well.

Thus, the desired answer is 216+216=432.

See also

1983 AIME (ProblemsResources)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us