You are viewing a free preview of this lesson.
Subscribe to unlock all 10 lessons in this course and every other course on LearningBro.
Partial fractions is the reverse of adding algebraic fractions. When you compute x−12+x+23, you obtain a single fraction (x−1)(x+2)5x+1 with a more complicated numerator and a factorised denominator. Partial-fraction decomposition runs the film backwards: starting from (x−1)(x+2)5x+1, it rebuilds the simpler summands x−12 and x+23. The technique looks like a bookkeeping exercise, but its real importance is downstream. In the Edexcel A-Level, partial fractions unlock two otherwise intractable problems: integrating rational functions (Paper 2, section 7) and binomially expanding rational expressions of the form (1+ax)−1(1+bx)−1 as a power series (section 4). At university the same idea reappears in inverse Laplace transforms, in the residue calculus of complex analysis, and in the analysis of linear time-invariant systems in control engineering. Mastering the algebraic decomposition now pays compound interest later.
This lesson is aligned with the Edexcel 9MA0 specification, Pure Mathematics Paper 1 — Section 2.10: "Decompose rational functions into partial fractions (denominators not more complicated than squared linear terms and with no more than 3 terms, numerators constant or linear)." The technique is then re-used in:
Edexcel restrict denominators to (at most) a product of three factors, each linear or a single irreducible quadratic, with numerators of degree at most one. The formula booklet does not list partial-fraction templates — you must memorise the three standard forms.
Partial fractions decomposes a proper rational function — a quotient Q(x)P(x) in which degP<degQ. If degP≥degQ the fraction is improper and you must polynomial-long-divide first, leaving a polynomial quotient plus a proper remainder fraction; only the remainder is decomposed.
A theorem from algebra (sometimes called the partial-fraction decomposition theorem for rational functions over R[x]) guarantees that every proper rational function with real coefficients can be written uniquely as a sum of fractions whose denominators are powers of the irreducible factors of Q(x). Over the reals, the irreducible factors are exactly the linear polynomials (ax+b) and the irreducible quadratics (ax2+bx+c) with negative discriminant. The Edexcel syllabus restricts you to three standard cases.
| Case | Denominator factor | Partial-fraction form |
|---|---|---|
| (a) Distinct linear | (ax+b) appearing once | ax+bA |
| (b) Repeated linear | (ax+b)2 | ax+bA+(ax+b)2B |
| (c) Irreducible quadratic | (ax2+bx+c) with b2−4ac<0 | ax2+bx+cAx+B |
You combine these case-by-case for each factor of Q(x). For example, (x−1)(x+2)2(x2+1)P(x) decomposes as
x−1A+x+2B+(x+2)2C+x2+1Dx+E.
The number of unknowns A,B,C,D,E matches the degree of Q(x) — here, degree 5 = 1 + 1 + 1 + 2.
There are three techniques for finding the unknown numerators, and you should be fluent in all three because each is fastest in different settings.
| Method | Best for | Mechanism |
|---|---|---|
| Cover-up (Heaviside) | Distinct linear factors | Multiply by the factor, substitute the value that kills it |
| Substitution of x | Distinct linear, repeated linear | Multiply through by Q(x), then substitute clever values of x |
| Comparing coefficients | Repeated linear, irreducible quadratic | Multiply through by Q(x), expand, equate powers of x |
In practice, use cover-up for any distinct linear factor (one second of work), substitution for the "easy" constants in repeated-linear cases, and comparing coefficients to mop up the remaining unknowns when substitution leaves them entangled.
The cover-up method, attributed to Oliver Heaviside in the late nineteenth century during his work on operational calculus for telegraph signals, is the fastest way to extract the numerator above a distinct linear factor.
Recipe. To find A in (x−α)Q1(x)P(x)=x−αA+⋯, cover up the (x−α) factor in the original denominator and substitute x=α into what remains:
A=Q1(x)P(x)x=α.
It works because multiplying both sides by (x−α) and then setting x=α kills every other term on the right. The method extends to repeated factors by differentiation (see A vs A* divide below) but is most efficient as stated for the distinct-linear case.
The comparing-coefficients method is the most general technique. After multiplying through by Q(x) to clear denominators, you have a polynomial identity that must hold for all x. Two polynomials agree at every x iff their coefficients agree power-by-power, so collecting the coefficient of xk on each side gives one equation per power. The total number of equations equals the degree of the cleared identity, which equals the number of unknowns — the system is square and (by uniqueness of decomposition) non-singular.
Worked illustration. Decompose (x−1)(x2+2)3x2+4x−5 where x2+2 is irreducible. The template is
(x−1)(x2+2)3x2+4x−5=x−1A+x2+2Bx+C.
Multiply through:
3x2+4x−5=A(x2+2)+(Bx+C)(x−1).
Full-substitution route. Substitute x=1 to kill the second term: 3+4−5=3A⇒A=32. Substitute x=0: −5=2A−C⇒C=2A+5=34+5=319. Substitute x=−1: 3−4−5=3A+(−B+C)(−2)=2+2(B−C)⇒−6=2+2B−338⇒2B=−8+338=314, so B=37.
Matrix-form (collect-coefficients) route. Expand the right-hand side:
A(x2+2)+(Bx+C)(x−1)=(A+B)x2+(−B+C)x+(2A−C).
Equate coefficients power-by-power against 3x2+4x−5 to obtain three simultaneous equations:
x2:x1:x0:A+B=3−B+C=42A−C=−5
In matrix form 1021−1001−1ABC=34−5. Add row 3 to twice row 1: 4A+2B=1 combined with A+B=3⇒2A=−5⇒A=32 — actually solving cleanly: from row 1, B=3−A; substituting in row 2 gives C=4+B=7−A; row 3 then gives 2A−(7−A)=−5⇒3A=2⇒A=32, then B=37, C=319. Both routes agree.
The matrix view is conceptually cleaner: it shows partial fractions as a linear problem in the unknowns, and it generalises to computer-algebra implementations. The substitution route is faster by hand for small systems. A* candidates are fluent in both and choose by problem size.
Decompose (x−1)(x+2)5x+1 into partial fractions.
Step 1 — write the form. Two distinct linear factors give
(x−1)(x+2)5x+1=x−1A+x+2B.
Step 2 — apply cover-up for A. Cover the (x−1) in the denominator and substitute x=1:
A=(1)+25(1)+1=36=2.
Step 3 — apply cover-up for B. Cover the (x+2) and substitute x=−2:
B=(−2)−15(−2)+1=−3−9=3.
Step 4 — state the answer.
(x−1)(x+2)5x+1=x−12+x+23.
Step 5 — check by recombining. (x−1)(x+2)2(x+2)+3(x−1)=(x−1)(x+2)5x+1. Correct.
Decompose (x+1)(x−2)24x+5 into partial fractions.
Step 1 — write the form. A distinct linear (x+1) and a repeated linear (x−2)2 give
(x+1)(x−2)24x+5=x+1A+x−2B+(x−2)2C.
Step 2 — multiply through by the common denominator.
4x+5=A(x−2)2+B(x+1)(x−2)+C(x+1).(⋆)
Step 3 — substitute x=−1 (kills the A-term... wait, the others). Setting x=−1 kills B and C:
4(−1)+5=A(−3)2⟹1=9A⟹A=91.
Step 4 — substitute x=2. This kills A and B:
4(2)+5=C(3)⟹13=3C⟹C=313.
Step 5 — find B by comparing coefficients. Expand (⋆):
A(x−2)2=A(x2−4x+4), B(x+1)(x−2)=B(x2−x−2), C(x+1)=Cx+C.
Coefficient of x2: A+B=0, so B=−A=−91.
(One could equally substitute any further value of x, e.g. x=0, and solve for B.)
Step 6 — state the answer.
(x+1)(x−2)24x+5=x+11/9−x−21/9+(x−2)213/3.
Decompose (x+1)(x2+4)2x2−x+4 into partial fractions.
Step 1 — confirm (x2+4) is irreducible. Discriminant of x2+4 is 0−16=−16<0, so it has no real linear factors. Use a linear numerator:
(x+1)(x2+4)2x2−x+4=x+1A+x2+4Bx+C.
Step 2 — multiply through.
2x2−x+4=A(x2+4)+(Bx+C)(x+1).
Step 3 — substitute x=−1 for A.
2(1)−(−1)+4=A(1+4)⟹7=5A⟹A=57.
Step 4 — compare coefficients of x2 and constants.
Coefficient of x2: A+B=2⟹B=2−57=53.
Constant term: 4A+C=4⟹C=4−528=−58.
Step 5 — state the answer.
(x+1)(x2+4)2x2−x+4=x+17/5+x2+4(3/5)x−8/5.
Count the degrees of freedom. A proper rational function P(x)/Q(x) with degQ=n has a numerator P(x) of degree at most n−1, so it is determined by n free coefficients. The decomposition must therefore also have exactly n unknowns — no more, no less, or the matching to P(x) would be over- or under-determined.
Each linear factor (x−α) contributes one unknown (the constant A above x−αA). Each repeated linear factor (x−α)k contributes k unknowns (A1,…,Ak). Each irreducible quadratic (x2+bx+c) contributes two unknowns (the A and B in x2+bx+cAx+B) — exactly because the factor itself has degree 2.
Add up: ∑(contribution from each factor)=degQ=n, matching the n free coefficients of P(x). The decomposition has exactly the right degrees of freedom to represent any proper numerator. If you mistakenly wrote x2+bx+cA (one unknown for a quadratic factor), you would be one short, and the system A(⋯)+⋯=P(x) would generically have no solutions.
This counting argument is a corollary of the Fundamental Theorem of Algebra (Gauss, 1799): every polynomial of degree n over C has exactly n roots counted with multiplicity. Over R, complex roots come in conjugate pairs, so each pair bundles into a single real irreducible quadratic — and the "two" in "Ax+B" is exactly the count of those bundled complex roots.
Decompose x2−1x3+2x2−x+1 into partial fractions.
Step 1 — recognise it is improper. deg(numerator)=3>2=deg(denominator), so polynomial long division is required first.
Step 2 — divide.
x3+2x2−x+1=(x2−1)(x+2)+(3).
(Check: (x2−1)(x+2)=x3+2x2−x−2, so the remainder is x3+2x2−x+1−(x3+2x2−x−2)=3.)
Hence
x2−1x3+2x2−x+1=x+2+(x−1)(x+1)3.
Step 3 — decompose the proper remainder.
(x−1)(x+1)3=x−1A+x+1B.
Cover-up: A=1+13=23, B=−1−13=−23.
Step 4 — state the full answer.
x2−1x3+2x2−x+1=x+2+x−13/2−x+13/2.
Why a linear quotient appeared. When polynomial-dividing P(x) by Q(x), the quotient has degree degP−degQ (provided the division terminates, which it always does over R[x]). Here degP=3 and degQ=2, so the quotient is degree 3−2=1 — a linear x+2. If the numerator had been degree 4 the quotient would be quadratic; degree 5, cubic. The remainder always has degree strictly less than degQ (otherwise division could continue), so the proper-remainder fraction is guaranteed decomposable by the standard cases. This is why the first check on any rational function is to compare degrees: it tells you both whether long division is needed and what shape the polynomial part will take.
Decompose (x−1)(x+2)2x4−x3+5x−1 into partial fractions.
Step 1 — degree check. Numerator degree 4, denominator degree 2, so the quotient will have degree 4−2=2 (a quadratic). Long division is required.
Step 2 — multiply out the denominator. (x−1)(x+2)=x2+x−2.
Step 3 — long divide 2x4−x3+5x−1 by x2+x−2.
So (x−1)(x+2)2x4−x3+5x−1=2x2−3x+7+(x−1)(x+2)−8x+13.
Step 4 — decompose the proper remainder. Cover-up at x=1: A=1+2−8(1)+13=35. Cover-up at x=−2: B=−2−1−8(−2)+13=−329=−329.
Step 5 — state the answer.
(x−1)(x+2)2x4−x3+5x−1=2x2−3x+7+x−15/3−x+229/3.
The polynomial part 2x2−3x+7 dominates the function for large ∣x∣; the partial-fraction part dominates near the poles at x=1 and x=−2. This decomposition is exactly what is needed to integrate the original function — the polynomial integrates termwise, and each partial fraction integrates to a logarithm.
Question (7 marks):
(a) Express f(x)=(1−x)(1+2x)29x2+8x−1 in partial fractions. (4)
(b) Hence, or otherwise, find the binomial expansion of f(x) in ascending powers of x, up to and including the term in x2. (3)
Solution with mark scheme:
(a) Form. (1−x)(1+2x)29x2+8x−1=1−xA+1+2xB+(1+2x)2C.
M1 (AO1.1a) — correct partial-fraction template, with 1+2xB+(1+2x)2C for the repeated factor (not just one term).
Multiply through:
9x2+8x−1=A(1+2x)2+B(1−x)(1+2x)+C(1−x).
Substitute x=1: 9+8−1=A(3)2⟹16=9A⟹A=916.
Substitute x=−21: 9(41)+8(−21)−1=C(23)⟹49−4−1=23C⟹−419=23C⟹C=−619.
Subscribe to continue reading
Get full access to this lesson and all 10 lessons in this course.