Algebraic Manipulation
Factoring tricks (SFFT, difference of squares, sum of cubes), telescoping products, clever substitution, symmetric expressions
What you need to know
- Squares. and (read each as throughout, or as throughout). Example: .
- Cubes. , , and . Example: if and , then . (Check: and are and , and .)
- Simon's Favorite Factoring Trick. . So for , add to both sides to get , then list the factor pairs of . Example: becomes .
- Three variables. , and . Example: if and , then (check with , , ).
- Two rarer factorizations. The Sophie Germain Identity , and . Example: with , : .
- A number plus its reciprocal. Let . Then (because ) and . Example: if , then and .
- Telescoping products. Factor every term and neighbors cancel. Example: , so .
How AMC 10 tests it
- Problems 3–10: a number expression such as or . Brute force is possible, but an identity makes it instant.
- Problems 8–15: "find all positive integers with ". Use Simon's Favorite Factoring Trick, then count or add up the solutions from the factor pairs.
- Problems 10–16: given , find , such as .
- Problems 12–18: a long product like or that telescopes after factoring.
- Problems 15–22: three unknowns with , and given (or findable), asking for or a similar sum of powers.
Standard approaches
- Before computing, ask whether the expression is a difference of squares, a perfect square, or a sum or difference of cubes in disguise.
- If an equation has an term plus and terms, rearrange it for Simon's Favorite Factoring Trick. List all factor pairs of the constant, including negative ones.
- For , call it and climb one power at a time: . Example: with , . (Given instead? Square it and add to get .)
- For long products or sums, factor every term completely and write out three or four terms in a row to see what cancels.
- If a number expression looks designed, replace the big number by and simplify with algebra. Example: , so with , .
Worked example
How many ordered pairs of integers satisfy ?
(A) (B) (C) (D) (E)
The first two terms share an , so write the equation as . To get a second we need , so subtract from both sides:
Now and are integers that multiply to . Each way to write with integers , gives exactly one solution, and . For example, , gives , and indeed .
Count the pairs . Since , it has positive divisors: . Each one can be , with , so there are ordered pairs with both factors positive. Making both factors negative gives more, such as . That is pairs in all.
The answer is .
Pitfalls
- Forgetting the negative factor pairs in Simon's Favorite Factoring Trick, which cuts the count in half. Or adding the extra constant to only one side.
- Sign mistakes between and , or in . Example: has in its second factor, not .
- Multiplying out a designed number expression by hand instead of replacing the big number with a letter.
- In telescoping products, cancelling correctly but losing track of which terms survive at each end. Example: in , only the last top and the first bottom survive, leaving .
Traps that recur
- Trying to reduce 2^202 by finding the order of 2 modulo the divisor, or forgetting to check that 201 is smaller than the divisor. (2020 AMC 10B #22)
- Trying to solve the system directly or subtracting the equations instead of adding them; the sum is the one combination that collapses to a sum of squares. (2012 AMC 10A #24)
- Trying to solve the two equations for a, b, c individually; the system has infinitely many solutions, and the target expression is the same for all of them. (2002 AMC 10B #20)
- Using 13 as a + b + c (each edge length appears 4 times, so a + b + c = 13/4) or 11/2 as ab + bc + ca instead of 11/4. (2023 AMC 10B #17)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.