Maths Olympiad Prep

Library / Mongolian National Mathematical Olympiad /16 of 31

Mongolian National Mathematical Olympiad

Algebra Difficulty 5.7 AIME, harder Prove it Mongolia

Find all maps f:Z≥1→Z≥1f: \mathbb{Z}_{\ge 1} \to \mathbb{Z}_{\ge 1} such that for any positive integers aa and bb, the number
af(a)2+bf(b)2+3ab(f(a)+f(b)) af(a)^2 + bf(b)^2 + 3ab(f(a) + f(b))
is a perfect cube.

Solution

For any prime pp let us set a=b=pa = b = p. Hence 2pf(p)(f(p)+p)2pf(p)(f(p) + p) is a perfect cube, we have p∣f(p)p \mid f(p). Let f(p)=kpf(p) = kp, k∈Z≥1k \in \mathbb{Z}_{\ge 1}. Setting a=pa = p, b=1,2b = 1, 2 we get that
pf(p)2+f(1)2+3p(f(p)+f(1))=m3pf(p)2+2f(2)2+6p(f(p)+f(2))=n3. \begin{aligned} pf(p)^2 + f(1)^2 + 3p(f(p) + f(1)) &= m^3 \\ pf(p)^2 + 2f(2)^2 + 6p(f(p) + f(2)) &= n^3. \end{aligned}
Hence m,n>k23pm, n > \sqrt[3]{k^2}p and
3k23p(k23p−1)+1<n3−m3=3kp2+3p(2f(2)−f(1))+2f(2)2−f(1)2. 3\sqrt[3]{k^2}p(\sqrt[3]{k^2}p - 1) + 1 < n^3 - m^3 = 3kp^2 + 3p(2f(2) - f(1)) + 2f(2)^2 - f(1)^2.
From this inequality we conclude that if pp is sufficiently big then k=1k = 1.
Now for any positive integer cc and for a sufficiently big prime pp, we set a=ca = c and b=pb = p. This yields that
(c+p−1)3<cf(c)2+p3+3cp(f(c)+p)<(c+p+1)3. (c + p - 1)^3 < cf(c)^2 + p^3 + 3cp(f(c) + p) < (c + p + 1)^3.
and therefore cf(c)2+p3+3cp(f(c)+p)=(c+p)3cf(c)^2 + p^3 + 3cp(f(c) + p) = (c + p)^3. Hence f(c)=cf(c) = c. Thus ff is the identity map.

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.