Maths Olympiad Prep

Library / Belarusian Mathematical Olympiad /36 of 208

Belarusian Mathematical Olympiad

Number theory Difficulty 5.3 AIME, harder Prove it Belarus

Find the smallest positive integer nn such that the number 2013n2013n can be presented as the difference of two cubes of positive integer numbers.

Solutions — 2

Solution 1

Answer: n=39n = 39.
(Solution of A. Semchankau, A. Zhuk.) Let
2013n=a3−b3.(1) 2013n = a^3 - b^3. \qquad (1)
Then
(1)⇔61⋅11⋅3n=2013n=(a−b)3+3ab(a−b)⇒(a−b)⊢3, (1) \Leftrightarrow 61 \cdot 11 \cdot 3n = 2013n = (a-b)^3 + 3ab(a-b) \Rightarrow (a-b) \vdash 3,
i.e. (a−b)=3k,k∈N(a-b) = 3k, k \in \mathbb{N}. So 61⋅11⋅3n=33k3+32abk61 \cdot 11 \cdot 3n = 3^3 k^3 + 3^2 abk, whence n⊢3n \vdash 3, i.e. n=3m,m∈Nn = 3m, m \in \mathbb{N}. Then (1) can be rewritten as
3k3+abk=61⋅11m.(2) 3k^3 + abk = 61 \cdot 11m. \qquad (2)
Note that if k=11,b=10,a=43k = 11, b = 10, a = 43, then m=13m = 13, i.e. n=39n = 39. Show that n=39n = 39 is the smallest possible value of nn, i.e. m=13m = 13 is the smallest possible value of mm. Indeed, from (2) it follows that k(3k2+3kb+b2)⊢11k(3k^2 + 3kb + b^2) \vdash 11, and it is easy to show that k⊢11k \vdash 11. But for k≥22k \ge 22 we have m>13m > 13.

Solution 2

Answer: n=39n=39. (Solution of A. Semchankau, A. Zhuk.) Let
2013n=a3−b3.(1) 2013n = a^3 - b^3. \qquad (1)
Then
(1)⇔61⋅11⋅3n=2013n=(a−b)3+3ab(a−b)⇒(a−b)≥3, (1) \Leftrightarrow 61 \cdot 11 \cdot 3n = 2013n = (a-b)^3 + 3ab(a-b) \Rightarrow (a-b) \ge 3,
i.e. (a−b)=3k,k∈N(a-b) = 3k, k \in \mathbb{N}. So 61⋅11⋅3n=33k3+32abk61 \cdot 11 \cdot 3n = 3^3 k^3 + 3^2 abk, whence n≥3n \ge 3, i.e. n=3m,m∈Nn = 3m, m \in \mathbb{N}. Then (1) can be rewritten as
3k3+abk=61⋅11m.(2) 3k^3 + abk = 61 \cdot 11m. \qquad (2)
Note that if k=11,b=10,a=43k=11, b=10, a=43, then m=13m=13, i.e. n=39n=39. Show that n=39n=39 is the smallest possible value of nn, i.e. m=13m=13 is the smallest possible value of mm. Indeed, from (2) it follows that k(3k2+3kb+b2)≥11k(3k^2+3kb+b^2) \ge 11, and it is easy to show that k≥11k \ge 11. But for k≥22k \ge 22 we have m>13m > 13.

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.