Use the Binomial Theorem to show that for any positive integer :
and hence find the remainder when is divided by , and determine the last digit of .
For any positive integer :
The general term is:
Write , so:
Apply the Binomial Theorem with , , :
From the expansion:
Every term from the third term onwards contains a factor of , so they are all divisible by .
Group the expansion:
Now:
So:
where is some positive integer.
The last digit of a number is its remainder when divided by .
Observe the pattern of last digits of powers of :
| Power | Value | Last Digit |
|---|---|---|
| 3 | ||
| 9 | ||
| 7 | ||
| 1 | ||
| 3 |
The last digits repeat with a cycle of 4:
Since , we have , which corresponds to the 4th position in the cycle.
Verification using Binomial Theorem:
Write :
All terms except the last contain a factor of (and hence does not divide them cleanly), but we need divisibility by . Instead, write :
Expanding:
Every term except the last contains a factor of , hence a factor of . Therefore:
The last digit of is .
| Question | Answer |
|---|---|
| Remainder when | |
| Last digit of |