I’m obsessed with those letter-to-digit puzzles, but my brain keeps tying itself in knots. I’m trying to solve the classic SEND + MORE = MONEY, and I want to reason it out cleanly instead of brute-forcing. I get that each letter is a unique digit and leading letters can’t be zero, but I keep getting lost deciding what to pin down first. Do you start from the rightmost column and work left? How do you use the carries to nail down specific letters without guessing ten different branches? It feels like packing a suitcase: every shirt (digit) I place forces a bunch of socks (other digits) to move, and I lose track of what’s fixed vs. still flexible. What’s a clear, step-by-step way to think through this kind of puzzle-like which columns to prioritize, how to reason about the carries, and how to keep the possibilities organized-without giving away the actual final assignment? Any help appreciated!
Ready to make maths more enjoyable, accessible, and fun? Join a friendly community where you can explore puzzles, ask questions, track your progress, and learn at your own pace.
By becoming a member, you unlock:
3 Responses
My favorite tidy way is to name the carries and let them do the heavy lifting-like little bellhops shuttling overflow to the next floor. Write c1, c2, c3, c4 for the carries from units through thousands. Because a 4-digit plus a 4-digit gives a 5-digit result in SEND + MORE = MONEY, the leading M must be the final carry, so c4 = 1 and thus M = 1. Now look at the thousands column: S + M + c3 = O + 10, so with M = 1 we get O = S + 1 + c3 − 10. This forces O = 0 and pins down c3 = 0 and S = 9 (the only way O stays a digit distinct from M). Slide left to the hundreds: E + O + c2 = N + 10 c3 becomes E + c2 = N (since O = 0 and c3 = 0), so c2 = 1 and N = E + 1. Then the tens column: N + R + c1 = E + 10 c2 becomes (E + 1) + R + c1 = E + 10, so R + c1 = 9; distinctness rules out R = 9, so c1 = 1 and R = 8. Finally the units say D + E = Y + 10, so D + E ≥ 10 and Y = D + E − 10. At this point you’ve corralled almost everything: keep a small table of “used digits” {1,0,9,8} and for each remaining letter its allowed set, then try E from 2 to 7 (since N = E + 1 must be free), compute Y from D + E − 10, and prune any clash. I might be off by a whisker in phrasing, but this chain nails the logic cleanly, with only a tiny, final case-check left.
A clean way to attack SEND + MORE = MONEY is to structure it around carries and work only a few controlled “branches.” First, look at the left edge: two 4‑digit numbers adding to a 5‑digit result means there is a carry into the new leading column, so the result’s leading digit must be 1. Now set carry variables c1, c2, c3 for the units, tens, and hundreds columns, and write the column constraints from right to left: D + E gives units digit Y and carry c1; N + R + c1 gives tens digit E and carry c2; E + O + c2 gives hundreds digit N and carry c3; S + M + c3 produces thousands digit O and (as noted) a carry of 1 into the new leading digit. At each column, use two quick tools: (i) bound the carry (here it’s always 0 or 1, since you’re adding two digits plus at most one carry), and (ii) enforce distinct digits immediately-if a column would force, say, E to equal N or Y, prune that path. To keep track, make a small table: for each letter, list “possible digits,” and for each ci list {0,1}; when a column fixes (or rules out) a carry, cross it off and update the affected letters before moving on. The only branching you should allow early is on the carries (e.g., try c1 = 0 vs 1); once the carries are fixed, most letters become determined by simple subtraction mod 10, and uniqueness checks do the rest. Simple worked example to see this style: solve A + A = B0. The units sum ends in 0 only if A is 0 or 5, but A = 0 would force B = 0 and violate distinctness, so A = 5; that creates a carry of 1, so B = 1. That’s exactly the kind of “carry-first, prune by distinctness” move you’ll repeat column by column in SEND + MORE = MONEY, starting with the forced new leading carry, then sweeping right-to-left while keeping a tidy candidate list.
The suitcase analogy made me smile-I feel exactly that way unless I pin down the carries first. Here’s the clean route I use. Name the carries from right to left c1, c2, c3, and the final carry c4. Then each column gives an equation: (1) D+E = Y + 10c1, (2) N+R+c1 = E + 10c2, (3) E+O+c2 = N + 10c3, (4) S+M+c3 = O + 10c4, and (5) c4 = M. Because you’re adding two four-digit numbers and getting a five-digit result, c4=1, so M=1. Then (4) says S+1+c3 = O+10. That forces O to be either S−9 or S−8, which means O=0 and either S=9 with c3=0, or S=8 with c3=1. Check (3): if c3=1, then E+O+c2 = N+10 forces E to be 9 to reach 10, but 9 is already S, so that path is impossible. Therefore c3=0 and S=9, O=0. With c3=0, (3) reduces to N = E + c2; since digits are distinct, c2 must be 1, so N=E+1. Now (2) becomes (E+1) + R + c1 = E + 10, so R + c1 = 9. But 9 is already used by S, so c1 can’t be 0 (which would force R=9). Hence c1=1 and R=8. Finally, (1) says D+E = Y + 10, so D+E ≥ 10 and Y = D+E−10. At this point the only free letters are E, N, D, Y with N=E+1, the used digits are {0,1,8,9}, and E cannot be 7 (that would make N=8, already taken). A short check over E in {2,3,4,5,6} and D such that D+E ≥ 10 finishes it uniquely.
How to keep it tidy: I draw three little rows-“carries: c1=?, c2=?, c3=?, c4=1,” “used digits: { },” and “relations: N=E+1, R+ c1=9, D+E=10+Y.” Every time a column locks something (like c1=1, R=8), I update those rows. When I first learned these, I kept getting lost because I’d try five branches at once; once I committed to the carry equations first, the puzzle basically solved itself, and I only had to do one last tiny scan at the end. It felt like finally packing the suitcase with the bulky items first-everything else just slides neatly into place.