Olympiad Maths Prep

Library / /2 of 10

Algebra Difficulty 5.3 AIME, harder Prove it Czech Republic

Let a,ba, b be real numbers such that a+b>2a+b > 2. Prove that the system of inequalities
(a1)x+b<x2<ax+(b1) (a-1)x + b < x^2 < ax + (b-1)
has infinitely many real solutions xx.

Solution

We rewrite the system as
F(x)>0G(x)<0, F(x) > 0 \land G(x) < 0,
where F(x)=x2(a1)xbF(x) = x^2-(a-1)x-b and G(x)=x2axb+1G(x) = x^2-ax-b+1. Observe that F(x)G(x)=x1F(x)-G(x) = x-1.
The condition a+b>2a+b>2 implies that
F(1)=G(1)=2ab<0, F(1) = G(1) = 2 - a - b < 0,
hence x=1x=1 is not a solution. However, G(1)<0G(1) < 0 implies that the quadratic equation G(x)=0G(x) = 0 has a root x0>1x_0 > 1. Then
F(x0)=F(x0)0=F(x0)G(x0)=x01>0. F(x_0) = F(x_0) - 0 = F(x_0) - G(x_0) = x_0 - 1 > 0.
From F(1)<0F(1) < 0 and F(x0)>0F(x_0) > 0 we deduce that there exists a root x1x_1 of F(x)=0F(x) = 0 that belongs to the open interval (1,x0)(1, x_0). Since
F(1)<0F(x1)=0,andG(1)<0G(x0)=0, F(1) < 0 \land F(x_1) = 0, \quad \text{and} \quad G(1) < 0 \land G(x_0) = 0,
any x(x1,x0)x \in (x_1, x_0) is a solution to the original system.

Looking for a route rather than 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.