# Polynomials (Algebra) - I.S.I. 2019 : Problem #7

## Understand the problem

[/et_pb_text][et_pb_text _builder_version="3.27.4" text_font="Raleway||||||||" background_color="#f4f4f4" custom_margin="10px||10px" custom_padding="10px|20px|10px|20px" box_shadow_style="preset2"] Let $f$ be a polynomial with integer coefficients. Define$a_1 = f(0)~,~a_2 = f(a_1) = f(f(0))~,$ and $~a_n = f(a_{n-1})$ for $n \geqslant 3$.

If there exists a natural number $k \geqslant 3$ such that $a_k = 0$, then prove that either $a_1=0$ or $a_2=0$.

[/et_pb_text][/et_pb_column][/et_pb_row][et_pb_row _builder_version="3.25"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_accordion open_toggle_text_color="#0c71c3" _builder_version="3.22.4" toggle_font="||||||||" body_font="Raleway||||||||" text_orientation="center" custom_margin="10px||10px" hover_enabled="0"][et_pb_accordion_item title="Source of the problem" open="off" _builder_version="3.22.4"]
I.S.I. (Indian Statistical Institute) B.Stat/B.Math Entrance Examination 2019. Subjective Problem no. 7.
[/et_pb_accordion_item][et_pb_accordion_item title="Topic" _builder_version="3.22.7" open="off"]Polynominals (Algebra)

[/et_pb_accordion_item][et_pb_accordion_item title="Difficulty Level" _builder_version="3.22.7" open="off"]

8 out of 10

[/et_pb_accordion_item][et_pb_accordion_item title="Suggested Book" _builder_version="4.3.4" hover_enabled="0" open="on"]

[/et_pb_text][et_pb_tabs active_tab_background_color="#0c71c3" inactive_tab_background_color="#000000" _builder_version="3.22.4" tab_text_color="#ffffff" tab_font="||||||||" background_color="#ffffff"][et_pb_tab title="Hint 0" _builder_version="3.22.4"]

Do you really need a hint? Try it first!

[/et_pb_tab][et_pb_tab title="Hint 1" _builder_version="3.22.4"]

Do you know this lemma , Lemma: If $p, q \in \mathbb{Z}$ and $p \neq q$, then $p - q \mid f(p) - f(q)$ .

[/et_pb_tab][et_pb_tab title="Hint 2" _builder_version="3.22.4"]

To prove this, let $f(x) = a_nx^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + \cdots + a_0$. Then$f(p) - f(q) = a_n(p^n - q^n) + a_{n-1}(p^{n-1} - q^{n-1}) + a_{n-2}(p^{n-2} - q^{n-2}) + \cdots + (p - q).$Each bracket is divisible by $p - q$, proving the statement.

[/et_pb_tab][et_pb_tab title="Hint 3" _builder_version="3.22.7"]

We use the fact that the sequence $a_1, a_2, a_3, \cdots$ consists of only integers.
We'll first prove that we cannot have three distinct integers $p$, $q$, and $r$ such that $f(p) = q$, $f(q) = r$, and $f(r) = p$ (In other words, the variables cannot come in a cycle of 3). Assume that there does exist such numbers. Then we should have $p - q \mid f(p) - f(q) = q - r$, which means $\mid p - q \mid \le \mid q - r \mid$ . Similarly we can get $\mid p - q \mid \le \mid q - r \mid \le \mid r - p\mid \le \mid p - q \mid$ , which implies equality. Ultimately, it leads to two equal variables, contradiction. In a similar manner we can prove that these variables cannot come in cycles of more than 3.

[/et_pb_tab][et_pb_tab title="Hint 4" _builder_version="3.22.7"]

Therefore, we conclude that the variables of $f$ can only come in cycles of most two. We realize that since $a_{k+1} = f(0) = a_1$, we have a cycle $a_1, a_2, a_3, \cdots, a_k$. Since the minimal cycle has length at most 2, one of $a_1$ or $a_2$ must be equal to 0, and we are done.

## Connected Program at Cheenta

Indian Statistical Institute and Chennai Mathematical Institute offer challenging bachelor’s program for gifted students. These courses are B.Stat and B.Math program in I.S.I., B.Sc. Math in C.M.I.

The entrances to these programs are far more challenging than usual engineering entrances. Cheenta offers an intense, problem-driven program for these two entrances.