Cryptarithms: How to Solve Letter-Addition Puzzles with Pure Deductive Logic

Imagine looking at an addition problem where all numbers have vanished, replaced entirely by letters of the alphabet: SEND + MORE = MONEY. At first glance, it looks like a coded spy cipher or a scrambled spelling word. But behind the letters lies one of the most intellectually rewarding mathematical logic puzzles ever created: the Cryptarithm (also called an alphametic). Solving them does not require brute-force guessing; it requires the same deductive elimination and place-value logic that software engineers and forensic cryptographers use every day.

The Universal Rules of Cryptarithms

Every standard cryptarithm obeys three non-negotiable rules:

• One-to-One Mapping: Each distinct letter represents exactly one unique digit from 0 through 9. If E = 5, no other letter can be 5.
• No Leading Zeros: The first letter of any number word cannot be 0. (For example, S ≠ 0 and M ≠ 0).
• Standard Base-10 Arithmetic: The equation must be mathematically correct with column carries.

The Master Walkthrough: Solving SEND + MORE = MONEY

Let's solve Henry Dudeney's 1924 masterpiece step by step using pure logic:

1. Step 1: Deduce M
   We are adding two 4-digit numbers (SEND + MORE) and getting a 5-digit sum (MONEY). The maximum sum of two 4-digit numbers is 9999 + 9999 = 19998. The leading carry digit in column 5 can only ever be 1! Since M cannot be 0, M = 1.
2. Step 2: Deduce O
   In column 4 (the thousands column), we have S + M (+ possible carry) = MO. We know M = 1, so S + 1 (+ carry) = 10 + O.
   If S = 9 and carry is 1, 9 + 1 + 1 = 11, but M is already 1 (no duplicates!).
   If S = 9 and carry is 0, 9 + 1 = 10, giving O = 0.
   Could S be 8? Only if there was a carry of 1, giving 8 + 1 + 1 = 10. In either case, O is guaranteed to be 0.
3. Step 3: Deduce S
   In column 3 (hundreds): E + O = N (or E + 0 + carry = N). Since E ≠ N, there MUST be a carry of 1 from column 2, meaning N = E + 1.
   Because column 3 does not generate a carry into column 4 unless E + 0 = 10 (which is impossible since O=0), the carry from column 4 had to come solely from S + 1 = 10. Therefore, S = 9.
4. Step 4: Deduce E and N
   Examining the remaining digits (2, 3, 4, 5, 6, 7, 8) and column carries leads inexorably to: E = 5, which forces N = 6, R = 8, D = 7, and Y = 2.

5 Common Pitfalls in Cryptarithms & How to Prevent Them

1. Assigning zero to a leading letter: A word like SEND can never start with 0. Always mark ≠ 0 next to leading initials first.
2. Accidental duplicate digits: Assigning 5 to both E and N. Keep an active scratch list of unused digits: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] and cross them off as solved.
3. Ignoring carries from unseen columns: Assuming A + B = C when in fact A + B + 1 = C or A + B = 10 + C.
4. Random guessing: Trying all 10! (3,628,800) permutations by hand. Always anchor your solution on extreme values (0 and 1) and column width expansions.
5. Parity oversight: If an even number of identical letters add together (e.g., E + E = R), R MUST be an even number (or odd if there is a carry from the right). Parity cuts possibilities in half instantly!