Number theoryDifficulty 7.1National olympiad, round 2Prove it
(a) Prove that for every positive integer n, there exists a fraction ba where a and b are integers satisfying 0<b⩽n+1 and n⩽ba⩽n+1.
(b) Prove that there are infinitely many positive integers n such that there is no fraction ba where a and b are integers satisfying 0<b⩽n and n⩽ba⩽n+1.
Solution
(a) Let r be the unique positive integer for which r2≤n<(r+1)2. Write n=r2+s. Then we have 0≤s≤2r. We discuss in two cases according to the parity of s.
- Case 1. s is even. Consider the number (r+2rs)2=r2+s+(2rs)2. We find that n=r2+s≤r2+s+(2rs)2≤r2+s+1=n+1 It follows that n≤r+2rs≤n+1 Since s is even, we can choose the fraction r+2rs=rr2+(s/2) since r≤n.
- Case 2. s is odd. Consider the number (r+1−2(r+1)2r+1−s)2=(r+1)2−(2r+1−s)+(2(r+1)2r+1−s)2. We find that n=r2+s=(r+1)2−(2r+1−s)≤(r+1)2−(2r+1−s)+(2(r+1)2r+1−s)2≤(r+1)2−(2r+1−s)+1=n+1 It follows that n≤r+1−2(r+1)2r+1−s≤n+1 Since s is odd, we can choose the fraction (r+1)−2(r+1)2r+1−s=r+1(r+1)2−r+((s−1)/2) since r+1≤n+1.
(b) We show that for every positive integer r, there is no fraction ba with b≤r2+1 such that r2+1≤ba≤r2+2. Suppose on the contrary that such a fraction exists. Since b≤r2+1<r+1 and b is an integer, we have b≤r. Hence, (br)2<b2(r2+1)≤a2≤b2(r2+2)≤b2r2+2br<(br+1)2 This shows the square number a2 is strictly bounded between the two consecutive squares (br)2 and (br+1)2, which is impossible. Hence, we have found infinitely many n=r2+1 for which there is no fraction of the desired form.
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.