5.3 Cryptarithms & Quantitative Word Logic

5.3 Cryptarithms & Quantitative Word Logic

At a Glance: Cryptarithms and quantitative word puzzles test mathematical deduction and logical constraint satisfaction under strict time limits. Attempting to solve alphametics or word riddles by trial-and-error or heavy algebra causes severe time loss. By applying fundamental cryptarithm axioms (leading-digit non-zero rules, carry-over bounds) and rapid mental models (extremal assumptions, transitive balance substitution), you can solve these problems in under 25 seconds.

---

Alphametics & Cryptarithm Fundamentals

A cryptarithm (or alphametic) is a mathematical puzzle in which arithmetic operations are written with letters replacing digits. Each distinct letter represents a unique single digit from the set $\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$.

Standard conventions for cryptarithms:

1. Bijective Mapping: Each letter represents exactly one digit, and no two distinct letters can represent the same digit.
2. Leading-Digit Constraint: The leftmost letter of any multi-digit number cannot be zero ($L \ne 0$; thus $L \in \{1, 2, \dots, 9\}$).
3. Base-10 Arithmetic: All standard addition, subtraction, multiplication, and carry-over rules of base-10 mathematics apply.

---

The Four Non-Negotiable Cryptarithm Axioms

To solve cryptarithms in under 30 seconds, memorize these four core mathematical axioms:

Axiom 1: The Highest-Order Carry Bound ($C = 1$)

When adding two numbers of $n$ digits each, the maximum sum possible occurs when both numbers are $99\dots9$:

$9 + 9 + 1 \text{ (maximum incoming carry)} = 19$

Therefore, the carry into an $(n+1)$-th column can never exceed 1. If an addition problem adds two numbers and produces a sum with one extra column to the left, the leading digit of the sum must strictly equal 1:

$$\begin{array}{rl} & \text{AB} \\ + & \text{CD} \\ \hline & \mathbf{E}\text{FG} \end{array} \implies \mathbf{E} = 1$$

Axiom 2: Parity and Doubling Modulo Invariants

When a letter is added to itself ($A + A$), the units digit of the result ($B$) must be even if there is no incoming carry, or odd if there is an incoming carry of 1:

$$\begin{array}{rcl} A + A & = & B \implies B \in \{0, 2, 4, 6, 8\} \\ A + A + 1 & = & B \implies B \in \{1, 3, 5, 7, 9\} \end{array}$$

Axiom 3: Identity and Annihilation Elements

• Additive Identity: If $A + B = A$ in any column, then either $B = 0$ (with no incoming carry) or $B = 9$ (with an incoming carry of 1, since $A + 9 + 1 = A + 10$, leaving $A$ and carrying 1).
• Multiplicative Signatures:
  • Multiplying any odd digit by $5$ ends in $5$.
  • Multiplying any even digit by $5$ ends in $0$.
  • Multiplying an even digit $E$ by $6$ ends in $E$ ($6 \times 2 = 12, 6 \times 4 = 24, 6 \times 8 = 48$).

Axiom 4: The Digit Exclusion Pool

Always maintain a mental elimination checklist of unused digits: $\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$. As soon as a digit is assigned to a letter, cross it out. If a subsequent letter requires an even number and only $4$ and $8$ remain, your search space is reduced to just two possibilities.

Cryptarithm Deduction Matrix

---

Balance-Scale Logic: Transitive Mass Substitution

Balance-scale questions present two or three scales in perfect horizontal equilibrium, each containing geometric masses (spheres, cubes, cylinders, cones). Candidates must determine how many units of one shape balance another.

SCALE 1: [ 2 Spheres ]          ===          [ 3 Cubes ]
SCALE 2: [ 1 Sphere + 1 Cylinder ] ===       [ 4 Cubes ]
SCALE 3: [ 2 Cylinders ]        ===          [  ? Cubes  ]

The Unit Currency Method (Avoiding Fractions)

Instead of writing out algebraic equations with fractions (e.g. $1 \text{ Sphere} = 1.5 \text{ Cubes}$), assign an integer weight to the most granular object (the common denominator):

1. Look at Scale 1: $2 \text{ Spheres} = 3 \text{ Cubes}$.
   • To avoid fractions, let each Cube $= 2 \text{ kg}$.
   • Total weight of 3 Cubes $= 3 \times 2 = 6 \text{ kg}$.
   • Therefore, 2 Spheres $= 6 \text{ kg} \implies 1 \text{ Sphere} = 3 \text{ kg}$.
2. Look at Scale 2: $1 \text{ Sphere} + 1 \text{ Cylinder} = 4 \text{ Cubes}$.
   • Total weight on right: $4 \text{ Cubes} = 4 \times 2 = 8 \text{ kg}$.
   • We know $1 \text{ Sphere} = 3 \text{ kg}$.
   • Therefore: $3 \text{ kg} + 1 \text{ Cylinder} = 8 \text{ kg} \implies 1 \text{ Cylinder} = 5 \text{ kg}$.
3. Evaluate Scale 3: How many Cubes balance $2$ Cylinders?
   • Total weight of 2 Cylinders $= 2 \times 5 = 10 \text{ kg}$.
   • Each Cube weighs $2 \text{ kg}$.
   • Number of Cubes required $= \frac{10 \text{ kg}}{2 \text{ kg}} = \mathbf{5 \text{ Cubes}}$.

By assigning integer weights ($2 \text{ kg}$), the entire puzzle is solved mentally in under 15 seconds without writing down simultaneous equations.

---

Classical Quantitative Word Riddles: Algebra-Free Mental Models

Arithmetical reasoning items often take the form of classical quantitative word riddles. Setting up $x$ and $y$ algebra can take 45–60 seconds. High-scoring candidates use rapid structural mental models.

Model 1: Head-and-Foot Counting (The Extremal All-One-Category Method)

Problem: A farmer counts $35$ heads and $98$ feet among a collection of chickens ($2$ feet each) and sheep ($4$ feet each). How many sheep are there?

Calculation time: 6 seconds.

---

Model 2: Invariant Age Differences

Principle: The chronological age difference between two individuals remains constant throughout their entire lives.

$\Delta = \text{Age}_A(t) - \text{Age}_B(t) = \text{Constant}$

Problem: A father is currently $36$ years old and his daughter is $8$ years old. In how many years will the father be exactly three times as old as his daughter?

1. Calculate the invariant age difference: $\Delta = 36 - 8 = 28 \text{ years}$
2. In the future, the father's age will be $3 \times D_{\text{future}}$, where $D_{\text{future}}$ is the daughter's age.
3. The difference between their future ages is: $\text{Father} - \text{Daughter} = 3 D_{\text{future}} - 1 D_{\text{future}} = 2 D_{\text{future}}$
4. Equate the difference to the invariant constant ($28$): $2 D_{\text{future}} = 28 \implies D_{\text{future}} = 14 \text{ years old}$
5. Time required to reach that age: $\text{Years} = D_{\text{future}} - D_{\text{current}} = 14 - 8 = \mathbf{6 \text{ years}}$

---

Model 3: Handshake and Round-Robin Combinatorics

When $n$ individuals in a room each shake hands with every other individual exactly once, each handshake involves an unordered pair of participants. The total number of unique handshakes (or round-robin games) is:

$\text{Total Handshakes} = \frac{n(n - 1)}{2}$

• For $10$ people: $\frac{10 \times 9}{2} = 45$ handshakes.
• For $12$ teams playing each other once: $\frac{12 \times 11}{2} = 66$ matches.

---

Step-by-Step Worked Logic Examples

Worked Example 1: Classic Addition Alphametic

Problem: In the alphametic puzzle below, distinct letters represent distinct digits ($0$ to $9$), and neither $A$ nor $B$ is zero:

$$\begin{array}{rl} & \text{AB} \\ + & \text{BA} \\ \hline & \text{CDC} \end{array}$$

What is the numerical value of the digit $D$?

Step 1: Apply the Highest-Order Carry Axiom.

• We are adding two 2-digit numbers ($AB + BA$). The maximum possible sum of two 2-digit numbers is $98 + 89 = 187$.
• Because the sum is a 3-digit number ($CDC$), the leading hundreds digit $C$ must equal $1$: $C = 1$

Step 2: Substitute $C = 1$ into the sum.

• The sum is now $1 D 1$, which means the units digit is also $1$ ($C = 1$).

Step 3: Analyze the units column ($B + A$).

• Units column: $B + A$ ends in $1$.
• Since $A$ and $B$ are non-zero single digits, their sum must produce a carry into the tens column: $B + A = 11$.

Step 4: Analyze the tens column.

• Tens column: $A + B + 1 \text{ (carry)} = 11 + 1 = 12$.
• The tens digit of the sum is $2$, and it carries $1$ into the hundreds column ($C = 1$).
• Therefore, the middle digit $D$ must equal $2$.
• Verification: Let $A = 3, B = 8$. Then $38 + 83 = 121$. Here $A=3, B=8, C=1, D=2$. All letters are distinct digits. $D$ is conclusively $2$.

---

Worked Example 2: Three-Scale Mass Balance

Problem: Three balance scales are in equilibrium:

• Scale 1: $2$ Cylinders balance $3$ Cubes ($2C = 3K$)
• Scale 2: $1$ Sphere balances $1$ Cylinder and $1$ Cube ($1S = 1C + 1K$)
• Scale 3: How many Cubes balance $2$ Spheres ($2S = ? K$)?

Step 1: Set a base currency.

• Let $1 \text{ Cube} (K) = 2 \text{ units}$.
• Scale 1: $2C = 3 \times 2 = 6 \implies 1C = 3 \text{ units}$.

Step 2: Solve for Sphere ($S$) in Scale 2.

• $1S = 1C + 1K = 3 + 2 = 5 \text{ units}$.

Step 3: Calculate Scale 3.

• We need the mass of $2$ Spheres: $2S = 2 \times 5 = 10 \text{ units}$
• Since each Cube is $2$ units: $\text{Number of Cubes} = \frac{10}{2} = \mathbf{5 \text{ Cubes}}$

---

Pacing Pitfalls, Scratchpad Protocol & Elimination Discipline

1. The Algebraic Setup Trap: Writing out $x + y = 35$ and $2x + 4y = 98$ followed by row reduction takes 50 seconds. Use the Extremal All-Chicken assumption to solve it in your head in 6 seconds.
2. The Zero-Letter Trap: Never assign $0$ to the first letter of a number. If an option claims that leading letter $M = 0$, eliminate that option immediately.
3. Transitive Substitution in Your Head: When working with balance scales, use letters instead of picturing 3D shapes: think 2C = 3K and S = C + K, then substitute to isolate the target.