Theorem
is divisible by
Algebra • Divisibility and Remainders
Formula
For integers and every natural number : , so is divisible by .
How to use it
- 1Why it works: put in and you get , so is a factor of (factor theorem). Then put .
- 2To show a sum of powers is divisible by , pair the terms so that each pair is with a multiple of .
- 3Pair the terms in two ways to get two divisors; if they have no common factor, their product also divides.
Worked example
Show that is divisible by for every natural number .
Step-by-step
- 1has the form with ,
- 2
Why: is always a multiple of .
- 3So divides ; check :
Answer
is divisible by for every .
Watch out
This is about a difference of the same power. A sum is divisible by only when is odd.
Builds on
Also known as
a^n - b^n divisible by a - b, x - y divides x^n - y^n, difference of powers factor