Olympiad Maths Prep

Track / Stage 6 / 127 of 400 #1127 of 2000

Problem 1127

National olympiad, first round
Number theory Difficulty 6.2 Prove it

5. (1) Prove: For each positive integer nn, there exists a fraction ab(a,b\frac{a}{b} (a, b are integers )), such that
0<bn+1, and nabn+1 0 < b \leqslant \sqrt{n} + 1 \text{, and } \sqrt{n} \leqslant \frac{a}{b} \leqslant \sqrt{n+1} \text{. }
(2) Prove: There exist infinitely many positive integers nn, such that there does not exist a fraction ab(a,b\frac{a}{b} (a, b are integers )), satisfying
0<bn, and nabn+1 0 < b \leqslant \sqrt{n} \text{, and } \sqrt{n} \leqslant \frac{a}{b} \leqslant \sqrt{n+1} \text{. }

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

5. (1) For each positive integer nn, there exists a unique positive integer rr such that
r2n<(r+1)2. r^{2} \leqslant n < (r+1)^{2} \text{.}

Let n=r2+sn = r^{2} + s. Then 0s2r0 \leqslant s \leqslant 2r.
Depending on the parity of ss, we consider two cases.
(i) ss is even.

Consider the fraction r2+s2r=r+s2r\frac{r^{2} + \frac{s}{2}}{r} = r + \frac{s}{2r}.
Let a=r2+s2,b=ra = r^{2} + \frac{s}{2}, b = r.
Then 0<b=rn0 < b = r \leqslant \sqrt{n}.
By n=r2+s(ab)2=r2+s+(s2r)2n = r^{2} + s \leqslant \left(\frac{a}{b}\right)^{2} = r^{2} + s + \left(\frac{s}{2r}\right)^{2}
r2+s+1=n+1\leqslant r^{2} + s + 1 = n + 1
nabn+1\Rightarrow \sqrt{n} \leqslant \frac{a}{b} \leqslant \sqrt{n+1}.
(ii) ss is odd.

Consider the fraction
(r+1)2r+s12r+1=r+12r+1s2(r+1). \frac{(r+1)^{2} - r + \frac{s-1}{2}}{r+1} = r + 1 - \frac{2r + 1 - s}{2(r+1)} \text{.}

Let a=(r+1)2r+s12,b=r+1a = (r+1)^{2} - r + \frac{s-1}{2}, b = r+1.
Then 0<b=r+1n+10 < b = r+1 \leqslant \sqrt{n} + 1.
By n=r2+s=(r+1)2(2r+1s)n = r^{2} + s = (r+1)^{2} - (2r + 1 - s)
(r+1)2(2r+1s)+(2r+1s2(r+1))2=(ab)2(r+1)2(2r+1s)+1=n+1nabn+1. \begin{array}{l} \leqslant (r+1)^{2} - (2r + 1 - s) + \left(\frac{2r + 1 - s}{2(r+1)}\right)^{2} \\ = \left(\frac{a}{b}\right)^{2} \leqslant (r+1)^{2} - (2r + 1 - s) + 1 \\ = n + 1 \\ \Rightarrow \sqrt{n} \leqslant \frac{a}{b} \leqslant \sqrt{n+1} \text{.} \end{array}
(2) It suffices to prove: For each positive integer rr, there does not exist a fraction ab\frac{a}{b} (where a,ba, b are integers) satisfying br2+1b \leqslant \sqrt{r^{2} + 1}, such that
r2+1abr2+2. \sqrt{r^{2} + 1} \leqslant \frac{a}{b} \leqslant \sqrt{r^{2} + 2} \text{.}

Assume there exists a fraction ab\frac{a}{b} satisfying the above conditions.
By br2+1<r+1br(br)2<b2(r2+1)a2b2(r2+2)b2r2+2br<(br+1)2. \begin{array}{l} \text{By } b \leqslant \sqrt{r^{2} + 1} < r + 1 \Rightarrow b \leqslant r \\ \Rightarrow (br)^{2} < b^{2}(r^{2} + 1) \leqslant a^{2} \leqslant b^{2}(r^{2} + 2) \\ \quad \leqslant b^{2}r^{2} + 2br < (br + 1)^{2} \text{.} \end{array}

The above inequality shows that a2a^{2} lies between two consecutive perfect squares, which is a contradiction.

Therefore, there exist infinitely many positive integers n=r2+1n = r^{2} + 1 such that no fraction satisfying the conditions exists.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.