Maths Olympiad Prep

Library / Spring Mathematical Tournament /7 of 13

Spring Mathematical Tournament

Number theory Difficulty 5.6 AIME, harder Prove it Bulgaria

Let k>5k > 5 be an integer. Replace given positive integer by the product of the sum of its digits in base kk and (k−1)2(k-1)^2. Repeat the same with the new number, etc. Prove that the obtained numbers are equal from some point onwards.

Solution

Since the sum of digits of an integer divisible by k−1k-1, is divisible by k−1k-1, too, (k−1)3(k-1)^3 divides all the numbers obtained after the second step. (k−1)3(k-1)^3. On the other hand, if a=anan−1…a0(k)‾a = \overline{a_n a_{n-1} \dots a_0(k)}, n≥4n \ge 4 or a3≥2a_3 \ge 2, n=3n = 3, then

a−(k−1)2(an+an−1+⋯+a0)≥2(k3−(k−1)2)−a1((k−1)2−k)−a0((k−1)2−1))≥2(k3−(k−1)2)−(k−1)(2(k−1)2−k−1)=5k2−2k−1>0. \begin{align*} a - (k-1)^2 (a_n + a_{n-1} + \dots + a_0) &\ge 2(k^3 - (k-1)^2) - a_1((k-1)^2-k) - a_0((k-1)^2-1)) \\ &\ge 2(k^3 - (k-1)^2) - (k-1)(2(k-1)^2 - k - 1) = 5k^2 - 2k - 1 > 0. \end{align*}
This shows that we shall get a number of the form a=a3a2a1a0(k)‾a = \overline{a_3 a_2 a_1 a_0(k)}, where a3=0,1a_3 = 0, 1. The next number is
(k−1)2(a3+a2+a1+a0)≤(k−1)2(1+3(k−1))<4(k−1)3. (k-1)^2(a_3 + a_2 + a_1 + a_0) \le (k-1)^2(1 + 3(k-1)) < 4(k-1)^3.

Hence this number is (k−1)3(k-1)^3, 2(k−1)32(k-1)^3 or 3(k−1)33(k-1)^3. Note that
(k−1)3=k−3,2,k−1‾(k)→2(k−1)3,k>2, (k-1)^3 = \overline{k-3,2,k-1}_{(k)} \rightarrow 2(k-1)^3, \quad k > 2,
2(k−1)3=1,k−6,5,k−2‾(k)→2(k−1)3,k>5, 2(k-1)^3 = \overline{1,k-6,5,k-2}_{(k)} \rightarrow 2(k-1)^3, \quad k > 5,
3(k−1)3=2,k−9,8,k−3‾(k)→2(k−1)3,k>8. 3(k-1)^3 = \overline{2,k-9,8,k-3}_{(k)} \rightarrow 2(k-1)^3, \quad k > 8.
Since 3.53=1423‾(6)→10.52=2.533.5^3 = \overline{1423}_{(6)} \rightarrow 10.5^2 = 2.5^3, 3.63=1614‾(7)→12.62=2.633.6^3 = \overline{1614}_{(7)} \rightarrow 12.6^2 = 2.6^3 and 3.73=2005‾(8)→7.72=73→2.733.7^3 = \overline{2005}_{(8)} \rightarrow 7.7^2 = 7^3 \rightarrow 2.7^3, we conclude that if k>5k > 5, then the numbers are equal to 2(k−1)32(k-1)^3 from some point onwards.

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.