Partial Fraction Decomposition: Four Worked Examples

A rational expression can look harder to integrate than it is. Consider . Once its denominator is factored, the expression can become two fractions whose antiderivatives are logarithms. The difficult part is choosing the right shape before solving for any constants. Guess a missing term and the later algebra cannot repair the setup.
This guide uses four original examples: distinct linear factors, a repeated linear factor, an irreducible quadratic factor, and a numerator that first requires division. Each ends by recombining the answer. The method follows OpenStax Calculus, Volume 2, §3.4, which sets out the degree condition and the three factor patterns. For the meaning of the resulting integral, see our integral guide. The algebra below stands on its own.
First check the degrees and factor the denominator
Write the rational function as . Partial fraction decomposition starts with a proper fraction: . If that inequality fails, divide by , retaining the polynomial quotient and a proper remainder. Do not try to hide the quotient inside constants.
Next factor over the real numbers. The factorization determines the template, before any coefficient calculation:
| Denominator factor | Terms to include |
|---|---|
| Distinct linear | |
| Repeated linear | |
| Irreducible quadratic |
The template is an identity for every allowed value of , not a statement about one convenient test point. After clearing denominators, you can solve for unknowns in two complementary ways. Substitute roots of linear factors to remove terms, as in Examples 1 and 2, or expand both sides and equate the coefficient of each power of , as in Example 3. A root substitution may determine one constant instantly, but it rarely replaces every coefficient comparison when a quadratic factor remains. Always use the remaining coefficients as a check, even if strategic substitutions seemed to give all the numbers. This also explains why the missing term in Example 2 is detectable: the shortened template cannot match all coefficients simultaneously. It is a structural failure, not merely a bad choice of substitution. If you solve at a few ordinary inputs instead, you are solving a finite system; you still need to verify the resulting polynomial identity for all . A complete recombination does that in one line.
An irreducible quadratic has no real linear factors. Its numerator must be linear, even if the solved value of happens to be zero. Keep the original denominator's excluded values in mind: two formulas can agree everywhere in their shared domain without becoming defined at a canceled pole. A quick factor check before coefficient work prevents most structural mistakes.
Example 1: two distinct linear factors
Decompose . The numerator has degree one and the denominator degree two, so division is unnecessary. The factors are distinct. Set
Multiply by the denominator, keeping the excluded points out of the original function's domain:
This is a polynomial identity. Substituting gives , hence . Substituting gives , hence . These substitutions solve the polynomial identity; they do not claim that the original rational function is defined at those points.
Now recombine instead of stopping at two plausible constants:
The equality holds for . A single numerical spot check would be weaker: two wrong expressions can agree at one input. Matching the entire numerator is the decisive check.
Example 2: a repeated factor needs two terms
Take . The repeated factor requires both first and second powers in the denominators:
Multiplication by produces
Set to get . Set to get , so . To find , compare the coefficients: , so . The coefficient then provides an independent check: , as required.
Recombine all three numerators:
Thus for . Deliberate wrong template: omits the first-power repeated-factor term. For this particular numerator, its combined numerator would be . Its coefficient requires , while its constant requires . The contradiction diagnoses a missing term, not a hard system of equations. The full template resolves it.
Example 3: an irreducible quadratic takes a linear numerator
Consider . Since has no real root, leave it quadratic over the reals. The proper template is
Clearing denominators gives
At , , so . Comparing coefficients yields , hence , and , hence . The constant check is . It succeeds. Zero is a solved value for , not a reason to have guessed a constant numerator at the start.
The recombination is short: . Therefore , on . This example also makes integration convenient: the derivative of is , so the second term is a logarithmic substitution after a constant adjustment. If a quadratic factor were repeated, each power would need its own linear numerator, just as a repeated linear factor needs every power.
Example 4: divide an improper fraction first
Now take . Both polynomials have degree two. Long division, or subtracting the denominator once, gives
Only the remainder is decomposed. Let . Substituting gives , so . At , , so . Hence
Recombine the entire result, including the polynomial quotient. The two proper terms give . Adding one restores . Dropping the one would pass a coefficient check on the remainder but fail against the original fraction.
Integrate a result and check by differentiating
Return to Example 3. On either interval separated by , integrate term by term:
Differentiate: . The absolute value is needed around ; is positive for real . The constant can differ between disconnected intervals. This final derivative check catches errors that a correct decomposition alone cannot, such as a missing factor of two during integration.
If another technique is mixed into the integral, integration by parts examples show how to verify an antiderivative after several steps. Laplace transforms are another reason to learn the algebra: inverse-transform work often starts by splitting a rational expression. In Math Zen, practice the supporting factorization and derivative skills as separate questions before combining them in a longer integral.
A compact self-check before moving on
For any new rational expression, run the same sequence: compare degrees, divide if necessary, factor the denominator, write one term for every required factor power, solve the polynomial identity, and recombine the full expression. The four cases above deliberately use different templates; the recombination step is the common safeguard. A useful extra test is to inspect behavior near an excluded value. In Example 1, the term with denominator controls the divergence near ; a decomposition without that term cannot reproduce the original pole. This does not determine every coefficient, but it is another way to notice an incomplete template before doing the full identity. Similarly, a repeated squared factor can produce a stronger divergence than a first-power term alone. Always use the algebraic recombination as the final proof, because visual behavior near one pole will not detect every coefficient error. If it fails, inspect the template first, then the coefficient arithmetic. A solved system cannot rescue a missing factor term.
Common Questions
- When do I divide before using partial fractions?
- Divide when the numerator degree is at least the denominator degree. Decompose only the proper remainder after polynomial division.
- Why include every power of a repeated factor?
- A repeated factor (x-a)^m needs terms with denominators x-a through (x-a)^m. Leaving one out can make the coefficient identity impossible.
- How do I check a decomposition?
- Put its terms over the original denominator and simplify the combined numerator. It must equal the original numerator as a polynomial, not merely at one chosen value.


