Show that 2n divides an integer N if and only if 2n divides the number made up of the last n digits of N.
[Hint: 10k = 2k 5k ≡ 0 (mod 2n) for k ≥ n.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.