Maths Olympiad Prep

Track / Stage 2 / 197 of 240 #437 of 2444

Problem 437

Number theory Difficulty 2.7 Multiple choice CEMC Pascal · Canada · 2012

When the three-digit positive integer NN is divided by 10, 11 or 12, the remainder is 7. What is the sum of the digits of NN?

Pick one

Next problem →

Official solution

Solution 1

When NN is divided by 10, 11 or 12, the remainder is 7.

This means that M=N7M=N-7 is divisible by each of 10, 11 and 12.

Since MM is divisible by each of 10, 11 and 12, then MM is divisible by the least common multiple of 10, 11 and 12.

Since 10=2×510 = 2\times 5, 12=2×2×312 = 2\times 2 \times 3, and 1111 is prime, then the least common multiple of 10, 11 and 12 is 2×2×3×5×11=6602 \times 2 \times 3 \times 5 \times 11 = 660. (To find the least common multiple, we compute the product of the highest powers of each of the prime factors that occur in the given numbers.)

Since MM is divisible by 660 and N=M+7N=M+7 is a three-digit positive integer, then MM must equal 660. (The next largest multiple of 660 is 1320.)

Therefore, N=M+7=667N=M+7=667, and so the sum of the digits of NN is 6+6+7=196+6+7=19.

Solution 2

When NN is divided by 10, 11 or 12, the remainder is 7.

This means that M=N7M=N-7 is divisible by each of 10, 11 and 12.

Since MM is divisible by each of 10 and 11, then MM must be divisible by 110.

We test the first few multiples of 110 until we obtain one that is divisible by 12.

The integers 110, 220, 330, 440, and 550 are not divisible by 12, but 660 is.

Therefore, MM could be 660. (This means that MM must be 660.)

Finally, N=M+7=667N = M+7=667, and so the sum of the digits of NN is 6+6+7=196+6+7=19.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.