There are at least three methods of proving the results that
for odd values of
,
,
,
and
are multiples of 10
whereas, if
is even, then
,
,
and
are multiples of 10.
These results can be proved using the axiom of mathematical induction but
a simpler approach is to use the periodicity of the values of the last digit
for powers of integers. Emma from St Paul's Girls' School and Andrei from
Tudor Vianu
National College, Bucharest, Romania both used this method of solution.
As Andrei tabulated his results his solution is
shorter. Proof using the periodicity of last digits of powers of integers
I shall determine the last digit of each of the numbers:
.
The last digit of
is always 1, and for
it is always 6.
For, 2, 3, 7 and 8 the last digit of their powers repeats with
periodicity 4, as shown in the table:
| n (mod 4) |
0 |
1 |
2 |
3 |
| 2 |
6 |
2 |
4 |
8 |
| 3 |
1 |
3 |
9 |
7 |
| 7 |
1 |
7 |
9 |
3 |
| 8 |
6 |
8 |
4 |
2 |
For 4 and 9, the last digit of their powers repeats with
periodicity 2:
After creating these tables, I shall prove the required results:
(1) If
is odd, the last digit of
is 9, and as the last
digit of
is always 1, so the the last digit of
is 0,
and the number is a multiple of 10.
For
there are two possible cases:
(mod 4). Here
(mod 4). Here
(2) If
is even it is very easy to look in the table above to obtain the
desired results. First I look at
for different values of
- even.
If
(mod 4), then
.
If
(mod 4),
.
For,
, I also obtain (6-6) (mod 10) = 0 (mod 10).
(3) If
is even:
is a multiple of 10.
The proof derives evidently from the table. In a similar
manner,
is also a multiple of 10.
(4) If
odd:
and
are both multiples of
10. Proof using the Binomial Theorem
|
|
All the terms of the Binomial expansion involve powers of 10 apart
from the term
so the expression is a multiple of 10 when
is odd but not when
is even.
The same method works for all other parts of the question.