Maths Olympiad Prep

Library / /1 of 5

Number theory Difficulty 5.6 AIME, harder Prove it South Africa

Find the smallest and largest integers with decimal representation of the form ababaababa (a0a \neq 0) that are divisible by 11.

Solution

The number N=ababaN = \underline{ababa} is divisible by 11 if and only if ab+ab+a=3a2ba-b+a-b+a = 3a-2b is divisible by 11. To find the smallest possible NN with this property, we observe that a=1a=1 (the smallest possible value for aa) and b=7b=7 offer a solution: 3127=113 \cdot 1 - 2 \cdot 7 = -11 is divisible by 11 (and no smaller b{0,1,,9}b \in \{0, 1, \dots, 9\} works). So N=17171N = 17171 is the smallest number of the required form that is divisible by 11. Similarly, the largest possible value for aa is a=9a=9, and we do have a solution in this case, with b=8b=8: 3928=113 \cdot 9 - 2 \cdot 8 = 11 is divisible by 11 (and no larger b{0,1,,9}b \in \{0, 1, \dots, 9\} works). So N=98989N = 98989 is the largest number of the required form that is divisible by 11.

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.