3

A polynomial of degree $n$ is written in standard form. All numerical coefficients are positive. It has $k$ positive zeroes and $k+1$ negative zeroes. $0$ is not a zero of the polynomial. What can we deduce about $n$?

The answer in the book said

$n=1$

I, however, got the answer

$n=1,5,9,13,17,21,\dots$

How do you eliminate the leftover cases ($5,9,13,\dots)$?

EDIT: Note, as per the comments, that $n$ is meant to be $2k+1$.

Gerry Myerson
  • 179,216

1 Answers1

2

If a polynomial $f(X)$ has positive coefficients, and $0$ is not a root, it has only negative roots. Hence $k=0$. Thus is decomposition into a product of irreducible factors over $\mathbf R$ has the form: $$f(X)=c(X+a)p_1(X)\dotsm p_r(X),$$ where the $p_i(X)$ are quadratic polynomials with a negative discriminant. Thus the degree $n$ is odd.

Bernard
  • 175,478