Maths Olympiad Prep

Track / Stage 3 / 192 of 260 #192 of 1964

Problem 192

AMC 10/12, early questions
Number theory Difficulty 3.7 Find the answer

Let NN be the greatest integer multiple of 3636 all of whose digits are even and no two of whose digits are the same. Find the remainder when NN is divided by 10001000.

A number or a short expression. Spacing, $ signs and \frac vs / are all fine.

Official solution

If an integer is divisible by 3636, it must also be divisible by 99 since 99 is a factor of 3636. It is a well-known fact that, if NN is divisible by 99, the sum of the digits of NN is a multiple of 99. Hence, if NN contains all the even digits, the sum of the digits would be 0+2+4+6+8=200 + 2 + 4 + 6 + 8 = 20, which is not divisible by 99 and thus 3636.
The next logical try would be 86408640, which happens to be divisible by 3636. Thus, N=8640640(mod1000)N = 8640 \equiv \boxed{640} \pmod {1000}.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.