Writing p/q in lowest terms assigns the numerator and denominator their reduced roles in the candidate condition. The numerator p is tested against divisors of the constant term, while denominator q is tested against divisors of the leading coefficient. Reducing the fraction first prevents redundant representations of the same possible rational zero.
The divisibility conditions produce candidates, not guaranteed solutions. A candidate becomes a confirmed zero only when substitution makes the polynomial equal to zero. This distinction keeps the theorem from being mistaken for a complete solution test: it narrows the search, while direct evaluation, the Factor Theorem, or synthetic division verifies the result.
The constant term controls which integers can appear in the numerator of a rational-zero candidate, and the leading coefficient controls which integers can appear in its denominator. Changing either coefficient can therefore change the available fractions, even when other parts of the polynomial remain similar. The resulting list reflects the coefficient structure.
The theorem identifies a manageable set of values to test, while the Factor Theorem and synthetic division help process a value after it has been confirmed as a zero. Together, these tools move from candidate selection to factorization. That combination can expose additional exact roots and make the polynomial easier to analyze.
First, identify the constant and leading coefficients. List their divisors, form the possible fractions p/q, and write those fractions in lowest terms. Test each candidate by substitution. When a value produces zero, use the Factor Theorem or synthetic division to factor the polynomial and continue determining its exact roots.
After a candidate is verified, synthetic division provides a practical way to use that zero in factoring the polynomial. This reduces the remaining factorization work and supports the search for other exact roots. In this workflow, synthetic division is not the method that creates the candidate list; it helps process a successful candidate.
It is especially useful when the goal is to find exact roots rather than rely only on numerical solution methods. By restricting testing to candidates determined from the coefficients, the theorem makes factorization more efficient and clarifies how numerical searches relate to the algebraic structure of the polynomial. This gives students and researchers a systematic starting point.