AMC 10 Step by Step

2003 AMC 10A Problem 25

P21-25~4 minPrint

Let nn be a 55 -digit number, and let qq and rr be the quotient and the remainder, respectively, when nn is divided by 100100 . For how many values of nn is q+rq+r divisible by 1111 ?

Log in to save your progress.
Show solution without answering

Key insight

Write n as 99 times q plus the sum q + r. Since 11 divides 99, q + r is a multiple of 11 exactly when n is.

Solution

First see what qq and rr are with an example, then find a link between q+rq + r and nn.

1. Example. Take n=12345n = 12345. Dividing by 100100 gives quotient q=123q = 123 and remainder r=45r = 45. So qq is the first three digits and rr is the last two, and n=100×123+45n = 100 \times 123 + 45. In general,
n=100q+r.n = 100q + r.
2. Split off q+rq + r. Write 100q100q as 99q+q99q + q:
n=99q+(q+r).n = 99q + (q + r).
3. Use that 99=9×1199 = 9 \times 11. The part 99q99q is always a multiple of 1111. So nn and q+rq + r differ by a multiple of 1111. That means: q+rq + r is a multiple of 1111 if and only if nn is a multiple of 1111.
(Check with the example: q+r=168q + r = 168, and 12345−168=12177=99×12312345 - 168 = 12177 = 99 \times 123.)
4. So count the five-digit multiples of 1111.
- Smallest: 11×909=999911 \times 909 = 9999 has only four digits, so the first one is 11×910=1001011 \times 910 = 10010.
- Largest: 11×9090=9999011 \times 9090 = 99990, and 11×9091=10000111 \times 9091 = 100001 has six digits.
- The multipliers run from 910910 to 90909090. That is
9090−910+1=81819090 - 910 + 1 = 8181
numbers. (The +1+1 counts the starting number: from 11 to 55 there are 5−1+1=55 - 1 + 1 = 5 numbers.)

The answer is (B) 8181\boxed{\textbf{(B)}\ 8181}.

Why this works

Splitting a number into a front part and a back part, 100q+r100q + r, and noticing that 100100 is just 11 more than a multiple of 1111 makes the front and back combine into q+rq + r with nothing left over except a multiple of 1111. Whenever a problem mixes the front and back pieces of a number, check how the place value (1010, 100100, 10001000) sits next to the divisor. Then count carefully, remembering the +1+1 when counting from one number up to another.

Alternative approach

Count the multiples of 1111 in a different way: from 11 to 9999999999 there are 90909090 of them (since 99999÷11=9090.8…99999 \div 11 = 9090.8\ldots), and from 11 to 99999999 there are 909909 (since 9999=11×9099999 = 11 \times 909). The five-digit ones are the difference, 9090−909=81819090 - 909 = 8181.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

By definition n=100q+rn = 100q + r. Rewrite this as
n=99q+(q+r).n = 99q + (q + r).
Because 99=9⋅1199 = 9 \cdot 11, the term 99q99q is a multiple of 1111, so nn and q+rq + r leave the same remainder when divided by 1111. Hence 11∣q+r11 \mid q + r exactly when 11∣n11 \mid n.

So we count five-digit multiples of 1111. The smallest is 11⋅910=1001011 \cdot 910 = 10010 (since 11⋅909=999911 \cdot 909 = 9999 is too small) and the largest is 11⋅9090=9999011 \cdot 9090 = 99990. The multipliers run from 910910 to 90909090, giving
9090−910+1=81819090 - 910 + 1 = 8181
values of nn.

The answer is (B) 8181\boxed{\textbf{(B)}\ 8181}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.