Definition. A surd is an irrational number expressible as the root of a rational number — that
Is, an expression of the form n where n∈Q+ and
n∈/Q.
The most familiar surds are \sqrt{2}$$\sqrt{3}$$\sqrt{5}And so on. The set of surds is a Subset of
the algebraic numbers, and they arise whenever we solve equations of degree 2 or Higher.
These follow directly from the laws of indices (which we prove in Section 2), since
a=a1/2.
Rationalising the denominator. If a fraction has a surd in the denominator, we multiply
Numerator and denominator by the surd (or its conjugate) to eliminate it.
For a denominator of the form aMultiply by L◆B◆a◆RB◆◆LB◆a◆RB◆:
:::caution A common error is to “rationalise” by splitting the fraction:
L◆B◆a+bc◆RB◆◆LB◆d◆RB◆=da+b◆LB◆dc◆RB◆ . Always
distribute the Denominator correctly.
:::
1.2 Irrationality of 2
Theorem.2 is irrational.
Proof. We proceed by contradiction. Assume 2 is rational. Then 2=qp
Where p, q \in \mathbb{Z}^+$$q \neq 0And gcd(p,q)=1 (i.e., the fraction is in lowest Terms).
22P2=qp=q2p2=2q2
Since p2=2q2We have that p2 is even. A standard result (proved below) tells us that if
p2 is even, then p is even. So p=2k for some integer k.
Substituting: (2k)2=2q2So 4k2=2q2Hence q2=2k2.
By the same argument, q2 is even, so q is even. But this contradicts gcd(p,q)=1 since
Both p and q are divisible by 2. Therefore our assumption was false, and 2 is
Irrational. ■
Lemma. If p2 is even, then p is even.
Proof. The contrapositive: if p is odd, then p2 is odd. If p=2k+1Then
p2=4k2+4k+1=2(2k2+2k)+1Which is odd. ■
Intuition. This proof exploits the structure of divisibility: the number 2 has a unique prime
Factorisation, and squaring preserves parity. The contradiction arises because 2 “forces” factors
Of 2 into both p and qMaking the fraction reducible.
2. Indices (Exponent Laws)
Definition. For a>0 and n∈Z+We define
an=◆LB◆a×a×⋯×a◆RB◆ntimes. We extend this
Definition as follows:
The extension to rational and real exponents requires more sophisticated machinery (continuity
Arguments and the exponential function), which we develop in
Exponentials and Logarithms.
Intuition. Exponentiation is repeated multiplication, so multiplying two powers of the same base
Adds the counts. Just as 3×5 counts 3+5 groups of size 1, a3⋅a5 counts
3+5=8 factors of a.
3. Algebraic Manipulation
3.1 Expanding Brackets
The distributive law is the foundation: a(b+c)=ab+ac.
For two brackets: (a+b)(c+d)=ac+ad+bc+bd.
Proof. By applying the distributive law twice:
(a+b)(c+d)=a(c+d)+b(c+d)=ac+ad+bc+bd■
3.2 Factorisation
Factorisation is the reverse of expansion. The key techniques are:
Common factors:ab+ac=a(b+c)
Difference of two squares:a2−b2=(a−b)(a+b)
Trinomial (quadratic):ax2+bx+c=(px+q)(rx+s) where pr = a$$ps + qr = bqs=c
Grouping:ab+ac+db+dc=a(b+c)+d(b+c)=(a+d)(b+c)
Theorem (Difference of Two Squares).a2−b2=(a−b)(a+b).
Proof. Direct expansion:
(a−b)(a+b)=a2+ab−ab−b2=a2−b2■
3.3 Factorising Cubics
A cubic ax3+bx2+cx+d can be factorised by finding one root α (using the Factor
Theorem), then dividing by (x−α) to obtain a quadratic, which can then be factorised.
4. Polynomial Division
4.1 Long Division
Polynomial long division mirrors integer long division exactly. We demonstrate with an example, then
State the general theorem.
More systematically, the division algorithm tells us:
Theorem (Polynomial Division Algorithm). For polynomials f(x) and g(x) with g(x)=0
There exist unique polynomials q(x) (the quotient) and r(x) (the remainder) such that:
f(x)=g(x)⋅q(x)+r(x)
Where deg(r)<deg(g) or r(x)=0.
Intuition. This is exactly analogous to integer division: 47=5×9+2Where
0≤2<5. In polynomials, the “size” ordering is replaced by degree, and the remainder must
Have smaller degree than the divisor.
4.2 Why Polynomial Division Mirrors Integer Long Division
The structural analogy is deep. Both are instances of a Euclidean domain — an algebraic structure
Where we can perform division with remainder. In ZThe “degree” is the absolute value; In
R[x]The degree is the polynomial degree. The algorithm is the same: at each step,
Eliminate the leading term.
5. The Factor Theorem and Remainder Theorem
5.1 The Remainder Theorem
Theorem (Remainder Theorem). If a polynomial f(x) is divided by (x−a)The remainder is
f(a).
Proof. By the division algorithm, f(x)=(x−a)⋅q(x)+rWhere r is a constant (since
deg(r)<deg(x−a)=1).
Substituting x=a:
F(a)=(a−a)⋅q(a)+r=0⋅q(a)+r=r■
Intuition. When you plug in x=aThe (x−a) factor vanishes, leaving only the remainder. The
remainder is the “leftover” that doesn’t contain the factor (x−a).
5.2 The Factor Theorem
Theorem (Factor Theorem).(x−a) is a factor of f(x) if and only if f(a)=0.
Proof.
(⇒) If (x−a) is a factor, then f(x)=(x−a)⋅q(x). Setting x=a:
f(a)=(a−a)⋅q(a)=0.
(⇐) If f(a)=0Then by the Remainder Theorem, the remainder upon division by (x−a)
is f(a)=0. So f(x)=(x−a)⋅q(x)Meaning (x−a) is a factor. ■
Intuition. The Factor Theorem connects algebra (polynomials) to geometry (roots on the x-axis).
A root x=a means the graph crosses the x-axis at aWhich means (x−a) must divide the
Polynomial.
Example
Show that $(x - 2)$ is a factor of $f(x) = x^3 - 3x^2 + 4$.
By the Factor Theorem, we check f(2):
F(2)=23−3(2)2+4=8−12+4=0
Since f(2)=0, (x−2) is a factor. To find the remaining factor, we perform polynomial
Division:
:::caution You can only cancel factors, not terms. xx+3 is NOT equal to 3. The x
In the denominator is a factor of the whole expression, but the x in the numerator is only one
Term.
:::
If you get this wrong, revise: [Algebraic fractions](#6-simplifying-algebraic-fractions) and [Quadratics](./02-quadratics.md)
Problem 11. Given that x3+ax2+bx+c is exactly divisible by (x−1)2 and leaves
Remainder 12 when divided by (x+2)Find a, bAnd c.
Solution
Since $(x - 1)^2$ is a factor, both $f(1) = 0$ and $f'(1) = 0$.
F(1)F′(x)F′(1)=1+a+b+c=0−−−(1)=3x2+2ax+b=3+2a+b=0−−−(2)
Also f(−2)=12:
−8+4a−2b+c4a−2b+c=12=20−−−(3)
From (2): b=−3−2a.
From (1): c=−1−a−b=−1−a+3+2a=2+a.
Substituting into (3): 4a−2(−3−2a)+(2+a)=20
4a+6+4a+2+a=20⟹9a+8=20⟹a=912=34
b=−3−38=−317,c=2+34=310
If you get this wrong, revise: [Remainder and Factor theorems](#5-the-factor-theorem-and-remainder-theorem)
Problem 12. Simplify x2+5x+6x2−9÷x2−x−6x2−4x+3.
Solution
Factorise all quadratics:
(x+2)(x+3)(x−3)(x+3)÷(x−3)(x+2)(x−1)(x−3)=(x+2)(x+3)(x−3)(x+3)×(x−1)(x−3)(x−3)(x+2)=(x+2)(x+3)(x−1)(x−3)(x−3)2(x+3)(x+2)=x−1x−3
For x=−3,−2,1,3.
If you get this wrong, revise: [Factorisation](#32-factorisation) and [Algebraic fractions](#6-simplifying-algebraic-fractions)
Problem 13. Find the value of k such that x2+kx+(k+3) is a perfect square.
Solution
A perfect square has discriminant $\Delta = 0$:
K2−4(k+3)K2−4k−12(k−6)(k+2)=0=0=0
k=6: gives x2+6x+9=(x+3)2 ✓
k=−2: gives x2−2x+1=(x−1)2 ✓
If you get this wrong, revise: [Quadratics](./02-quadratics.md)
:::tip Diagnostic Test Ready to test your understanding of Algebraic Expressions? The contains the hardest
questions within the A-Level specification for this topic, each with a full worked solution.
Unit tests probe edge cases and common misconceptions. Integration tests combine Algebraic
Expressions with other pure mathematics topics to test synthesis under exam conditions.
See for instructions on self-marking and
building a personal test matrix.
Common Pitfalls
Rounding too early in multi-step calculations — carry full precision through and round only the
final answer.
Forgetting the +c constant of integration in indefinite integrals, or misusing boundary
conditions in definite integrals.
Misreading the question, particularly with ‘hence’ vs ‘hence or otherwise’ — the former requires
using previous work.
Losing marks by not showing sufficient working — always write out each step, especially in proof
questions.
Summary
The key principles covered in this topic are linked in the sub-pages above. Focus on understanding
the definitions, applying the formulas or frameworks, and evaluating strengths and limitations of
each approach.
Worked Examples
Worked examples demonstrating the application of key concepts are covered in the detailed sub-pages
linked above.