2

Let say I have a polynomial with n as the maximum degree.

Say: $a_1x^n+a_2x^{n-1}+...+a_n$

How can I prove that it does not have any rational roots?

For example: If we have polynomial with degree 2, We can determine it has no roots if $b^2-4ac<0$, But when the degree is higher than 2 what can we do?

2 Answers2

5

We can use the rational root test. This test states that if an integer-coefficient polynomial $f(x) = a_n x^n + \cdots + a_0$ has a rational root $r = p/q$ and the root is in lowest terms, i.e. $\gcd(p,q)=1,$ then it follows that $$ q\mid a_n,\ \ p\mid a_0.$$ Other things we can do include Eisenstein's Criterion, which will show that the polynomial is irreducible, hence doesn't have a root, or we can also use modular arithmetic. If we look at the polynomial in $\Bbb Z/p\Bbb Z$ for some prime, is it irreducible? If the answer is yes, then the poly. is irreducible over the integers, too.

Clayton
  • 24,751
2

If $n$ is odd it will definitely have a real root. Only if $n$ is even is it possible for there to be no real roots.

One method when $n$ is even is to determine the points of minima of the polynomial $p(x)$ using calculus. If $a_1>0$ and the minima of $p$ are greater than zero, then $p$ cannot have any roots.

EDIT: For testing of integer roots, take a look at the rational root test.

Milind Hegde
  • 3,914