Skip to main content

2003 AMC 12A Problem 18

Problem 18 of 25IntermediateNumber Theory

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

Answer choices

Show solution

Solution

Since n=100q+r=(q+r)+99qn=100q+r=(q+r)+99q and 9999 is divisible by 11,11, we have q+rn(mod11).q+r\equiv n\pmod{11}. So (q+r)(q+r) is a multiple of 1111 exactly when nn is a multiple of 11.11. Among the 55-digit numbers, the count of multiples of 1111 is 9999911\left\lfloor\dfrac{99999}{11}\right\rfloor 999911-\left\lfloor\dfrac{9999}{11}\right\rfloor =9090909=8181.=9090-909=8181. Thus, the correct answer is B.

More practice

Concepts: modular arithmetic · multiple

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.