Maths Olympiad Prep

Library / /426 of 520

Number theory Difficulty 7.4 National olympiad, round 2 Find the answer

A two-digit integer ab\underline{a}\,\, \underline{b} is multiplied by 99. The resulting three-digit integer is of the form acb\underline{a} \,\,\underline{c} \,\,\underline{b} for some digit cc. Evaluate the sum of all possible ab\underline{a} \,\, \underline{b}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

1. Let the two-digit integer be represented as ab \underline{a}\, \underline{b} , where a a and b b are the tens and units digits, respectively. This can be expressed as 10a+b 10a + b .

2. When this number is multiplied by 9, the resulting number is 9(10a+b) 9(10a + b) .

3. According to the problem, the resulting three-digit number is of the form acb \underline{a}\, \underline{c}\, \underline{b} , which can be expressed as 100a+10c+b 100a + 10c + b .

4. Equating the two expressions, we get:
9(10a+b)=100a+10c+b 9(10a + b) = 100a + 10c + b

5. Expanding and simplifying the equation:
90a+9b=100a+10c+b 90a + 9b = 100a + 10c + b
90a+9b100ab=10c 90a + 9b - 100a - b = 10c
10a+8b=10c -10a + 8b = 10c
10c=8b10a 10c = 8b - 10a
c=8b10a10 c = \frac{8b - 10a}{10}
c=4b5a5 c = \frac{4b - 5a}{5}

6. For c c to be a digit (i.e., an integer between 0 and 9), 4b5a 4b - 5a must be divisible by 5. Let 4b5a=5k 4b - 5a = 5k for some integer k k .

7. Solving for b b :
4b=5a+5k 4b = 5a + 5k
b=5a+5k4 b = \frac{5a + 5k}{4}
Since b b must be a digit (0 to 9), 5a+5k 5a + 5k must be divisible by 4.

8. Let’s test possible values of a a (since a a is a digit from 1 to 9):
- For a=1 a = 1 :
5(1)+5k=5+5k 5(1) + 5k = 5 + 5k
5+5k0(mod4) 5 + 5k \equiv 0 \pmod{4}
53(mod4) 5 \equiv -3 \pmod{4}
3+5k0(mod4) -3 + 5k \equiv 0 \pmod{4}
5k3(mod4) 5k \equiv 3 \pmod{4}
k3(mod4) k \equiv 3 \pmod{4}
The smallest k k that satisfies this is k=3 k = 3 :
b=5(1)+5(3)4=5+154=5 b = \frac{5(1) + 5(3)}{4} = \frac{5 + 15}{4} = 5
So, a=1 a = 1 , b=5 b = 5 , and c=4(5)5(1)5=3 c = \frac{4(5) - 5(1)}{5} = 3 .

- For a=2 a = 2 :
5(2)+5k=10+5k 5(2) + 5k = 10 + 5k
10+5k0(mod4) 10 + 5k \equiv 0 \pmod{4}
102(mod4) 10 \equiv 2 \pmod{4}
2+5k0(mod4) 2 + 5k \equiv 0 \pmod{4}
5k2(mod4) 5k \equiv -2 \pmod{4}
k2(mod4) k \equiv 2 \pmod{4}
The smallest k k that satisfies this is k=2 k = 2 :
b=5(2)+5(2)4=10+104=5 b = \frac{5(2) + 5(2)}{4} = \frac{10 + 10}{4} = 5
So, a=2 a = 2 , b=5 b = 5 , and c=4(5)5(2)5=2 c = \frac{4(5) - 5(2)}{5} = 2 .

- For a=3 a = 3 :
5(3)+5k=15+5k 5(3) + 5k = 15 + 5k
15+5k0(mod4) 15 + 5k \equiv 0 \pmod{4}
151(mod4) 15 \equiv -1 \pmod{4}
1+5k0(mod4) -1 + 5k \equiv 0 \pmod{4}
5k1(mod4) 5k \equiv 1 \pmod{4}
k1(mod4) k \equiv 1 \pmod{4}
The smallest k k that satisfies this is k=1 k = 1 :
b=5(3)+5(1)4=15+54=5 b = \frac{5(3) + 5(1)}{4} = \frac{15 + 5}{4} = 5
So, a=3 a = 3 , b=5 b = 5 , and c=4(5)5(3)5=1 c = \frac{4(5) - 5(3)}{5} = 1 .

- For a=4 a = 4 :
5(4)+5k=20+5k 5(4) + 5k = 20 + 5k
20+5k0(mod4) 20 + 5k \equiv 0 \pmod{4}
200(mod4) 20 \equiv 0 \pmod{4}
5k0(mod4) 5k \equiv 0 \pmod{4}
k0(mod4) k \equiv 0 \pmod{4}
The smallest k k that satisfies this is k=0 k = 0 :
b=5(4)+5(0)4=20+04=5 b = \frac{5(4) + 5(0)}{4} = \frac{20 + 0}{4} = 5
So, a=4 a = 4 , b=5 b = 5 , and c=4(5)5(4)5=0 c = \frac{4(5) - 5(4)}{5} = 0 .

9. The possible values of ab \underline{a}\, \underline{b} are 15, 25, 35, and 45.

10. Summing these values:
15+25+35+45=120 15 + 25 + 35 + 45 = 120

The final answer is 120\boxed{120}.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.