Factor completely:
Take the GCF of the coefficients. and , so their greatest common divisor is . Taking only or only would leave a factorable remainder, so the factoring would not be complete.
Take the lowest power of each variable that appears in both terms. Compare exponent by exponent: versus gives ; versus gives ; versus gives . The rule is always the minimum exponent, so the variable part of the GCF is .
Assemble the GCF.
Every variable happens to appear in both terms here, which is why none of them is left out.
Divide each term by .
so the bracket is , keeping the original minus sign between them.
Write the factorization and expand back.
Expanding: and ✓. Numerically at : the original is , and ✓. The bracket has no common factor left, so the factoring is complete.
Need to solve a different problem like this? Open the solver →