Maths Olympiad Prep

Library / /14 of 19

Algebra Difficulty 6.3 National Olympiad Prove it New Zealand

Problem:

Determine the least real number LL such that
1a+ab+bc+cdL \frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} \leqslant L
for all quadruples (a,b,c,d)(a, b, c, d) of integers satisfying 1<a<b<c<d1 < a < b < c < d.

Solution

Solution:

Answer: 33. To solve this problem, two parts are required. Part A shows that L=3L = 3 works. Part B shows that no L<3L' < 3 works.

Part A

We show that for all quadruples (a,b,c,d)(a, b, c, d) (with 1<a<b<c<d1 < a < b < c < d) we have
1a+ab+bc+cd3. \frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} \leqslant 3.
We do this by considering the two cases b=a+1b = a + 1 and ba+2b \geq a + 2 separately.

If ba+2b \geq a + 2 then we can get
1a+ab+bc+cd1a+aa+2+bc+cd \frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} \leqslant \frac{1}{a} + \frac{a}{a + 2} + \frac{b}{c} + \frac{c}{d}
<1a+aa+2+1+1 \qquad < \frac{1}{a} + \frac{a}{a + 2} + 1 + 1
=2aa(a+2)+33 \qquad = \frac{2 - a}{a(a + 2)} + 3 \leqslant 3
The numerator (2a)(2 - a) is non-positive because 1<a1 < a and aa is an integer.

If b=a+1b = a + 1 then we can get
1a+ab+bc+cd=1a+aa+1+a+1c+cd \frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} = \frac{1}{a} + \frac{a}{a + 1} + \frac{a + 1}{c} + \frac{c}{d}
<1a+aa+1+a+1c+1 \qquad < \frac{1}{a} + \frac{a}{a + 1} + \frac{a + 1}{c} + 1
1a+aa+1+a+1a+2+1 \qquad \leqslant \frac{1}{a} + \frac{a}{a + 1} + \frac{a + 1}{a + 2} + 1
=2a2a(a+1)(a+2)+3<3. \qquad = \frac{2 - a^2}{a(a + 1)(a + 2)} + 3 < 3.
The numerator (2a2)(2 - a^2) is negative because 1<a1 < a and aa is an integer.

In either case we get 1a+ab+bc+cd3\frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} \leqslant 3 for all quadruples (a,b,c,d)(a, b, c, d).

Part B

For the sake of contradiction, suppose there existed some L<3L' < 3 which worked. We will show that there exists a quadruple (a,b,c,d)(a, b, c, d) such that
1a+ab+bc+cd>L. \frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} > L'.
We will do this explicitly by choosing a,b,c,da, b, c, d to be large consecutive integers. If L=3ϵL' = 3 - \epsilon then we have ϵ>0\epsilon > 0, and so there exists some integer nn such that n>3ϵn > \frac{3}{\epsilon}. This ensures 1n+1\frac{1}{n + 1}, 1n+2\frac{1}{n + 2} and 1n+3\frac{1}{n + 3} are each smaller than ϵ3\frac{\epsilon}{3}.

Now consider (a,b,c,d)=(n,n+1,n+2,n+3)(a, b, c, d) = (n, n + 1, n + 2, n + 3).
1a+ab+bc+cd>ab+bc+cd \frac{1}{a} + \frac{a}{b} + \frac{b}{c} + \frac{c}{d} > \frac{a}{b} + \frac{b}{c} + \frac{c}{d}
=nn+1+n+1n+2+n+2n+3 \qquad = \frac{n}{n + 1} + \frac{n + 1}{n + 2} + \frac{n + 2}{n + 3}
=3(1n+1+1n+2+1n+3) \qquad = 3 - \left(\frac{1}{n + 1} + \frac{1}{n + 2} + \frac{1}{n + 3}\right)
>3(ϵ3+ϵ3+ϵ3) \qquad > 3 - \left(\frac{\epsilon}{3} + \frac{\epsilon}{3} + \frac{\epsilon}{3}\right)
=L \qquad = L'
Contradiction.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.