Partial Fraction Decomposition

Summary: Euler’s method (§39–§46) for resolving a proper rational function into a sum of simple fractions, one per linear factor of the denominator (with a tower of fractions when factors repeat).

Sources: chapter2

Last updated: 2026-04-23


Setup

Let be a proper rational function — that is, . See improper-rational-function for how to reduce the improper case by polynomial division first.

By factoring-polynomials (and, granted the fundamental-theorem-of-algebra), factors over into linear and quadratic factors. Euler treats the linear case in detail in this chapter; the quadratic case — needed when has complex roots and a real decomposition is required — is handled in Chapter 12 (see real-partial-fraction-decomposition).

Distinct linear factors (§40–§41)

If factors into distinct linear factors, decomposes into simple fractions, one per factor:

Shortcut formula for (§41, “cover-up”)

For the factor of , write . Then the numerator of the corresponding simple fraction is

Euler’s derivation: from one gets , which vanishes at , forcing evaluated there (source: chapter2, §41).

Example (§40–§41)

Decompose . The denominator factors as , so

Applying the §41 shortcut:

  • For factor : , so .
  • For factor : , so .
  • For factor : , so .

Hence

Repeated linear factors (§42–§45)

If divides , that factor contributes the tower

The iterative algorithm (§45)

Write . Compute the numerators in sequence, each time substituting after dividing by :

  1. , then let .
  2. , then let .
  3. , then let .
  4. , then let .
  5. Continue until all numerators are obtained (source: chapter2, §45).

Each "" step is an exact polynomial division — the numerator of the previous step is known to be divisible by , so the division clears out before the next substitution is made.

General procedure (§46)

To decompose an arbitrary rational function :

  1. If is improper, extract the polynomial part by division; see improper-rational-function.
  2. Factor into its linear factors (real or complex).
  3. For each distinct linear factor not repeated elsewhere, use the shortcut (§41) to produce a single simple fraction.
  4. For each repeated linear factor , use the iterative algorithm (§45) to produce the tower of simple fractions.
  5. Sum all simple fractions (plus the polynomial part, if any). The result equals in its simplest form (source: chapter2, §46).

Worked example (§46)

Decompose . The denominator has factors (simple), , and .

  • Factor (simple): , so at : . Contribution: .

  • Factor : . At : . Then , and . Contribution: .

  • Factor : . At : . Then gives . Then gives . Contribution: .

Putting it all together:

There is no polynomial part because the given function is proper (source: chapter2, §46).

Why this matters

Partial-fraction decomposition turns an arbitrary rational function into a sum of maximally simple pieces. This is what makes rational functions tractable in later chapters of the Introductio — for expansions into series, for summation, and (in the Institutiones calculi integralis) for integration.