Sophie Germain Identity is the habit of factoring fourth-power expressions with $a^4+4b^4$ to unlock surprising product structure. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
The Sophie Germain identity factors $a^4 + 4b^4$ into two integer quadratics. It is one of the fastest ways to factor fourth-power expressions in contest algebra and number theory.
Why It Works
1
Start from $a^4 + 4b^4$ and add then subtract the same term $4a^2b^2$: $a^4 + 4a^2b^2 + 4b^4 - 4a^2b^2$.
2
The first three terms form a perfect square: $a^4 + 4a^2b^2 + 4b^4 = \left(a^2 + 2b^2\right)^2$, so the expression is $\left(a^2 + 2b^2\right)^2 - (2ab)^2$.
3
That is now a difference of squares $X^2 - Y^2$ with $X = a^2 + 2b^2$ and $Y = 2ab$, which factors as $(X - Y)(X + Y)$.
4
Therefore $a^4 + 4b^4 = \left(a^2 + 2b^2 - 2ab\right)\left(a^2 + 2b^2 + 2ab\right)$ — the Sophie Germain Identity.
Worked Examples
Example 1
Use Sophie Germain's identity to factor $a^4 + 4b^4$.
Each quadratic has discriminant $(-2)^2 - 4(1)(2) = -4 < 0$, so neither factors further over the reals — this is the complete factorization.
Answer:
$x^4 + 4 = (x^2 - 2x + 2)(x^2 + 2x + 2)$
Contest level
Prove that $3^{44}+4^{29}$ is composite without computing it.
1
Rewrite the expression so it has the form $a^4+4b^4$: $3^{44}+4^{29}=(3^{11})^4+4(4^7)^4$.
2
Apply Sophie Germain with $a=3^{11}$ and $b=4^7$.
3
The expression factors as $((3^{11})^2-2\cdot3^{11}\cdot4^7+2(4^7)^2)((3^{11})^2+2\cdot3^{11}\cdot4^7+2(4^7)^2)$.
4
Both factors are integers greater than $1$, so the original number is composite.
Answer:
$3^{44}+4^{29}$ is composite because it is a nontrivial product by $a^4+4b^4$ factorization.
Challenge
Find every prime $p$ that can be written as $p = n^4 + 4$ for some positive integer $n$.
1
Factor with the identity: $n^4 + 4 = (n^2 - 2n + 2)(n^2 + 2n + 2)$.
2
For the product to be prime, the smaller factor must equal $1$: $n^2 - 2n + 2 = (n-1)^2 + 1 = 1$, which forces $n = 1$.
3
At $n = 1$: $p = 1^4 + 4 = 5$, and indeed $5$ is prime. For every $n > 1$ both factors exceed $1$, so $n^4 + 4$ is composite.
Answer:
Only $p = 5$ (at $n = 1$).
Going Deeper
A common contest signal is an expression like $u^4+4v^4$, $x^4+4$, or $n^4+4^n$. First ask whether the non-fourth-power-looking term can be rewritten as $4b^4$.
It is really 'complete the square, then difference of squares' in disguise — the same two-step move factors relatives like $a^4 + a^2 + 1 = (a^2 - a + 1)(a^2 + a + 1)$.
Pitfall: the coefficient must be exactly $4b^4$. The bare $a^4 + b^4$ does not factor over the integers, so do not force the identity when the $4$ is missing.
Spot the Signal
Use it when you see a fourth power plus four times another fourth power: $a^4+4b^4$. Contest problems often hide this as $x^4+4$, $u^4+4v^4$, or $n^4+4^n$.
You can describe the hard part as factoring fourth-power expressions with $a^4+4b^4$ to unlock surprising product structure, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by rewriting the expression into the exact form $a^4+4b^4$, then applying $(a^2-2ab+2b^2)(a^2+2ab+2b^2)$.
Name the relation that makes Sophie Germain Identity legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Trying to use the identity on $a^4+b^4$ or on a term that is not exactly $4b^4$; the coefficient and fourth-power structure both matter.
Applying Sophie Germain Identity because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
First force the expression into $a^4+4b^4$; then the factorization does the heavy lifting.
Try it on:
Factor a fourth-power expression or prove a large number is composite using the Sophie Germain identity.