Branko is writing a sequence of quadratic polynomials with real coefficients. In each step, he considers the polynomial he chose in the previous step, denoted by ax2+bx+c, and proceeds to write down either cx2+bx+a or a(x+d)2+b(x+d)+c for some real number d. Starting from x2−2x−1 and performing a finite number of prescribed steps, can Branko obtain the following polynomial:
a) 2x2−1?
b) 2x2−x−1
Solution
a) The first polynomial, i.e. 2x2−1, can be obtained by applying the following sequence of steps: x2−2x−1→−x2−2x+1d=−1−x2+2→2x2−1.
b) Notice that the prescribed steps leave the discriminant unchanged: the discriminant of cx2+bx+a is b2−4ca=b2−4ac, whereas the discriminant of a(x+d)2+b(x+d)+c=ax2+(2ad+b)x+(ad2+bd+c) equals (2ad+b)2−4a(ad2+bd+c)=4a2d2+4abd+b2−4a2d2−4abd−4ac=b2−4ac. The discriminant of the initial polynomial x2−2x−1 is 8, while the discriminant of 2x2−x−1 equals 9. Thus, Branko cannot obtain the polynomial 2x2−x−1 in any number of allowed steps.
Remark: Consider the prescribed steps as operations T1 and T2 on triples of real numbers: (a,b,c)T1(c,b,a)and(a,b,c)T2(a,2ad+b,ad2+bd+c). Given any two quadratic polynomials f(x) and g(x) with equal discriminants, we can obtain a sequence of steps transforming f(x) into g(x): first, we apply T2 to adjust the constant term of f(x), making it equal to the leading coefficient of g(x). After that, we can use T1 to swap the leading coefficient with the constant term. Finally, using T2, we can adjust the new constant term making it equal to the constant term of g(x). This last step guarantees that the resulting polynomial will have the same constant term as g(x). The leading coefficient is also equal to the one appearing in g(x), because it remains unchanged by T2. Finally, the linear term also matches the one appearing in g(x): it is uniquely determined (up to sign) by the discriminant and the remaining two coefficients. If necessary, we can change its sign by applying T2 with d=−b/a.
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.