This rational zeros calculator is provided by Hesapstan to apply the Rational Root Theorem to integer-coefficient polynomials and test each candidate.
What does the rational zeros calculator do?
The calculator lists possible rational zeros of an integer-coefficient polynomial and tests each candidate by synthetic division.
It reports confirmed rational zeros, the candidate-test table, and the reduced quotient that remains after confirmed zeros are removed.
The theorem finds possible rational roots only. If the reduced quotient still has degree 1 or more, irrational or complex roots may remain.
What is the Rational Root Theorem?
The Rational Root Theorem says that if an integer-coefficient polynomial has a rational zero, that zero must be of the form ±p/q.
- p is a divisor of the constant term.
- q is a divisor of the leading coefficient.
- The possible candidates are written as ±p/q.
- Candidates must be tested; they are not automatically roots.
The theorem narrows the search. It does not prove every candidate is a root.
Why integer coefficients are required
The standard theorem applies to polynomials with integer coefficients. Decimal coefficients would require a scaling step, and that step can be ambiguous in a calculator input.
For that reason, the runtime rejects non-integer coefficients with an explicit theorem-validity message.
The calculator does not silently convert a decimal-coefficient polynomial into an integer-coefficient one, because that could mislead users about what theorem was applied.
How candidates are tested
Each candidate r is tested with synthetic division. If the remainder is 0, r is a confirmed zero.
- Zero roots are peeled off first when the constant term is 0.
- Candidates are generated from the reduced polynomial's constant and leading coefficient.
- Each candidate is tested by synthetic division.
- When a zero is found, the quotient becomes the new reduced polynomial.
This running-reduction approach can catch repeated rational zeros.
Worked example
For f(x)=x^3−6x^2+11x−6, the constant term is −6 and the leading coefficient is 1.
The candidates are ±1, ±2, ±3, and ±6. Testing them confirms 1, 2, and 3 as rational zeros.
Highly composite constant or leading coefficients can produce many candidates, so the table is bounded for readability.
What happens when the constant term is zero?
If the constant term is 0, x=0 may be a root. The calculator removes zero roots first, including repeated zero roots.
After that, it generates candidates from the truly reduced polynomial rather than from the original zero constant term.
How Descartes' Rule helps
Descartes' Rule of Signs can help before candidate testing by estimating possible positive and negative real root counts.
- Descartes gives count limits, not candidates.
- Rational zeros gives candidates and tests them.
- Together they make polynomial root hunting more organized.
Limitations and common mistakes
The calculator is limited to integer-coefficient single-variable polynomials, with degree and coefficient caps to keep the candidate table readable.
- It does not find irrational roots.
- It does not solve complex roots.
- It rejects decimal coefficients.
- No confirmed rational zero does not mean no roots exist.
- A nonconstant reduced quotient means further solving may be needed.
A value in the candidate table becomes a root only when the tested remainder is 0.
Frequently Asked Questions
Are rational zero candidates guaranteed roots?
No. A candidate is confirmed only when synthetic division gives remainder 0.
Why are decimal coefficients rejected?
The Rational Root Theorem applies to integer-coefficient polynomials; silent scaling of decimals could be misleading.
If no rational zeros are found, does the polynomial have no roots?
No. It may still have irrational or complex roots.
What if the constant term is 0?
The calculator peels off x=0 roots first, then generates candidates from the reduced polynomial.
Does the calculator use synthetic division?
Yes. Synthetic division is used to test each candidate and update the reduced quotient.