Professional Documents
Culture Documents
Crypt Arithmatic Problem Solution
Crypt Arithmatic Problem Solution
from 0 to 9.
_
_DONALD
+GERALD
_ == == == == == ==
_ROBERT
2. Since O + E = O, and E cannot be zero (0 is already taken), this addition can only be possible
if E = 9. Then, O + 9 = O is only possible if we have a carry-over of 1 from the addition to its
right, (N + R = B).
We observe that O + 9 = O, which means that the result is > 10, and we must have a carry-over
of 1. We have:
__1___1
_5ONAL5
+G9RAL5
_ == == == == == ==
_ROB9R0
3. Since A + A = 9, we must have a carry-over from the previous column (from column L + L =
R), and A must equal to 4 (i.e. 4 + 4 + 1 = 9). Thus, A=4.
__1__11
_5ON4L5
+G9R4L5
_ == == == == == ==
_ROB9R0
__11_11
_5ON4L5
+G974L5
_ == == == == == ==
_7OB970
Adding 526485 with197485 gives the result: 723970, therefore the addition is correct. The
mapping is thus:
0 = T, 1 = G, 2 = O, 3 = B, 4 = A, 5 = D, 6 = N, 7 = R, 8 = L, 9 = E
Send+more=money steps.
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):
1. From column 5, M = 1 since it is the only carry-over possible from the sum of two single
digit numbers in column 4.
2. To produce a carry from column 4 to column 5, S + M is at least 9, so S is 8 or 9, so S +
M is 9 or 10, and so O is 0 or 1. But M = 1, so O = 0.
3. If there were a carry from column 3 to column 4 then E = 9 and so N = 0. But O = 0, so
there is no carry, and S = 9.
4. If there were no carry from column 2 to column 3 then E = N, which is impossible.
Therefore there is a carry and N = E + 1.
5. If there were no carry from column 1 to column 2, then N + R = E mod 10, and N = E +
1, so E + 1 + R = E mod 10, so R = 9. But S = 9, so there must be a carry from column 1
to column 2 and R = 8.
6. To produce a carry from column 1 to column 2, we must have D + E = 10 + Y. As Y
cannot be 0 or 1, D + E is at least 12. As D is at most 7, then E is at least 5. Also, N is at
most 7, and N = E + 1. So E is 5 or 6.
7. If E were 6 then to make D + E at least 12, D would have to be 7. But N = E + 1, so N
would also be 7, which is impossible. Therefore E = 5 and N = 6.
8. To make D + E at least 12 we must have D = 7, and so Y = 2.
url for cross+ road = danger
http://cryptarithms.awardspace.us/puzzle46.html
If we use numbers, R must be even cause at the end S + S = R ( Odd + Odd and
Even + Even both equal Even, so R's got to be Even )
First conclusion: R is even ( Say, 2, 4, 6, 8, since solution set doesn't consist of any
0 ( i.e. 1-9 only, possibly ) )
Now CROSS
+ROADS
------
DANGER
As you'd notice, D is extra, like something carried over in addition. So D's got to be
1 since any sum of 1-9 will can can give a carry of 1 alone.
If A: C+R C+R
Case 2:
3+9 || 9+3
4+8 || 8+4
5+7 || 7+5
( Other combo's not possible cause C!=R )
Case 3:
4+9 || 9+4
5+8 || 8+5
6+7 || 7+6
Case 4:
5+9 || 9+5
6+8 || 8+6
Case 5:
6+9 || 9+6
7+8 || 8+7
Case 6:
7+9 || 9+7
Case 7:
8+9 || 9+8
Case 8:
Not Possible as ( 9,9 ) is the only case and C!=R ( Assumed at the beginning of this
puzzle solving )
So far,
A = ( 2, 3, 4, 5, 7 ) [6's totally Odd for values of R]
D=1
C = ( 4, 5, 6, 7, 8, 9 )
R = ( 4, 6, 8 )
From R + O = N, we get R = N - O
Thus,
If R: N-O
Case 4:
9-5
7-3
6-2
Case 6:
9-3
8-2
Case 8:
Not possible as 1's already taken by D ( 9-1 being the only possible way )
N = ( 6, 7, 8, 9 )
O = ( 2, 3, 5 )
A = ( 2, 3, 4, 5 )
D=(1)
C = ( 4, 5, 6, 7, 8, 9 )
R = ( 4, 6 )
Now similarly, G = O + A
Thus, O = G - A
If O: G-A
Case 2:
7-5
6-4
5-3
Case 3:
8-5
7-4
5-2
( 6-3 not Possible as O!=A, thus I G can't be 6 and A can't be 3 )
Case 5:
9-4
8-3
7-2
First, A is now ( 2, 4, 5 )
Second, G is ( 5, 7, 8, 9 )
Continuing,
We now have:
A = ( 2, 4, 5 )
D=(1)
C = ( 4, 5, 6, 7, 8, 9 )
R = ( 4, 6 )
O = ( 2, 3, 5 )
N = ( 6, 7, 8, 9 )
G = ( 5, 7, 8, 9 )
If R: S+S
Case 4:
2+2
Case 6:
3+3
Therefore, S = ( 2,3 )
Thus, E = ( 3,4 )
So this far,
D=(1)
A = ( 2, 4, 5 )
C = ( 4, 5, 6, 7, 8, 9 )
R = ( 4, 6 )
N = ( 6, 7, 8, 9 )
O = ( 2, 3, 5 )
G = ( 5, 7, 8, 9 )
S = ( 2, 3 )
E = ( 3, 4 )
Not being able to proceed more as I did so long, I try to apply the smallest value
sets to the solution of bigger sets.
Now if S is 3, we have:
E=S+D=4
R=S+S=6
D=(1)
A = ( 2, 5 )
C = ( 5, 7, 8, 9 )
R=(6)
N = ( 6, 7, 8, 9 )
O = ( 2, 3, 5 )
G = ( 5, 7, 8, 9 )
S=(3)
E=(4)
Thus only 9 + 6 satisfies it for A = 5 and 12 isn't possible with the remaining
values.
Hence, A = ( 5 ) and C = ( 9 )
D=(1)
A=(5)
C=(9)
R=(6)
S=(3)
E=(4)
N = ( 7, 8 )
O=(2)
G = ( 7, 8 )
D=1
A=5
N=8
G=7
E=4
R=6
C=9
O=2
S=3
Or in numeric order:
D=1
O=2
S=3
E=4
A=5
R=6
G=7
N=8
C=9
P.s. Am attaching the TXT format in case the formatting I typed this in isn't
showing well for reading here.