Common factor extraction
Look at and it seems like a finished expression — two terms, added together, nothing more to do. But every term here is secretly built from the same block, , multiplied by something else. Spot that shared block, pull it to the front, and the expression collapses to — a product instead of a sum. That single move, pulling out a common factor, is the doorway into the whole Factorisation chapter. It reverses multiplication: instead of expanding brackets you are handed an expanded expression and asked to rebuild the brackets. Every other factorising technique in Class 8 — grouping, identities, splitting the middle term — assumes you can already spot and extract a common factor cleanly, so it is worth making automatic. This article walks through finding the highest common factor (HCF) of an expression's terms, extracting it correctly (including tricky signs and leftover s), and checking the result by expanding back.
Every term of an expression shares a common factor when their coefficients share a numerical HCF and their variables share common letters, so writing turns the sum into a product — the reverse of the distributive law.
The core idea
Factorisation means writing an expression as a product of factors instead of a sum of terms. The easiest kind of factorisation happens when every single term shares a common factor — a number, a variable, or both. That shared piece is lifted out in front of a bracket, and what is left of each term after dividing by it goes inside the bracket.
where: is the common factor present in both terms, and , are what remain once each term is divided by . Checking this is easy: expand using the distributive law and you land back on , so factorising and expanding undo each other. For expressions with several terms and more than one variable, the common factor itself has two pieces that must each be hunted down separately.
where: the HCF of the coefficients is the ordinary highest common factor of the plain numbers in front of each term, and the lowest power of each variable means that if a letter such as appears in every term, you take whichever power of is smallest across all the terms — never the largest, and never a variable missing from even one term. A few points make this systematic rather than a guessing game.
- Scan every term's numerical coefficient first and find their HCF using the usual method (listing factors, or repeated division).
- For each variable that appears in every term, compare the powers it carries in each term and keep only the lowest one; a variable absent from any single term cannot be part of the common factor at all.
- Multiply the numerical HCF and the variable part together — that product is what gets written outside the bracket.
- Divide each original term by this common factor to find what stays inside the bracket, keeping every sign intact.
The goal is to show, algebraically, that pulling out the HCF of the terms of an expression and dividing each term by it always produces a bracket that, when multiplied back out by the distributive law, exactly reproduces the original expression — so the two directions of factorisation and expansion are true inverses of each other, not just a lucky coincidence for small examples.
Step 1. Start from an expression with terms , and suppose is a factor common to every one of them. That means each term can be written as for some quotient — this is exactly what " is a factor of " means.
Step 2. Add the terms in this form: . Nothing has changed numerically; every term has simply been rewritten to expose the shared block .
Step 3. Apply the distributive law in reverse: for any two terms, and extending this to terms gives . This is the factorised form — outside, the quotients added inside the bracket.
Step 4. Verify the reverse direction. Multiply back out using the ordinary (forward) distributive law: multiplies each term inside the bracket in turn, giving , which is precisely the expression you started with. So factorising by common factor extraction and then expanding the bracket always returns the original expression — the two processes are exact inverses, which is why "expand the bracket back" is always a valid check.
Worked example
Factorise , then extend the same method to a three-term expression, .
Step 1. HCF of the coefficients and . Listing factors, and ; the common factors are and , so the HCF is .
Step 2. HCF of the variable parts. The first term carries , the second carries . For , the lowest power present in both terms is ; for , the lowest power present in both is . So the shared variable factor is .
Step 3. Combine: the overall common factor is .
Step 4. Divide each term by : , and . So .
Check: expanding gives back exactly, so the factorisation is confirmed.
Competitive stretch
Now the three-term case, . The coefficients have HCF . The powers of present are , so the lowest is ; the powers of present are , so the lowest is . The common factor is . Dividing each term gives , (the sign travels with the term), and (never drop this trailing ).
Common traps
- Forgetting the trailing "1." When a term divides evenly by the common factor to give exactly (not ), that must still appear inside the bracket — dropping it, as could happen with the term above, is a very common slip.
- Taking out only part of the HCF. Pulling out from instead of noticing the full common factor is available leaves the bracket only partly simplified; always check both the numerical HCF and every variable's lowest shared power.
- Sign errors on negative terms. When a term inside the original expression is negative, its sign must be carried correctly into the bracket after division — must stay , not .
- Skipping the expand-back check. Not verifying the factorised form by multiplying the bracket out again is how small arithmetic mistakes go unnoticed, especially once there are three or more terms.
Ask the tutor: Want to practise finding the common factor in a four-term expression, or check whether you have pulled out the full HCF on a tricky example? Ask the AI tutor to work through more cases with you step by step.
How do I know when I have taken out the highest common factor and not just a common factor?
Check both parts separately. For the numbers, find the actual HCF of all the coefficients using factor trees or repeated division rather than stopping at the first common number you notice. For the letters, compare the power of each shared variable across every term and take the smallest one — that smallest shared power is as far as you can go. If, after dividing, the terms inside the bracket still share another common factor, you stopped too early.
What happens if there is no variable common to all the terms, only numbers?
That is perfectly fine — the common factor is then just a number. For example, has no shared letter since and are different variables, but and share the HCF , so it factorises as . A common factor extraction never requires both a numerical and a variable part; either one alone is enough to factorise.
Why does the bracket sometimes end up with a plain 1 or a negative number inside it?
Because dividing a term by the common factor does not always leave a variable behind. If a term equals the common factor exactly, dividing gives , and if the original term was negative, dividing preserves that negative sign. Both are ordinary results of division, not exceptions, so they must be written inside the bracket exactly as they come out — leaving out a or dropping a minus sign changes the value of the expression.