Prove that is divisible by .
Factor with the difference-of-cubes identity instead of computing the powers. Using with , :
The first factor already supplies a large chunk of .
Compare with the target . Since
the whole proof reduces to showing that the second factor is divisible by . Framing the goal this way is what turns a large computation into a small one.
Show the second factor is a multiple of 9. Both and are divisible by : and . Therefore every term in carries a factor :
so the second factor is times an integer, with no need to evaluate anything.
Assemble the conclusion.
which is times an integer, proving the divisibility.
Confirm with the actual numbers. The inner sum is , so
Direct computation agrees: and , and their difference is , with exactly.
Need to solve a different problem like this? Open the solver →