Factor
for any positive integer .
Show must be a factor. Treat the expression as a polynomial in and substitute :
By the factor theorem this holds for every , so always divides — no parity condition, unlike the sum , which needs odd.
State the identity.
The cofactor has exactly terms, every one of total degree , and all signs are positive.
Prove it by telescoping. Distribute the two terms of over the sum:
Subtracting, every term except the first of the top row and the last of the bottom row cancels, leaving exactly ✓.
Check the small cases.
These are the familiar difference of squares and difference of cubes — both special cases of the one identity. Numerically the general formula was confirmed for every from to across integer pairs each ✓.
Note when more factoring is available. If is composite, say , the expression also equals and splits again — which is how gains the extra factors and . A useful consequence in number theory: always divides for integers, so for example is always divisible by .
Need to solve a different problem like this? Open the solver →