For all positive integers n and m prove the inequality ∣nn2+1−m∣≥2−1.
Solution
Let M(n,m)=∣nn2+1−m∣. Using an obvious chain of inequalities n2<nn2+1<n2+21, we obtain n2−m<nn2+1−m<n2−m+21. Therefore, if m=n2 then M(n,m)>1/2. Since 1/2>2−1, the required inequality is proved for all m=n2.
Let m=n2. Consider the function f(n)=M(n,n2)=nn2+1−n2. We will show that it increases at n>0. Indeed, for all a>b>0 the difference f(a)−f(b) can be transformed: (aa2+1−a2)−(bb2+1−b2)=(aa2+1−bb2+1)−(a2−b2)==aa2+1+bb2+1a2(a2+1)−b2(b2+1)−(a2−b2)=(a2−b2)(aa2+1+bb2+1a2+b2+1−1).(1) As mentioned above, a2+21>aa2+1 and b2+21>bb2+1. Summing these inequalities and substituting to (1) we obtain that f(a)−f(b)>0. Therefore, the minimum of the function f(n) is achieved at n=1 and equals 2−1.
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.