Overview
Many olympiad problems involve expressions that appear impossible to factor at first glance. One particularly important example is an expression of the form
Although this does not resemble any standard factorisation, it can be factored using the Sophie Germain Identity.
This identity appears frequently in olympiad algebra, number theory, and Diophantine equations. Recognising it can turn a difficult looking quartic expression into a far more simple factorisation.
Motivation
Consider the expression
Initially it is not obvious how to factor it.
It is not a difference of squares, not a sum or difference of cubes, and common factorisation techniques do not seem to apply.
However, if we rewrite the constant term as
then the expression becomes
which is of the form
This suggests that a special factorisation may exist.
The Identity
For all real numbers and ,
This factorisation is named after the French mathematician Sophie Germain.
Proof
The identity looks unusual at first, but it follows naturally from the difference of squares.
Start with
Add and subtract :
The first three terms form a perfect square:
Now apply the difference of squares formula:
This gives
which can be rearranged as
This proves the identity.
Recognising the Pattern
The most important skill is recognising when the identity can be applied.
Look for expressions that resemble
Common examples include:
In each case, try to rewrite the expression in the form
Once you see the pattern, the factorisation becomes easier.
Worked Examples
Example 1
Factor .
Rewrite as
Applying Sophie Germain with and gives
Example 2
Factor .
Observe that
and
Therefore
Applying the identity with and :
Example 3
Factor .
Rewrite as
which is in the form with and .
Applying the identity:
Applications
The Sophie Germain Identity is also useful in other cases beyond simple factorisation.
Divisibility Problems
Factoring a quartic expression often contains less obvious divisibility properties.
For example,
Any divisor of either factor is automatically a divisor of the original expression.
Diophantine Equations
Many olympiad problems involving integer solutions can be simplified by factoring quartic expressions.
Instead of solving
directly, it is often easier to look at
This converts the problem into one involving products of integers.
Number Theory
The identity played an important role in Sophie Germain's work on Fermat's Last Theorem and remains a useful tool in modern olympiad number theory.
Key Contest Insight
When you see
or something that can be rewritten into that form, your first instinct should be to try Sophie Germain.
Many contest problems are designed so that recognising the identity is the main difficulty. Once the factorisation is found, the remainder of the problem is often straightforward.
Strategy Tips
- Always look for hidden fourth powers.
- Rewrite constants whenever possible.
- Try adding and subtracting terms to create a difference of squares.
- Check whether a quartic expression resembles .
- In number theory problems, factor first before attempting modular arithmetic or considering cases.
Common Pitfalls
- Forgetting the coefficient in the identity.
- Applying the identity to expressions that are not of the form .
- Expanding incorrectly after substitution.
- Missing opportunities to rewrite constants as fourth powers.
Practice Problems
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| AMC 10B | Hard | Show TagsAlgebra, Factorization, Sophie Germain Identity | ||||
| Berkeley Math Circle | Hard | Show TagsFactorization techniques, Techniques: modulo, size analysis, order analysis, inequalities | ||||
| Berkeley Math Circle | Hard | Show TagsChinese remainder theorem, Factorization techniques | ||||
| Berkeley Math Circle Monthly Contest 7 | Hard | Show TagsFactorization techniques, Greatest common divisors (gcd) | ||||
| MathNet | Hard | Show TagsComplex numbers, Factorization techniques | ||||
| Berkeley Math Circle Monthly Contest 3 | Hard | Show TagsFactorization techniques, τ (number of divisors) | ||||
| Berkeley Math Circle: Monthly Contest 8 | Hard | Show TagsFactorization techniques, Polynomial operations | ||||
| Berkeley Math Circle Monthly Contest 1 | Hard | Show TagsFactorization techniques, Fermat / Euler / Wilson theorems, Integers, Techniques: modulo, size analysis, order analysis, inequalities | ||||
| Berkeley Math Circle | Hard | Show TagsFactorization techniques | ||||
| Berkeley Math Circle Monthly Contest 6 | Hard | Show TagsFactorization techniques, Integers | ||||
| Berkeley Math Circle Monthly Contest 3 | Hard | Show TagsFactorization techniques, Polynomial operations, Prime numbers | ||||
| Berkeley Math Circle | Hard | Show TagsFactorization techniques, Techniques: modulo, size analysis, order analysis, inequalities | ||||
| Berkeley Math Circle Monthly Contest 6 | Hard | Show TagsFactorization techniques | ||||
| Berkeley Math Circle Monthly Contest 3 | Hard | Show TagsFactorization techniques, Multiplicative order | ||||
| Berkeley Math Circle: Monthly Contest 6 | Hard | Show TagsFactorization techniques, Floors and ceilings | ||||
| Berkeley Math Circle | Hard | Show TagsCounting two ways, Factorization techniques, τ (number of divisors) | ||||
| Berkeley Math Circle Monthly Contest 5 | Hard | Show TagsFactorization techniques, Polynomial operations, Sums and products, Techniques: modulo, size analysis, order analysis, inequalities | ||||
| Berkeley Math Circle Monthly Contest 4 | Hard | Show TagsFactorization techniques, Integers, Polynomial operations | ||||
| Berkeley Math Circle: Monthly Contest 1 | Hard | Show TagsFactorization techniques | ||||
| Berkeley Math Circle Monthly Contest 7 | Hard | Show TagsFactorization techniques, Integers | ||||
| MathNet | Hard | Show TagsFactorization techniques, Polynomial operations | ||||
| Berkeley Math Circle Monthly Contest 4 | Hard | Show TagsFactorization techniques, Induction / smoothing | ||||
Module Progress:
Join the Discord Community!
Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.
