Note: update these notes with the notes from my MD notebook, also include the idea that everything depends on the field it’s defined in
Rational Root Test
The Rational Root Test is a technique to identify potential rational roots of a polynomial with integer coefficients. Given a polynomial
where are integers, the Rational Root Test tells us that any rational root, when expressed in its lowest terms , must satisfy:
- is a factor of the constant term
- is a factor of the leading coefficient
To use the Rational Root Test, list all possible values of and then check each one to see if it’s a root of the polynomial.
Formally, to find all rational roots of :
This is then often followed by a few tricks, like if all values of are positive then so will the roots. If they instead alternate polarity, the roots will be negative, and so on.
This can also be applied to proving irrationality in a number, e.g. proving is irrational by proving that has no rational roots.
Example
Given , the possible rational roots are:
Irreducibility and Roots in Quadratic and Cubic Polynomials
A polynomial is called “irreducible” if it cannot be factored into polynomials of lower degree with coefficients in the same domain. For quadratic and cubic polynomials with rational coefficients, irreducibility has a simple implication: it won’t have any rational roots.
Quadratics
A quadratic equation is irreducible over the rationals if its discriminant, , is not a perfect square.
If the discriminant is not a perfect square, the quadratic is irreducible over the rationals.
Cubics
For cubic equations , irreducibility is a bit more involved. However, one simple test is to use the Rational Root Test. If the cubic has no rational roots, it’s often—but not always—an indicator that it’s irreducible over the rationals.
Conclusion
The Rational Root Test is an effective way to find potential rational roots in polynomial equations. It’s particularly useful for checking irreducibility in quadratics and cubics, although other methods might be required for a definitive proof of irreducibility.