Verbalarithmetic, also known as alphametics, cryptarithmetic, cryptarithm or wordaddition, is a type of mathematical gameconsisting of a mathematical equation among unknown numbers, whose digits are represented by letters. The goal is to identify the value of each letter. The name can be extended to puzzles that use non-alphabetic symbols instead of letters. The equation is typically a basic operation of arithmetic, such as addition, multiplication, or division. The classic example, published in the July 1924 issue of Strand Magazine by Henry Dudeney, is: The solution to this puzzle is O = 0, M = 1, Y = 2, E = 5, N = 6, D = 7, R = 8, and S = 9. Traditionally, each letter should represent a different digit, and the leading digit of a multi-digit number must not be zero. A good puzzle should have a unique solution, and the letters should make up a phrase. Verbal arithmetic can be useful as a motivation and source of exercises in the teaching of algebra.
History
Cryptarithmic puzzles are quite old and their inventor is not known. An 1864 example in The American Agriculturist disproves the popular notion that it was invented by Sam Loyd. The name "cryptarithm" was coined by puzzlist Minos in the May 1931 issue of Sphinx, a Belgian magazine of recreational mathematics, and was translated as "cryptarithmetic" by Maurice Kraitchik in 1942. In 1955, J. A. H. Hunter introduced the word "alphametic" to designate cryptarithms, such as Dudeney's, whose letters form meaningful words or phrases.
Types of cryptarithms
Types of cryptarithm include the alphametic, the digimetic, and the skeletal division. ;Alphametic ;Digimetic ;Skeletal division ;Reverse cryptarithm
Solving cryptarithms
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 :
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. 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 4. But if there were a carry in column 4, N would be less than or equal to O. 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 mod 10 = E, and N = E + 1, so mod 10 = E which means 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 and 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 use of modular arithmetic often helps. For example, use of mod-10 arithmetic allows the columns of an addition problem to be treated as simultaneous equations, while the use of mod-2 arithmetic allows inferences based on the parity of the variables. In computer science, cryptarithms provide good examples to illustrate the brute force method, and algorithms that generate all permutations of m choices from n possibilities. For example, the Dudeney puzzle above can be solved by testing all assignments of eight values among the digits 0 to 9 to the eight letters S,E,N,D,M,O,R,Y, giving 1,814,400 possibilities. They also provide good examples for backtracking paradigm of algorithm design.
Other information
When generalized to arbitrary bases, the problem of determining if a cryptarithm has a solution is NP-complete. Alphametics can be combined with other number puzzles such as Sudoku and Kakuro to create cryptic Sudoku and Kakuro.
Longest alphametics
Anton Pavlis constructed an alphametic in 1983 with 41 addends:
