I wish it provide some insight as to how. I can't seem to grasp the fact that this can be solved _in a matter of seconds_.
I wish it provide some insight as to how. I can't seem to grasp the fact that this can be solved _in a matter of seconds_.
Since the sum has one more digit than any of the addends, the first column needs to receive a carry to not sum to 0, and since that carry has to be 1, M must be 1.
How you go from that to solving the rest in a matter of seconds, I don’t know.
If M=1, then S must equal 8 or 9 since MORE can be at most 1987.
Consider O, which is in MORE and MONEY. O cannot be 1 (which is M), and it cannot be 2 or more, since then MONEY - MORE > 10000, so O must be 0 (zero).
Considering the hundreds place, E + 0 = E + 0 (zero) = N, so there must be a carry from the previous digit, and N = E + 1
I'm getting a little stuck now, but there must be some more tricks to take it further, presumably since we know N + R > 9 (due to our above carry), etc.
9END
10RE
-------
10NEY
Let's have a look at "E + 0 = N", there must be a carry involved, from which follows (considering 0, 1, 9 are already used): N = E + 1, N < 9, E < 8
Considering "N + R = E", which must produce a carry: N + R > 9, E < 6, E > 1, R > 4
So "E" must be in (2, 3, 4, 5), also, substituting "N", there's this interesting notion of (1 +)? E + 1 + R = 10 + E