Crypt.2018.1
+ M S M O E O N N R E D E Y
For the above alphametic problem in base 10, there is only one probable solution. Each letter represents different digit. Whats the value of S E N D − M O R E ?
The answer is 8482.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
This is an old problem. It's a good one and I am glad to see it, but the author might want to specify that it is not original with him.
Log in to reply
Yup, this one is dated back to 1924, I guess. In 1924, July Henry Dudeney published a classic example in the Strand Magazine associating with the story of a kidnapper’s ransom demand. This doesn't belong to me, for sure.
M = 1
S + 1 = 1 0 + O
Two options S = 9 , O = 0 which works
S = 8 , 0 = 2 which does not
E + 0 = n no way, therefore E + 1 = N
N + R = 1 0 + E = 1 0 + N − 1 , R = 9 no way, therefore N + R + 1 = 1 0 + E = 1 0 + N − 1 , R = 8
D + E = 1 0 + Y but E has to have N above it and only digits up to 7 are left, so D = 7 , Y = 2 , E = 5 , N = 6