Maths Olympiad Prep

Library / /16 of 24

Algebra Difficulty 5.1 AIME, harder Prove it United States

Problem:
The polynomial ax2bx+ca x^{2}-b x+c has two distinct roots pp and qq, with aa, bb, and cc positive integers and with 0<p,q<10<p, q<1. Find the minimum possible value of aa.

Solution

Solution:
Let xx and yy be the roots. Then:

ba=x+y<2b<2aca=xy<1c<aa>1b2>4ac>4c2b>2c \begin{gathered} \frac{b}{a}=x+y<2 \Rightarrow b<2a \\ \frac{c}{a}=x y<1 \Rightarrow c<a \Rightarrow a>1 \\ b^{2}>4 a c>4 c^{2} \Rightarrow b>2c \end{gathered}

Evaluated at 11, the polynomial must be greater than 00, so a+c>ba+c>b. Then:

2c<b<a+c2c+1ba+c1ac+23 \begin{gathered} 2c < b < a+c \\ 2c+1 \leq b \leq a+c-1 \\ a \geq c+2 \geq 3 \end{gathered}

If a=3a=3, then c=1c=1 and b=3b=3, by the above bounds, but this polynomial has complex roots. Similarly, if a=4a=4, then c=1c=1 and bb is forced to be either 33 or 44, again giving either 00 or 11 distinct real roots. So a5a \geq 5. But the polynomial 5x25x+15 x^{2}-5 x+1 satisfies the condition, so 55 is the answer.

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.