Where g is a polynomial function of degree n-1

Let

Code (Text):

 [ tex ]f(x)=\sum_{i=0}^n c_i x^i[ / tex ]

be an arbitrary polynomial function of degree n

Show that if f(0)=0 then either f is constant or f(x)=xg(x), where g is a polynomial function of degree n-1

I don't know how to start. Please help

Thank you in advance

 

Re: Polynomials

Since 0 is a root of f, the polynomial x divides the polynomial f. Therefore, there exists g such that xg(x)=f(x). However, if we write p the degree of g, degree of f= p+1 (since xg(x)=f(x)). Therefore if f equals zero, g equals zero. If not p=n-1

 

Re: Polynomials

is that correct ?

 

Re: Polynomials

For the first part, I understood: we will get f(0)=c_0=0 which is a constant

However show that f(x)=xg(x) doesn't seem so obvious to me

 

Re: Polynomials

ok I see. I do the same thing then for question 2 right ?

 

Re: Polynomials

Oh I am so sorry. I forgot to post it.

I need to show that if f(a)=0 for some a \in \mathbb{R}, the either f is constant or f(x)=(x-a)g(x), where g is a polynomial function of degree n-1