Linked from

The 9 pages that link to Rational root theorem, each with the reason it gives.

• Polynomial factorizationRelated: Testing its finite candidate list can identify a linear factor of an integer polynomial.

• Polynomial rootRelated: It narrows the candidates when searching for rational polynomial roots.

• Polynomial equationRelated: It narrows the candidates when an exact factorization is sought.

• Vieta's formulasRelated: Vieta's relations can narrow candidate rational roots by their required sums and products.

• Algebraic integerRelated: It proves that the rational algebraic integers are precisely the ordinary integers.

• Factor theoremRelated: It supplies candidates that the factor theorem can verify.

• Synthetic divisionRelated: Its candidate roots can be tested efficiently by synthetic division.

• Polynomial remainder theoremRelated: Its candidates can be tested efficiently by evaluating p(a), the corresponding remainder.

• Eisenstein's criterionRelated: It can establish reducibility through a root but generally does not prove irreducibility by itself.