Method 1: By Mathematical Induction
(1) We want to prove for all odd integers n > 0 the statement P(n) that 9n + 1n is a multiple of 10.

P(1) is true. If P(k) is true then consider P(k+2):
9k+2 + 1k+2 = 81(9k + 1k)-80
so P(k+2) is true and the result is true for all odd numbers by the axiom of induction.

Similarly 71 + 31 is a multiple of 10 and if 7k + 3k is a multiple of 10 then
7k+2 + 3k+2 = 49(7k) + 9(3k) = 40(7k) + 9(7k + 3k)
so this is also a multiple of 10 and the result is true for all odd numbers by the axiom of induction. Note that 92+12 and 72+32 are not multiples of 10 so the result is not true for even numbers.

(2) We have 80-20 and 82-22 are both multiples of 10. If 8k-2k is a multiple of 10 then
8k+2 - 2k+2 = 64(8k) - 4(2k) = 60(8k) +4(8k-2k)
so this is a multiple of 10 and the result is true for all even numbers. Similarly 62-42 is a multiple of 10 and if 6k-4k is a multiple of 10 then
6k+2 - 4k+2 = 36(6k) - 16(4k) = 20(6k) + 16(6k-4k)
which is a multiple of 10 and so the result is true for all even numbers.

Note that 8 - 2 and 6 - 4 are not multiples of 10 and the result is not true for odd powers.

(3) The corresponding results are 9n - 1n and 7n - 3n are multiples of 10 when n is an even number which can be proved by induction.

(4) Similarly 8n + 2n and 6n + 4n are multiples of 10 when n is an odd number which can be proved by induction.

Proof using the Binomial Theorem


7n + 3n = 7n + (10-7)n = 7n + 10n + ..... + (-7)n.
All the terms of the Binomial expansion involve powers of 10 apart from the term (-7)n so the expression is a multiple of 10 when n is odd but not when n is even. The same method works for all other parts of the question.