Factor
Find the greatest common factor coefficient by coefficient. The numerical coefficients are , whose greatest common divisor is .
Find the common variable powers. Every term contains to at least the first power and to at least the first power: the powers of are (minimum ) and of are (minimum ). So the full GCF is
Divide each term by 2mn, writing the quotients explicitly.
The third quotient is the step people get wrong: when a term is the GCF (up to sign), it does not vanish — it leaves behind .
Assemble the factored form.
Check whether the bracket factors further. is linear in both variables with no common factor (the blocks pulling out a ), so the factoring is complete.
Verify by expanding and by random substitution. Distributing back: , , ✓. Testing random pairs in gives agreement to machine precision at every point ✓.
Need to solve a different problem like this? Open the solver →