Number theoryDifficulty 6.9National olympiadProve itBelarus
Consider the expression M(n,m)=∣nn2+a−bm∣, where n and m are arbitrary positive integers and the numbers a and b are fixed, moreover a is an odd positive integer, and b 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) for which M(n,m)=0;
b) a positive constant C such that the inequality M(n,m)≥C holds for all pairs (n,m) with M(n,m)=0.
Solution
a) The solution of part a) is almost obvious and its statement holds for any b∈Q and a∈N. Indeed, if nn2+a=bm, then, since b∈Q, the number n2+a must be rational and therefore integer. Hence n2+a=k2 for some positive integer k. But the differences between consecutive perfect squares infinitely increase, there is only finite number of pairs (n,k) of positive integers n and k such that for the given number a holds n2−k2=a.
b) Let b=p/q be the irreducible fraction representation of b, according to conditions of the problem a and q are odd. Denote by In the set of all positive integers from interval [qn2,qn2+aq/2]. Since a and q are odd, In={qn2+i:i=0,(aq−1)/2}. Consider another set P={(n,m):n∈N,pm∈In}. Substituting b=p/q to the expression of M(n,m), we get M(n,m)=q−1∣qnn2+a−pm∣. From the obvious chain of inequalities n2<nn2+a<n2+a/2(∗) it follows that qn2<qnn2+a<qn2+(aq)/2. Therefore, if positive integer mp doesn't belong to In, then M(n,m)≥q−1(1−{aq/2})=1/(2q) (where {⋅} denotes the fractional part, and since aq is odd, {aq/2}=1/2). Hence inf{M(n,m):(n,m)∈/P}≥1/(2q),(∗∗) and the zeroes of the function M(n,m) are contained in P. Let us find the lower bound of M(n,m) for (n,m)∈P for all n large enough. If (n,m)∈P, then pm=qn2+i, where i∈{0,1,…,(aq−1)/2}. For such n and m we get M(n,m)=q−1qnn2+a−qn2−i=q(qnn2+a+qn2+i)(q2a−2qi)n2−i2. The resulting fraction has the least numerator and the largest denominator if i is maximal, i. e. i=(aq−1)/2. Substituting this value of i and taking into account the right inequality of (∗), we obtain that M(n,m)≥2q2n2+aq2−q/2n2−(aq−1)2/4→2q21asn→∞, so, there exists an n0 such that M(n,m)>1/(4q2) for all (n,m)∈P with n≥n0. In particular, because if (∗∗) holds then this means that the zeroes of M(n,m) belong to the finite set P0={(n,m)∈P:n≥n0}. Therefore M((n,m)) has the finite number of zeroes. Choose the minimal nonzero value of M(n,m) on the set P0 (say C0). Then we can take C=min{C0,1/(4q2)} 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.