Question

How to solve criptarithmatic easily

Answer 1

Solving a cryptarithm by hand usually involves a mix of deductions and exhaustive tests of possibilities. For instance, the following sequence of deductions solves Dudeney's SEND + MORE = MONEY puzzle above (columns are numbered from right to left):
SEND
+. MORE
-------------------------
= MONEY

From column 5, M = 1 since it is the only carry-over possible from the sum of two single digit numbers in column 4.Since there is a carry in column 5, O must be less than or equal to M (from column 4). But O cannot be equal to M, so O is less than M. Therefore O = 0.Since O is 1 less than M, S is either 8 or 9 depending on whether there is a carry in column 3. But if there were a carry in column 3, N would be less than or equal to O (from column 3). This is impossible since O = 0. Therefore there is no carry in column 3 and S = 9.If there were no carry in column 3 then E = N, which is impossible. Therefore there is a carry and N = E + 1.If there were no carry in column 2, then ( N + R ) mod 10 = E, and N = E + 1, so ( E + 1 + R ) mod 10 = E which means ( 1 + R ) mod 10 = 0, so R = 9. But S = 9, so there must be a carry in column 2 so R = 8.To produce a carry in column 2, we must have D + E = 10 + Y.Y is at least 2 so D + E is at least 12.The only two pairs of available numbers that sum to at least 12 are (5,7) and (6,7) so either E = 7 or D = 7.Since N = E + 1, E can't be 7 because then N = 8 = R so D = 7.E can't be 6 because then N = 7 = D so E = 5 and N = 6.D + E = 12 so Y = 2.

The principle of the solution is to generate permutations of digits 0-9 and then solve the algebraic expressions.

It is also interesting to note that when the leading digits (in this case S and M) is allowed to be zero, the solution is no longer unique. In fact, it has 25 possible solutions.