Maths Olympiad Prep

Library / /47 of 61

Number theory Difficulty 6.9 National olympiad Prove it Belarus

Consider the expression M(n,m)=nn2+abmM(n, m) = |n\sqrt{n^2 + a} - bm|, where nn and mm are arbitrary positive integers and the numbers aa and bb are fixed, moreover aa is an odd positive integer, and bb is a rational number with an odd denominator of its representation as an irreducible fraction.
Prove that there is

a) no more than a finite number of pairs (n,m)(n, m) for which M(n,m)=0M(n, m) = 0;

b) a positive constant CC such that the inequality M(n,m)CM(n, m) \ge C holds for all pairs (n,m)(n, m) with M(n,m)0M(n, m) \ne 0.

Solution

a) The solution of part a) is almost obvious and its statement holds for any bQb \in \mathbb{Q} and aNa \in \mathbb{N}. Indeed, if nn2+a=bmn\sqrt{n^2+a} = bm, then, since bQb \in \mathbb{Q}, the number n2+a\sqrt{n^2+a} must be rational and therefore integer. Hence n2+a=k2n^2+a = k^2 for some positive integer kk. But the differences between consecutive perfect squares infinitely increase, there is only finite number of pairs (n,k)(n, k) of positive integers nn and kk such that for the given number aa holds n2k2=an^2 - k^2 = a.

b) Let b=p/qb = p/q be the irreducible fraction representation of bb, according to conditions of the problem aa and qq are odd. Denote by InI_n the set of all positive integers from interval [qn2,qn2+aq/2][qn^2, qn^2 + aq/2]. Since aa and qq are odd, In={qn2+i:i=0,(aq1)/2}I_n = \{qn^2 + i : i = 0, (aq - 1)/2\}. Consider another set P={(n,m):nN,pmIn}P = \{(n, m) : n \in \mathbb{N}, pm \in I_n\}. Substituting b=p/qb = p/q to the expression of M(n,m)M(n, m), we get M(n,m)=q1qnn2+apmM(n, m) = q^{-1}|qn\sqrt{n^2+a} - pm|.
From the obvious chain of inequalities
n2<nn2+a<n2+a/2() n^2 < n\sqrt{n^2+a} < n^2 + a/2 \quad (*)
it follows that qn2<qnn2+a<qn2+(aq)/2qn^2 < qn\sqrt{n^2+a} < qn^2 + (aq)/2. Therefore, if positive integer mpmp doesn't belong to InI_n, then M(n,m)q1(1{aq/2})=1/(2q)M(n, m) \ge q^{-1}(1 - \{aq/2\}) = 1/(2q) (where {}\{\cdot\} denotes the fractional part, and since aqaq is odd, {aq/2}=1/2\{aq/2\} = 1/2). Hence
inf{M(n,m):(n,m)P}1/(2q),() \inf\{M(n, m) : (n, m) \notin P\} \ge 1/(2q), \quad (**)
and the zeroes of the function M(n,m)M(n, m) are contained in PP.
Let us find the lower bound of M(n,m)M(n, m) for (n,m)P(n, m) \in P for all nn large enough. If (n,m)P(n, m) \in P, then pm=qn2+ipm = qn^2 + i, where i{0,1,,(aq1)/2}i \in \{0, 1, \dots, (aq - 1)/2\}. For such nn and mm we get
M(n,m)=q1qnn2+aqn2i=(q2a2qi)n2i2q(qnn2+a+qn2+i). M(n, m) = q^{-1} \left| qn\sqrt{n^2+a} - qn^2 - i \right| = \frac{(q^2a - 2qi)n^2 - i^2}{q(qn\sqrt{n^2+a} + qn^2 + i)}.
The resulting fraction has the least numerator and the largest denominator if ii is maximal, i. e. i=(aq1)/2i = (aq - 1)/2. Substituting this value of ii and taking into account the right inequality of ()(*), we obtain that
M(n,m)n2(aq1)2/42q2n2+aq2q/212q2asn, M(n, m) \ge \frac{n^2 - (aq - 1)^2/4}{2q^2n^2 + aq^2 - q/2} \to \frac{1}{2q^2} \quad \text{as} \quad n \to \infty,
so, there exists an n0n_0 such that M(n,m)>1/(4q2)M(n, m) > 1/(4q^2) for all (n,m)P(n, m) \in P with nn0n \ge n_0. In particular, because if ()(**) holds then this means that the zeroes of M(n,m)M(n, m) belong to the finite set P0={(n,m)P:nn0}P_0 = \{(n, m) \in P : n \ge n_0\}. Therefore M((n,m))M((n, m)) has the finite number of zeroes. Choose the minimal nonzero value of M(n,m)M(n, m) on the set P0P_0 (say C0C_0). Then we can take C=min{C0,1/(4q2)}C = \min\{C_0, 1/(4q^2)\} as the required constant. The statement of part b) is proved.

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: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.