什么是有理根定理计算器?
- 简单解释:一条数学规则,规定如果多项式方程具有“良好”分数或整数根,则该根必须通过将常数项的因子除以首项系数的因子来形成。
- 为什么它在三次方程中很重要:如果没有这条规则,手动求三次方程的第一个根就纯属运气游戏了。这将无限的可能性缩小到一个小的、可测试的菜单。
具有实根和复根的专用三次方程求解器、卡尔达诺方法步骤、三次图形和工作示例。
有理根定理计算器
在上面输入您的多项式系数,然后点击“查找有理根候选”查看结果。The Rational Root Theorem provides a systematic way to find all possible rational roots of a polynomial with integer coefficients. For a cubic ax³ + bx² + cx + d = 0, any rational root p/q must satisfy: p divides d (the constant term) and q divides a (the leading coefficient). This generates a finite list of candidates to test.
The theorem does NOT guarantee that rational roots exist — it only narrows the search space. You must test each candidate by substituting it into the polynomial (or using synthetic division). If f(p/q) = 0, you have found a root. Once one root is confirmed, synthetic division reduces the cubic to a quadratic, which the quadratic formula solves completely.
The power of this theorem lies in its efficiency: instead of guessing randomly, you have a guaranteed finite list. For example, if a = 2 and d = 12, the candidates are ±1, ±2, ±3, ±4, ±6, ±12, ±1/2, ±3/2 — at most 16 values to check. This structured approach is the standard first step in polynomial solving before resorting to Cardano's method.
The theorem is always the first tool applied when solving cubics with integer coefficients — before Cardano or numerical methods.
Most algebra and precalculus exams feature problems solvable by the Rational Root Theorem, making it essential test knowledge.
Computer algebra systems use the Rational Root Theorem as the initial step in their polynomial factorization algorithms.
Every candidate ±p/q has both positive and negative versions. Testing only positives misses negative roots.
Candidates like 2/4 and 1/2 are the same root. Reduce fractions to avoid redundant testing.
p divides the CONSTANT term d, and q divides the LEADING coefficient a. Swapping them generates wrong candidates.
| Rule | p divides d, q divides a |
| Candidate Form | ±p/q (all combinations) |
| Testing Method | Substitute or synthetic division |
| Limitation | Only finds rational roots, not irrational |
| After Finding Root | Use synthetic division to reduce degree |
不,它只是为您提供*候选人*的“候选名单”。您必须测试它们,看看哪一个等于零。
这意味着方程有无理根(混乱的小数或平方根),必须使用卡尔达诺等高级公式来求解。
不,令人惊讶的是,该定理仅依赖于首项和常数项。
候选者的数量取决于首项系数和常数项有多少个因子。具有许多因素的较大数字会产生较长的候选列表。
不可以。有理根定理仅识别潜在的有理根(整数或分数)。像 √2 这样的无理根需要其他方法。