Correct
Alex Y
That solution is unique.
A solution not requiring silicon:
j is 0 since abcdefghij is divisible by 10 (your rationale for j=0 is correct, but this seems easier ;-) )
e=5
As you mentioned, every other letter is an even digit.
d+e+f is a multiple of 3 (skipping a step here, as I will in the future without explanation, but ask if not clear. a+b+c is a multiple of 3 as is a+b+c+d+e+f, so d+e+f is also a multiple of 3), so the only pairs of even digits for d and f are 2&8 and 4&6
abcd is a multiple of 4, and since c is odd, d is not a multiple of 4. Thus def is 654 or 258
fgh is a multiple of 8, and since f is a multiple of 4, gh is a multiple of 8. Since g is odd, h is not a multiple of 4.
So now we have (case1) a8c654g2i0 or (case2) a4c258g6i0
Since gh is a multiple of 8 and g+h+i is a multiple of 3, we have ghi = 321 or 729 for the first case, or 963 in the second case.
The second case completions then become 1472589630 and 7412589630. Using plain old long division on the first seven digits, we find that
1472589=6mod7 X
7412589=2mod7 X
(BTW, I've seen three rules for determining divisibility by 7, but they all seem to me to be at least as calculation-intensive as using long division, just tracking the remainders.)
The first case has four subcases, which check out as follows:
7896543 = 4mod7 X
9876543 = 5mod7 X
1836547 = 6mod7 X
3816547 = 0mod7 That's it! 3816547290