Maths Olympiad Prep

Library / CIS /14 of 19

CIS

Number theory Difficulty 5.9 AIME, harder Prove it Soviet Union

Problem:
Find all integers k>1k > 1 such that for some distinct positive integers aa, bb, the number ka+1k^{a} + 1 can be obtained from kb+1k^{b} + 1 by reversing the order of its (decimal) digits.

Solution

Solution:
k=3k = 3, 33+1=283^{3} + 1 = 28, 34+1=823^{4} + 1 = 82.

k=10k = 10 does not work because ka+1k^{a} + 1 is a palindrome. If k>10k > 10, then for a<ba < b we have kb+1≥ka+1+1≥11ka+1≥10(ka+1)+ka−9>10(ka+1)k^{b} + 1 \geq k^{a + 1} + 1 \geq 11k^{a} + 1 \geq 10(k^{a} + 1) + k^{a} - 9 > 10(k^{a} + 1). So kb+1k^{b} + 1 has more digits than ka+1k^{a} + 1. So we only need to consider k=2,3,…,9k = 2, 3, \ldots, 9.

WLOG a<ba < b. Suppose 2a<b2a < b. Then kb+1>kaka+1>ka(ka+1)k^{b} + 1 > k^{a}k^{a + 1} > k^{a}(k^{a} + 1), so ka<10k^{a} < 10. But ka+1≥10k^{a} + 1 \geq 10 (or reversing its digits would not change it). Hence ka+1=10k^{a} + 1 = 10, which obviously does not work. Hence 2a≥b2a \geq b. So a≥b−aa \geq b - a. Hence kb+1>kb−1≥kb−ka+kb−a−1=(ka+1)(kb−a−1)k^{b} + 1 > k^{b} - 1 \geq k^{b} - k^{a} + k^{b - a} - 1 = (k^{a} + 1)(k^{b - a} - 1). So kb−a−1<10k^{b - a} - 1 < 10. If kb−a−1=9k^{b - a} - 1 = 9, then kb−a=10k^{b - a} = 10, so k=10k = 10, which we already know does not work. Hence kb−a−1<9k^{b - a} - 1 < 9.

But (kb+1)−(ka+1)=(kb−a−1)ka(k^{b} + 1) - (k^{a} + 1) = (k^{b - a} - 1)k^{a}. This must be divisible by 9, because kb+1k^{b} + 1 and ka+1k^{a} + 1 have the same digit sum and hence are the same mod 9. Hence kak^{a} must be divisible by 9, so kk must be 3, 6 or 9.

If k=6k = 6 or 9, then kb−a−1≥5k^{b - a - 1} \geq 5, so the first digit of ka+1k^{a} + 1 must be 1 or (kb−a−1)(ka+1)(k^{b - a} - 1)(k^{a} + 1) would have more digits than ka+1k^{a} + 1. But that means the last digit of kb+1k^{b} + 1 is 1 and hence the last digit of kbk^{b} is 0, which is impossible. So k=3k = 3. It is easy to check that there is a solution for k=3k = 3.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.