Factor
as completely as possible over the integers, and find its roots.
Pull out the greatest common factor. The coefficients , and are all divisible by (and by no larger common factor, since and ):
Check each: ✓, ✓, ✓.
Attempt the AC method on the inner trinomial. Factoring over the integers needs two numbers with product and sum . The factor pairs of are , giving sums — and negating both members of a pair only negates the sum. None equals , so no integer factorisation exists.
Confirm with the discriminant. For :
and is not a perfect square (, ). A non-square discriminant is exactly the criterion for "does not factor over the rationals".
Reject a factorisation that circulates for this problem. The answer is sometimes given, but expanding it yields
The middle coefficient is , not . Substituting settles it: the original gives , while — not equal.
Find the exact roots with the quadratic formula. Solving :
where . Numerically, with :
State the complete factorisation and verify. Over the reals,
while over the integers the best possible is . Both roots evaluate the original expression to within of zero ✓, and the GCF step was checked at integer values ✓.
Need to solve a different problem like this? Open the solver →