Factor
completely.
Make the two binomials match. The first term contains and the second . Since and squaring kills the sign,
Rewriting the first term with makes the shared structure visible; without this step the common factor is easy to miss entirely.
Rewrite the expression in matched form. The problem becomes
Now both terms visibly contain and at least one copy of .
Identify the greatest common factor. Comparing the two terms factor by factor: appears squared in both, and appears to the second power in the first term but only to the first power in the second. The GCF takes the lowest power of each:
Factor it out. Dividing each term by the GCF leaves from the first and from the second:
The is the part most often dropped — the second term does not vanish when the GCF is removed, it becomes .
State the answer and verify numerically. The complete factorisation is
and none of the three factors breaks down further over the rationals. Checking at , : the original gives and the factored form gives ✓; a second random pair agrees to nine digits as well.
Need to solve a different problem like this? Open the solver →