uniolympiads Ελληνικά

IMC 2001, Day 2, Problem 1

Let r,s≥1r, s \ge 1 be integers and a0,a1,…,ar−1,b0,b1,…,bs−1a_0, a_1, \dots, a_{r-1}, b_0, b_1, \dots, b_{s-1} be real non-negative numbers such that

(a0+a1x+a2x2+⋯+ar−1xr−1+xr)(b0+b1x+b2x2+⋯+bs−1xs−1+xs)=1+x+x2+⋯+xr+s−1+xr+s.(a_0 + a_1x + a_2x^2 + \dots + a_{r-1}x^{r-1} + x^r)(b_0 + b_1x + b_2x^2 + \dots + b_{s-1}x^{s-1} + x^s) = 1 + x + x^2 + \dots + x^{r+s-1} + x^{r+s}.

Prove that each aia_i and each bjb_j equals either 00 or 11.

Original from the official PDFLet r, s ≥ 1 be integers and a 0 , a 1 , . . . , a r−1 , b 0 , b 1 , . . . , b s−1 be real non- negative numbers such that (a 0 + a 1 x + a 2 x 2 + . . . + a r−1 x r−1 + x r )(b 0 + b 1 x + b 2 x 2 + . . . + b s−1 x s−1 + x s ) = 1 + x + x 2 + . . . + x r+s−1 + x r+s . Prove that each a i and each b j equals either 0 or 1.

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. Multiply the left hand side polynomials. We obtain the following equalities:

a0b0=1,a0b1+a1b0=1,…a_0b_0=1,\quad a_0b_1+a_1b_0=1,\quad\ldots
Among them one can find equations
a0+a1bs−1+a2bs−2+…=1a_0+a_1b_{s-1}+a_2b_{s-2}+\ldots=1
and
b0+b1ar−1+b2ar−2+…=1.b_0+b_1a_{r-1}+b_2a_{r-2}+\ldots=1.
From these equations it follows that a0,b0≤1a_0,b_0\le1. Taking into account that a0b0=1a_0b_0=1 we can see that a0=b0=1a_0=b_0=1.

Now looking at the following equations we notice that all aa's must be less than or equal to 1. The same statement holds for the bb's. It follows from a0b1+a1b0=1a_0b_1+a_1b_0=1 that one of the numbers a1,b1a_1,b_1 equals 0 while the other one must be 1. Follow by induction.

Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?