(i) If a number n is divisible by 8, then n=8k for some whole number k. So
n=2×4kandn=4×2k
which shows n is divisible by 2 and by 4. The statement is true.
(ii) No, it is not enough. That check would need the converse, ‘If a number is divisible by both 2 and 4, then it is divisible by 8’, and the converse is false.
Counterexample: 12 is divisible by 2 (12=2×6) and by 4 (12=4×3), but 12÷8=1.5, so 12 is not divisible by 8. (20 and 28 are other counterexamples.)
The reason is that 4=2×2 already contains the factor 2, so ‘divisible by 2 and 4’ tells us no more than ‘divisible by 4’. To test divisibility by 8 we must use its own shortcut: check whether the number formed by the last three digits is divisible by 8.