Maths Olympiad Prep

Library / /13 of 35

Number theory Difficulty 5.1 AIME, harder Prove it Slovenia

Let aa, bb and cc be non-zero digits. Let pp be a prime number which divides the three-digit numbers abcabc and cbacba. Show that pp divides at least one of the numbers a+b+ca+b+c, ab+ca-b+c and aca-c.

Solution

Since the prime number pp divides the numbers abc=100a+10b+c\overline{abc} = 100a + 10b + c and cba=100c+10b+a\overline{cba} = 100c + 10b + a, it must also divide their difference
abccba=100(ac)+(ca)=99(ac). \overline{abc} - \overline{cba} = 100(a-c) + (c-a) = 99(a-c).
If pp divides aca-c we are done. If not, then pp divides 9999, so p=3p=3 or p=11p=11.

If p=3p=3 then abc\overline{abc} is divisible by 33. A number is divisible by 33 if and only if the sum of its digits is divisible by 33, so 33 divides a+b+ca+b+c. Hence, pp divides a+b+ca+b+c.

If p=11p=11 then 1111 divides
abc=100a+10b+c=99a+11b+ab+c=11(9a+b)+(ab+c), \overline{abc} = 100a + 10b + c = 99a + 11b + a - b + c = 11(9a + b) + (a - b + c),
which implies that ab+ca-b+c is divisible by 1111. In this case pp divides ab+ca-b+c.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.