(i)
−8+1−3+6−0+4=0
0 is a multiple of 11, so 813604 is valid (813604=11×73964).
(ii) Call the smudged digit d:
−9+d−5+3−8+6=d−13
Since d is between 0 and 9, d−13 lies between −13 and −4. The only multiple of 11 in that range is −11, so d−13=−11 and the missing digit is d=2. The code is 925386=11×84126.
(iii) For 831604:
−8+3−1+6−0+4=4
4 is not a multiple of 11, so 831604 leaves 4 over and is not valid.
Why every such swap is caught: two neighbouring digits always get opposite signs. If the digits are x (with '+') and y (with '–'), they add x−y to the alternating sum; after the swap they add y−x. All the other digits keep their signs, so the alternating sum changes by (y−x)−(x−y)=2(y−x).
Since x and y are different digits, 2(y−x) is an even number between −18 and 18 that is not 0. The multiples of 11 in that range are −11, 0 and 11; the change is not 0, and it is even while ±11 are odd. So the change is not a multiple of 11. The old sum was a multiple of 11, so the new sum is not, and the swapped code always fails the check.