Maths Olympiad Prep

Library / /28 of 29

Algebra Difficulty 7.0 National olympiad, round 2 Prove it Silk Road Mathematics Competition

The set f1,f2,,fnf_1, f_2, \dots, f_n of polynomials with real coefficients is called special, if for all distinct i,j,k{1,2,,n}i, j, k \in \{1, 2, \dots, n\} the polynomial 23fi+fj+fk\frac{2}{3}f_i + f_j + f_k has no real roots, but for all distinct p,q,r,s{1,2,,n}p, q, r, s \in \{1, 2, \dots, n\} the polynomial fp+fq+fr+fsf_p + f_q + f_r + f_s has a real root.
1) Give an example of the special set of four polynomials with nonzero sum.
2) Is there exists a special set of five polynomials?

Solution

1) The polynomials x2+x+100x^2 + x + 100, x2+x+100x^2 + x + 100, x2+x200-x^2 + x - 200, 11 give a needed example.

2) To the contrary, assume that there exists a special set of polynomials f1,f2,f3,f4,f5f_1, f_2, f_3, f_4, f_5 with real coefficients. Consider a complete graph with a set of vertices {1,2,3,4}\{1, 2, 3, 4\}. An edge (i,j)(i, j) is called positive (negative), if the polynomial 23f5+fi+fj\frac{2}{3}f_5 + f_i + f_j is positive (negative). By the assumption in this graph there is no any positive (negative) triangles. Indeed, if for example 23f5+f+g>0\frac{2}{3}f_5 + f + g > 0, 23f5+g+h>0\frac{2}{3}f_5 + g + h > 0 and 23f5+f+h>0\frac{2}{3}f_5 + f + h > 0, then f5+f+g+h>0f_5 + f + g + h > 0 which is a contradiction with the definition of a special set. The next lemma can be easily proved.

Lemma. In a two-colored complete graph with four vertices without one-colored triangles there is a pair of skew (crossed) edges of every color.

Using the lemma we have conflicting inequalities:
f1+f2+f3+f4+43f5>0, f_1 + f_2 + f_3 + f_4 + \frac{4}{3}f_5 > 0,
f1+f2+f3+f4+43f5<0. f_1 + f_2 + f_3 + f_4 + \frac{4}{3}f_5 < 0.

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 and solution reproduced as published; topic and difficulty added by this site.