Maths Olympiad Prep

Library / /240 of 520

Number theory Difficulty 6.4 National olympiad Find the answer

22. N3 (BUL) IMO2{ }^{\mathrm{IMO} 2} Determine all pairs (a,b)(a, b) of positive integers such that
a22ab2b3+1 \frac{a^{2}}{2 a b^{2}-b^{3}+1}
is a positive integer.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

22. Let aa and bb be positive integers for which a22ab2b3+1=k\frac{a^{2}}{2 a b^{2}-b^{3}+1}=k is a positive integer. Since k>0k>0, it follows that 2ab2b32 a b^{2} \geq b^{3}, so 2ab2 a \geq b. If 2a>b2 a > b, then from 2ab2b3+1>02 a b^{2}-b^{3}+1>0 we see that a2>b2(2ab)+1>b2a^{2}>b^{2}(2 a-b)+1>b^{2}, i.e., a>ba > b. Therefore, if aba \leq b, then a=b/2a = b / 2. We can rewrite the given equation as a quadratic equation in aa, a22kb2a+k(b31)=0a^{2} - 2 k b^{2} a + k(b^{3} - 1) = 0, which has two solutions, say a1a_{1} and a2a_{2}, one of which is in N0\mathbb{N}_{0}. From a1+a2=2kb2a_{1} + a_{2} = 2 k b^{2} and a1a2=k(b31)a_{1} a_{2} = k(b^{3} - 1) it follows that the other solution is also in N0\mathbb{N}_{0}. Suppose w.l.o.g. that a1a2a_{1} \geq a_{2}. Then a1kb2a_{1} \geq k b^{2} and
0a2=k(b31)a1k(b31)kb2<b. 0 \leq a_{2} = \frac{k(b^{3} - 1)}{a_{1}} \leq \frac{k(b^{3} - 1)}{k b^{2}} < b.
By the above considerations we have either a2=0a_{2} = 0 or a2=b/2a_{2} = b / 2. If a2=0a_{2} = 0, then b31=0b^{3} - 1 = 0 and hence a1=2k,b=1a_{1} = 2 k, b = 1. If a2=b/2a_{2} = b / 2, then b=2tb = 2 t for some tt, and k=b2/4,a1=b4/2b/2k = b^{2} / 4, a_{1} = b^{4} / 2 - b / 2. Therefore the only solutions are
(a,b){(2t,1),(t,2t),(8t4t,2t)tN} (a, b) \in \left\{(2 t, 1), (t, 2 t), \left(8 t^{4} - t, 2 t\right) \mid t \in \mathbb{N}\right\}
It is easy to show that all of these pairs satisfy the given condition.

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.