wiz-icon
MyQuestionIcon
MyQuestionIcon
2
You visited us 2 times! Enjoying our articles? Unlock Full Access!
Question

Define a sequence f0(x),f1(x),f2(x), of functions by f0(x)=1,f1(x)=x, (fn(x))21=fn+1(x)fn1(x), for n1.
Prove that each fn(x) is a polynomial with integer coefficients.

Open in App
Solution

We have,
f2n(x)fn1(x)fn+1(x)=1=f2n1(x)fn2(x)fn(x).
fn(x)(fn(x)+fn2(x))=fn1(fn1(x)+fn+1(x)).
We write this as
fn1(x)+fn+1(x)fn(x)=fn2(x)+fn(x)fn1(x).
Using induction, we get
fn1(x)+fn+1(x)fn(x)=f0(x)+f2(x)f1(x).
Observe that
f2(x)=f21(x)1f0(x)=x21.
Hence
fn1(x)+fn+1(x)fn(x)=1+(x21)x=x.
Thus we obtain
fn+1(x)=xfn(x)fn1(x).
Since f0(x),f1(x)andf2(x) are polynomials with integer coefficients, induction again shows that fn(x) is a polynomial with integer coefficients.
Note: We can get fn(x) explicitly:
fn(x)=xn(n11)xn2+(n22)xn4(n33)xn6+

flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Definition of Function
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon