Cryptarithm Puzzles 47
- ALPHABETICAL SUMS
There is a family resemblance between puzzles where an arithmetical
working has to be reconstructed from a few figures and a number of asterisks,
and those in which every digit is represented by a letter, but they are really
quite different. The resemblance lies in the similarity of the process of solving.
Here is a little example of the latter class. It can hardly be called difficult.
PR)MTVVR(RSR
MVR
KKV
KMD
MVR
MVR
Can you reconstruct this simple division sum? Every digit is represented by
a different letter.
- ALPHABETICAL ARITHMETIC
Here is a subtraction puzzle that will keep the reader agreeably employed
for several minutes.
Let AB multiplied by C = DE. When DE is taken from FG, the result is
HI:
FG
DE
HI
Each letter stands for a different figure (1,2,3,4,5, 6, 7, 8, or 9) and 0 is
not allowed.
- FIGURES FOR LETTERS
Professor Rackbrane the other morning gave his young friends this rather
difficult problem. He wrote down the letters of the alphabet in this order:
ABCD X EFGHI = ACGEFHIBD