Mathematics · Ch 3 — Theory of Equations
Reciprocal Equations
Reciprocal Equations
Some equations have a special coefficient symmetry that lets a substitution do all the work, without needing to guess any individual root.
Definition 3.1. A degree- polynomial is a reciprocal polynomial
- of Type I if — the equation is then called a Type I reciprocal equation;
- of Type II if — a Type II reciprocal equation.
Theorem 3.6. For (), this is a reciprocal equation iff either (Type I — coefficients from the start equal the coefficients from the end, in order) or (Type II — same coefficients from each end, but opposite in sign).
Proof idea. Replacing by in and multiplying through by recovers the coefficients in reverse order. is reciprocal iff this reversed polynomial is itself, which forces to be the same constant for every ; multiplying the and instances of this ratio gives , so (Type I, coefficients palindromic) or (Type II, coefficients anti-palindromic).
Useful stated facts (without proof).
- A reciprocal equation can never have as a root.
- For an odd-degree Type I reciprocal equation, is always a root.
- For an odd-degree Type II reciprocal equation, is always a root.
- For an even-degree Type II reciprocal equation, the middle coefficient must be , and both and are always roots.
- For an even-degree reciprocal equation (Type I or II), substituting (Type I) or (Type II) reduces the problem to a polynomial equation of half the original degree.
The converse of "reciprocal roots pair as " is not an equivalence: a polynomial can have every root paired with its reciprocal without being a reciprocal polynomial in the Definition 3.1 sense. E.g. has roots (reciprocal-paired, since ), yet its coefficients are not palindromic (nor anti-palindromic) — it is not a reciprocal equation by the definition. …