Define a sequence of functions by f0x-1- f1x-x- - fnx -2-1-fn-1xfn-1x- for n - 1- Prove that each fnx is a polynomial with integer coefficients-

We have, f_n^2(x) f_n 1(x)f_n+1(x)=1=f_n 1^2(x) f_n 2(x)f_n(x) . ∴ f_n(x)[ f_n(x)+f_n 2(x) ]=f_n 1[ f_n 1(x)+f_n+1(x) ] .We write this as f_n 1(x)+f ...

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Byju's Answer

Standard XII

Mathematics

Definition of Functions

Define a sequ...

Question

Define a sequence $⟨ f_{0} (x), f_{1} (x), f_{2} (x), \dots ⟩$ of functions by $f_{0} (x) = 1, f_{1} (x) = x, {(\begin{matrix} f_{n} (x) \end{matrix})}^{2} - 1 = f_{n + 1} (x) f_{n - 1} (x)$ , for $n \geq 1$ .
Prove that each $f_{n} (x)$ is a polynomial with integer coefficients.

Open in App

Solution

We have,
$f_{n}^{2} (x) - f_{n - 1} (x) f_{n + 1} (x) = 1 = f_{n - 1}^{2} (x) - f_{n - 2} (x) f_{n} (x)$ .
$∴ f_{n} (x) (\begin{matrix} f_{n} (x) + f_{n - 2} (x) \end{matrix}) = f_{n - 1} (\begin{matrix} f_{n - 1} (x) + f_{n + 1} (x) \end{matrix})$ .
We write this as
$\frac{f_{n - 1} (x) + f_{n + 1} (x)}{f_{n} (x)} = \frac{f_{n - 2} (x) + f_{n} (x)}{f_{n - 1} (x)}$ .
Using induction, we get
$\frac{f_{n - 1} (x) + f_{n + 1} (x)}{f_{n} (x)} = \frac{f_{0} (x) + f_{2} (x)}{f_{1} (x)}$ .
Observe that
$f_{2} (x) = \frac{f_{1}^{2} (x) - 1}{f_{0} (x)} = x^{2} - 1$ .
Hence
$\frac{f_{n - 1} (x) + f_{n + 1} (x)}{f_{n} (x)} = \frac{1 + (x^{2} - 1)}{x} = x$ .
Thus we obtain
$f_{n + 1} (x) = x f_{n} (x) - f_{n - 1} (x)$ .
Since $f_{0} (x), f_{1} (x) a n d f_{2} (x)$ are polynomials with integer coefficients, induction again shows that $f_{n} (x)$ is a polynomial with integer coefficients.
Note: We can get $f_{n} (x)$ explicitly:
$f_{n} (x) = x^{n} - (\begin{matrix} n - 1 1 \end{matrix}) x^{n - 2} + (\begin{matrix} n - 2 2 \end{matrix}) x^{n - 4} - (\begin{matrix} n - 3 3 \end{matrix}) x^{n - 6} + \dots$

Suggest Corrections

Similar questions

Q. If

f_{0} (x) = \frac{x}{(x + 1)}

and

f_{n + 1} = f_{0} \circ f_{n} (x)

for

n = 0, 1, 2, \dots

then

f_{n} (x)

Q. Let

f_{1} (x) = e^{x}, f_{2} (x) = e^{f_{1} (x)}, . . . . . f_{n + 1} (x) = e^{f_{n} (x)}

for all

n \geq 1

. The for any fixed

n, \frac{d}{d x} f_{n} (x)

Q. Let

f_{1} (x) = e^{x}, f_{2} (x) = e^{f_{1} (x)}, . . ., f_{n + 1} (x) = e^{f_{n} (x)} \forall n \geq 1.

The for any fixed

n, \frac{d}{d x} f_{n} (x)

Q. If

f_{1} (x) = \frac{x}{2} + 10, \forall x ϵ R

, and define

f_{n} (x) = f_{1} (f_{n - 1} (x)), \forall n \geq 2

, and

lim n \to \infty f_{n} (x) = g (x)

, and

\int_{\frac{1}{2} g (x)}^{g (x) - 1} (\frac{s i n x}{1 + x^{a}}) < \frac{2}{g (x) - 2}

, then minimum odd value of a(a > 1) is

Q. Let

f (x) = \frac{3}{4} x + 1,

and

f^{n} (x)

be defined as

f^{2} (x) = f (f (x))

and for

n \geq 2, f^{n + 1} (x) = f (f^{n} (x)) .

λ = lim n \to \infty f^{n} (x),

then

Join BYJU'S Learning Program

Define a sequence ⟨f0(x),f1(x),f2(x),…⟩ of functions by f0(x)=1,f1(x)=x, (fn(x))2−1=fn+1(x)fn−1(x), for n≥1. Prove that each fn(x) is a polynomial with integer coefficients.

Define a sequence $⟨ f_{0} (x), f_{1} (x), f_{2} (x), \dots ⟩$ of functions by $f_{0} (x) = 1, f_{1} (x) = x, {(\begin{matrix} f_{n} (x) \end{matrix})}^{2} - 1 = f_{n + 1} (x) f_{n - 1} (x)$ , for $n \geq 1$ .
Prove that each $f_{n} (x)$ is a polynomial with integer coefficients.