Olympiad Maths Prep

Library / /20 of 30

Algebra Difficulty 6.6 National olympiad Prove it Belarus

Basil considers all quadratic polynomials y=ax2+bx+cy = ax^2 + bx + c with negative discriminants, where aa, bb, cc are positive integers not greater than 5050. For each polynomial Basil writes its minimal value.
Find the largest and the smallest numbers among the written numbers.

Solution

The distance between the parabola y=ax2+bx+cy = ax^2 + bx + c and the axis of abscissae is equal to
d=4acb24a d = \frac{4ac - b^2}{4a}
Therefore, the problem is equivalent to the following problem: find the greatest and the smallest value of the expression above if positive integers aa, bb, cc satisfy the inequalities 1a501 \le a \le 50, 1b501 \le b \le 50, 1c501 \le c \le 50 and b24ac<0b^2 - 4ac < 0.

We find the greatest value. We have
d=4acb24a=cb24a50b24a5014a501200. d = \frac{4ac - b^2}{4a} = c - \frac{b^2}{4a} \le 50 - \frac{b^2}{4a} \le 50 - \frac{1}{4a} \le 50 - \frac{1}{200}.
The first inequality follows from the inequality c50c \le 50, the second one follows from the inequalities a50a \le 50 and b21b^2 \ge 1. We see that all inequalities become equalities for c=50c = 50, b=1b = 1 and a=50a = 50. Moreover, for these aa, bb, cc the inequality b24ac=1245050<0b^2 - 4ac = 1^2 - 4 \cdot 50 \cdot 50 < 0 is valid, too. Therefore the required greatest value is equal to 501/20050 - 1/200.

Now we find the smallest value. In the fraction above the numerator and the denominator are positive integers. We find the smallest possible value of the numerator. The numerator can be neither 11 nor 22. Indeed, in these cases we have either b2=4ac1b^2 = 4ac - 1 or b2=4ac2b^2 = 4ac - 2, i.e. b2=4(ac1)+3b^2 = 4(ac - 1) + 3 or b2=4(ac1)+2b^2 = 4(ac - 1) + 2. It follows that b2b^2 is congruent to either 22 or 33 modulo 44, which is impossible.

So the smallest value of the numerator is 33, i.e. b2=4ac3b^2 = 4ac - 3. Now our next goal is to determine the greatest possible value of the denominator. From the equality b2=4ac3b^2 = 4ac - 3 it follows that bb is odd, i.e. b=2k+1b = 2k + 1 for some nonnegative integer kk. So (2k+1)2=4ac3(2k+1)^2 = 4ac - 3, i.e. k2+k+1=ack^2 + k + 1 = ac. It follows that aa and cc are odd. Thus the possible values of aa are a=49,47,45,a = 49, 47, 45, \dots. We verify these values (starting with the greatest one).

Set a=49a = 49. We have c=b2+34a2503449<13c = \frac{b^2+3}{4a} \le \frac{2503}{4 \cdot 49} < 13. Now we must verify whether 449c3=196c34 \cdot 49 \cdot c - 3 = 196c - 3 is a perfect square for some of c=1,3,5,7,9,11c = 1, 3, 5, 7, 9, 11. First, for c=1,5,11c = 1, 5, 11 the last digit of the number 196c3196c - 3 is either 33 or 77, which is impossible for a perfect square. Further, for c=3,7c = 3, 7 and 99 we respectively have 196c3=585,1369196c - 3 = 585, 1369 and 16711671. We see that 1369=3721369 = 37^2, therefore for c=7c = 7, b=37b = 37 and a=49a = 49 the value of dd is equal to 3449=3196\frac{3}{4 \cdot 49} = \frac{3}{196}.

Hence, if the denominator is equal to 33, then the smallest value of dd is 3/1963/196. If the denominator is no smaller than 44, then we have d=4acb24a4450=150>3196d = \frac{4ac - b^2}{4a} \ge \frac{4}{4 \cdot 50} = \frac{1}{50} > \frac{3}{196}. Therefore, the required smallest value is 3196\frac{3}{196}.

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.