2006 AIME II Problem 7

Below is the professionally curated solution for Problem 7 of the 2006 AIME II, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2006 AIME II solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:digitscomplementary countingcasework

Difficulty rating: 2510

7.

Find the number of ordered pairs of positive integers (a,b)(a, b) such that a+b=1000a + b = 1000 and neither aa nor bb has a zero digit.

Solution:

There are 999999 pairs in all (a=1,,999a = 1, \ldots, 999); count the forbidden ones. If aa has units digit 0,0, so does b,b, and writing a=10r,a = 10r, b=10sb = 10s gives r+s=100r + s = 100 with 1r99:1 \le r \le 99: that is 9999 forbidden pairs.

Now suppose both units digits are nonzero. Then a number in the pair has a zero digit exactly when it is a three-digit number of the form h0uh0u with h,u{1,,9}h, u \in \{1, \ldots, 9\} (a one- or two-digit number with nonzero units digit has no zero digit). If a=h0u,a = h0u, then b=1000a=100(9h)+90+(10u)b = 1000 - a = 100(9 - h) + 90 + (10 - u) has tens digit 9,9, so bb is not also of that form. Hence the forbidden pairs here are those where exactly one of a,ba, b equals h0u:h0u: 81+81=16281 + 81 = 162 pairs.

The total number of forbidden pairs is 99+162=261,99 + 162 = 261, so the answer is 999261=738.999 - 261 = 738.

← Problem 6Full ExamProblem 8

Problem 7 in Other Years