Maths Olympiad Prep

Track / Stage 5 / 183 of 400 #1263 of 2444

Problem 1263

AIME late
Number theory Difficulty 5.4 Find the answer HMMT February

Compute the sum of all two-digit positive integers xx such that for all three-digit (base 10) positive integers abc,ifabc\underline{a} \underline{b} \underline{c}, if \underline{a} \underline{b} \underline{c} is a multiple of xx, then the three-digit (base 10) number bca\underline{b} \underline{c} \underline{a} is also a multiple of xx.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Next problem →

Official solution

Note that abc0bca=a(1041)\overline{a b c 0}-\overline{b c a}=a\left(10^{4}-1\right) must also be a multiple of xx. Choosing a=1a=1 means that xx divides 103110^{3}-1, and this is clearly a necessary and sufficient condition. The only two-digit factors of 103110^{3}-1 are 27 and 37, so our answer is 27+37=6427+37=64.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.