Study guide

5.3 Cryptarithms & Quantitative Word Logic

Edutest Selective Entry & Scholarship Exam Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, Results & Pacing Strategy

1.1 Exam Structure, Format & Test Battery 1.2 Results, Year-Level Norms & How Schools Select 1.3 Speed Tactics, Time Budgeting & Zero-Penalty Guessing

2 Chapter 2: Verbal Reasoning: Analogies, Classification & Vocabulary

2.1 Word Analogies & Semantic Relationships 2.2 Verbal Classification & Odd-One-Out 2.3 Advanced Vocabulary, Synonyms & Antonyms

3 Chapter 3: Verbal Reasoning: Codes, Sequences & Logical Deduction

3.1 Letter Codes & Cryptographic Shifts 3.2 Word Chains, Anagrams & Hidden Words 3.3 Verbal Deductive Logic & Syllogisms

4 Chapter 4: Numerical Reasoning: Sequences & Number Patterns

4.1 Arithmetic, Geometric & Two-Tier Differences 4.2 Alternating, Interleaved & Fibonacci Sequences 4.3 Square, Cube & Figurate Number Sequences

5 Chapter 5: Numerical Reasoning: Grids, Diagrams & Math Logic

5.1 Number Matrices & Grid Patterns 5.2 Geometric Shape Puzzles & Relational Diagrams 5.3 Cryptarithms & Quantitative Word Logic

6 Chapter 6: Reading Comprehension: Fiction & Literary Analysis

6.1 Narrative Structure, Plot Devices & Conflict 6.2 Figurative Language, Imagery & Tone 6.3 Characterization, Inferencing & Subtext

7 Chapter 7: Reading Comprehension: Non-Fiction, Poetry, Argument & Sentence Skills

7.1 Informational Text Structures & Main Idea 7.2 Poetry Analysis: Form, Rhyme, Rhythm & Meaning 7.3 Persuasive Techniques, Rhetoric & Author Bias 7.4 Sentence Correction, Sentence Completion & Punctuation

8 Chapter 8: Mathematics: Arithmetic, Fractions, Decimals & Percentages

8.1 Mental Arithmetic, Order of Operations & Number Properties 8.2 Fractions, Decimals & Mixed Operations 8.3 Percentages, Percentage Change & Financial Problems

9 Chapter 9: Mathematics: Rates, Ratios, Probability & Data

9.1 Ratios, Rates & Proportional Reasoning 9.2 Speed, Distance, Time & Combined Work 9.3 Probability, Counting Principles & Permutations 9.4 Data Interpretation, Dual-Axis Charts & Statistics

10 Chapter 10: Mathematics: Measurement, Geometry & Algebra

10.1 Perimeter, Area & Composite 2D Figures 10.2 Volume, Surface Area & 3D Spatial Visualization 10.3 Angles, Geometric Theorems, Polygons & Transformations 10.4 Algebraic Expressions, Linear Equations & Word Problems

11 Chapter 11: Written Expression: Narrative & Creative Writing

11.1 Narrative Architecture & Deconstructing Prompts 11.2 Sensory Immersion & Show-Don't-Tell Techniques 11.3 Mechanics, Punctuation Variety & Under-the-Gun Polish

12 Chapter 12: Written Expression: Persuasive & Expository Writing

12.1 Persuasive Prompt Deconstruction & Thesis Formation 12.2 High-Scoring Body Paragraphs: The PEEL/TEEL Framework 12.3 Expository Clarity, Rhetorical Flourish & Clincher Closures

5.3 Cryptarithms & Quantitative Word Logic

Key Takeaways Explain This Topic AI

Cryptarithms (alphametics) substitute unique digits (0–9) for distinct letters; solving them under 30-second constraints requires structural mathematical deduction rather than trial-and-error guessing.

The Highest-Order Carry Axiom dictates that the sum of two n n n -digit numbers can produce an ( n + 1 ) (n+1) ( n + 1 ) -digit result only if the leading carry digit is strictly equal to 1.

Balance-scale logic puzzles are solved rapidly by converting all shapes into a single common currency (transitive substitution) rather than constructing complex simultaneous algebraic equations.

Classical quantitative word riddles (such as head-and-foot counting) are solved in under 10 seconds using the Extremal All-One-Category Assumption Method instead of systems of linear equations.

Leading letters cannot represent zero, providing an immediate non-zero constraint ( L ≥ 1 L \ge 1 L ≥ 1 ) that swiftly eliminates impossible options in cryptarithm and positional logic problems.

Last updated: October 2026

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 } \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\} { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } .

Standard conventions for cryptarithms:

Bijective Mapping: Each letter represents exactly one digit, and no two distinct letters can represent the same digit.

Leading-Digit Constraint: The leftmost letter of any multi-digit number cannot be zero ( L ≠ 0 L \ne 0 L  = 0 ; thus L ∈ { 1 , 2 , … , 9 } L \in \{1, 2, \dots, 9\} L ∈ { 1 , 2 , … , 9 } ).

Base-10 Arithmetic: All standard addition, subtraction, multiplication, and carry-over rules of base-10 mathematics apply.

Warning

The Brute-Force Trap: Never test random digits from 0 to 9 in a cryptarithm. Testing random permutations consumes 90 to 120 seconds. Instead, locate the column that contains an unavoidable boundary condition (such as a carry-over into a new column or a doubled identical digit).

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 C = 1 C = 1 )

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

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

Therefore, the carry into an ( n + 1 ) (n+1) ( 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 : AB + CD E FG ⟹ E = 1 \begin{array}{rl}

  • & \text{AB} \\
  • + & \text{CD} \\
  • \hline
  • & \mathbf{E}\text{FG}
  • \end{array} \implies \mathbf{E} = 1 + ​ AB CD E FG ​ ​ ⟹ E = 1
  • Axiom 2: Parity and Doubling Modulo Invariants

When a letter is added to itself ( A + A A + A A + A ), the units digit of the result ( B B B ) must be even if there is no incoming carry, or odd if there is an incoming carry of 1: A + A = B ⟹ B ∈ { 0 , 2 , 4 , 6 , 8 } A + A + 1 = B ⟹ B ∈ { 1 , 3 , 5 , 7 , 9 } \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} A + A A + A + 1 ​ = = ​ B ⟹ B ∈ { 0 , 2 , 4 , 6 , 8 } B ⟹ B ∈ { 1 , 3 , 5 , 7 , 9 } ​
  • Axiom 3: Identity and Annihilation Elements

Additive Identity: If A + B = A A + B = A A + B = A in any column, then either B = 0 B = 0 B = 0 (with no incoming carry) or B = 9 B = 9 B = 9 (with an incoming carry of 1, since A + 9 + 1 = A + 10 A + 9 + 1 = A + 10 A + 9 + 1 = A + 10 , leaving A A A and carrying 1).

Multiplicative Signatures:

Multiplying any odd digit by 5 5 5 ends in 5 5 5 .

Multiplying any even digit by 5 5 5 ends in 0 0 0 .

Multiplying an even digit E E E by 6 6 6 ends in E E E ( 6 × 2 = 12 , 6 × 4 = 24 , 6 × 8 = 48 6 \times 2 = 12, 6 \times 4 = 24, 6 \times 8 = 48 6 × 2 = 12 , 6 × 4 = 24 , 6 × 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 } \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\} { 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 4 4 and 8 8 8 remain, your search space is reduced to just two possibilities.

Cryptarithm Deduction Matrix

Column Configuration Deduction Mathematical Reason

Two n n n -digit numbers sum to ( n + 1 ) (n+1) ( n + 1 ) -digit number Leading letter = 1 = 1 = 1 9 + 9 + 1 = 19 9 + 9 + 1 = 19 9 + 9 + 1 = 19 ; carry cannot exceed 1

A + B = B A + B = B A + B = B (no incoming carry) A = 0 A = 0 A = 0 Additive identity: 0 + B = B 0 + B = B 0 + B = B

A + B = B A + B = B A + B = B (with incoming carry of 1) A = 9 A = 9 A = 9 9 + B + 1 = B + 10 9 + B + 1 = B + 10 9 + B + 1 = B + 10 (leaves B B B , carries 1)

A + A = A A + A = A A + A = A (units column) A = 0 A = 0 A = 0 Only 0 + 0 = 0 0 + 0 = 0 0 + 0 = 0 without carry

A + A = A A + A = A A + A = A (with carry 1) A = 9 A = 9 A = 9 9 + 9 + 1 = 19 9 + 9 + 1 = 19 9 + 9 + 1 = 19 (leaves 9, carries 1)

Units digit of A × B A \times B A × B is A A A ( A ≠ 0 A \ne 0 A  = 0 ) B = 1 B = 1 B = 1 ; or A A A is even and B = 6 B = 6 B = 6 ; or A = 5 A = 5 A = 5 and B B B is odd Multiplicative properties in base 10

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 Sphere = 1.5 Cubes 1 \text{ Sphere} = 1.5 \text{ Cubes} 1 Sphere = 1.5 Cubes ), assign an integer weight to the most granular object (the common denominator):

Look at Scale 1: 2 Spheres = 3 Cubes 2 \text{ Spheres} = 3 \text{ Cubes} 2 Spheres = 3 Cubes .

To avoid fractions, let each Cube = 2 kg = 2 \text{ kg} = 2 kg .

Total weight of 3 Cubes = 3 × 2 = 6 kg = 3 \times 2 = 6 \text{ kg} = 3 × 2 = 6 kg .

Therefore, 2 Spheres = 6 kg ⟹ 1 Sphere = 3 kg = 6 \text{ kg} \implies 1 \text{ Sphere} = 3 \text{ kg} = 6 kg ⟹ 1 Sphere = 3 kg .

Look at Scale 2: 1 Sphere + 1 Cylinder = 4 Cubes 1 \text{ Sphere} + 1 \text{ Cylinder} = 4 \text{ Cubes} 1 Sphere + 1 Cylinder = 4 Cubes .

Total weight on right: 4 Cubes = 4 × 2 = 8 kg 4 \text{ Cubes} = 4 \times 2 = 8 \text{ kg} 4 Cubes = 4 × 2 = 8 kg .

We know 1 Sphere = 3 kg 1 \text{ Sphere} = 3 \text{ kg} 1 Sphere = 3 kg .

Therefore: 3 kg + 1 Cylinder = 8 kg ⟹ 1 Cylinder = 5 kg 3 \text{ kg} + 1 \text{ Cylinder} = 8 \text{ kg} \implies 1 \text{ Cylinder} = 5 \text{ kg} 3 kg + 1 Cylinder = 8 kg ⟹ 1 Cylinder = 5 kg .

Evaluate Scale 3: How many Cubes balance 2 2 2 Cylinders?

Total weight of 2 Cylinders = 2 × 5 = 10 kg = 2 \times 5 = 10 \text{ kg} = 2 × 5 = 10 kg .

Each Cube weighs 2 kg 2 \text{ kg} 2 kg .

Number of Cubes required = 10 kg 2 kg = 5 Cubes = \frac{10 \text{ kg}}{2 \text{ kg}} = \mathbf{5 \text{ Cubes}} = 2 kg 10 kg ​ = 5 Cubes .

By assigning integer weights ( 2 kg 2 \text{ kg} 2 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 x x and y y 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 35 35 heads and 98 98 98 feet among a collection of chickens ( 2 2 2 feet each) and sheep ( 4 4 4 feet each). How many sheep are there?

Tip

The All-2-Foot Assumption:

Assume all 35 35 35 animals are chickens (2 feet each): Baseline Feet = 35 × 2 = 70 feet \text{Baseline Feet} = 35 \times 2 = 70 \text{ feet} Baseline Feet = 35 × 2 = 70 feet

Calculate the foot surplus: Surplus Feet = 98 − 70 = 28 extra feet \text{Surplus Feet} = 98 - 70 = 28 \text{ extra feet} Surplus Feet = 98 − 70 = 28 extra feet

Each sheep contributes 4 − 2 = 2 4 - 2 = 2 4 − 2 = 2 extra feet above a chicken.

Divide the surplus by 2 2 2 : Number of Sheep = 28 2 = 14 sheep \text{Number of Sheep} = \frac{28}{2} = \mathbf{14 \text{ sheep}} Number of Sheep = 2 28 ​ = 14 sheep

Number of chickens = 35 − 14 = 21 chickens = 35 - 14 = 21 \text{ chickens} = 35 − 14 = 21 chickens .

Calculation time: 6 seconds .

Model 2: Invariant Age Differences

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

Δ = Age A ( t ) − Age B ( t ) = Constant \Delta = \text{Age}_A(t) - \text{Age}_B(t) = \text{Constant} Δ = Age A ​ ( t ) − Age B ​ ( t ) = Constant

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

Calculate the invariant age difference: Δ = 36 − 8 = 28 years \Delta = 36 - 8 = 28 \text{ years} Δ = 36 − 8 = 28 years

In the future, the father's age will be 3 × D future 3 \times D_{\text{future}} 3 × D future ​ , where D future D_{\text{future}} D future ​ is the daughter's age.

The difference between their future ages is: Father − Daughter = 3 D future − 1 D future = 2 D future \text{Father} - \text{Daughter} = 3 D_{\text{future}} - 1 D_{\text{future}} = 2 D_{\text{future}} Father − Daughter = 3 D future ​ − 1 D future ​ = 2 D future ​

Equate the difference to the invariant constant ( 28 28 28 ): 2 D future = 28 ⟹ D future = 14 years old 2 D_{\text{future}} = 28 \implies D_{\text{future}} = 14 \text{ years old} 2 D future ​ = 28 ⟹ D future ​ = 14 years old

Time required to reach that age: Years = D future − D current = 14 − 8 = 6 years \text{Years} = D_{\text{future}} - D_{\text{current}} = 14 - 8 = \mathbf{6 \text{ years}} Years = D future ​ − D current ​ = 14 − 8 = 6 years

Model 3: Handshake and Round-Robin Combinatorics

When n n 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:

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

For 10 10 10 people: 10 × 9 2 = 45 \frac{10 \times 9}{2} = 45 2 10 × 9 ​ = 45 handshakes.

For 12 12 12 teams playing each other once: 12 × 11 2 = 66 \frac{12 \times 11}{2} = 66 2 12 × 11 ​ = 66 matches.

Note

Directed vs Undirected Exchanges: If every person gives a gift or business card to every other person, both individuals make an exchange ( A → B A \to B A → B and B → A B \to A B → A are two distinct events). In that case, do not divide by 2: Total Exchanges = n ( n − 1 ) \text{Total Exchanges} = n(n - 1) Total Exchanges = n ( n − 1 ) .

  • Step-by-Step Worked Logic Examples
  • Worked Example 1: Classic Addition Alphametic

Problem: In the alphametic puzzle below, distinct letters represent distinct digits ( 0 0 0 to 9 9 9 ), and neither A A A nor B B B is zero: AB + BA CDC \begin{array}{rl}

  • & \text{AB} \\
  • + & \text{BA} \\
  • \hline
  • & \text{CDC}
  • \end{array} + ​ AB BA CDC ​ ​

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

Step 1: Apply the Highest-Order Carry Axiom.

We are adding two 2-digit numbers ( A B + B A AB + BA A B + B A ). The maximum possible sum of two 2-digit numbers is 98 + 89 = 187 98 + 89 = 187 98 + 89 = 187 .

Because the sum is a 3-digit number ( C D C CDC C D C ), the leading hundreds digit C C C must equal 1 1 1 : C = 1 C = 1 C = 1

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

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

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

Units column: B + A B + A B + A ends in 1 1 1 .

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

Step 4: Analyze the tens column.

Tens column: A + B + 1 (carry) = 11 + 1 = 12 A + B + 1 \text{ (carry)} = 11 + 1 = 12 A + B + 1 (carry) = 11 + 1 = 12 .

The tens digit of the sum is 2 2 2 , and it carries 1 1 1 into the hundreds column ( C = 1 C = 1 C = 1 ).

Therefore, the middle digit D D D must equal 2 2 2 .

Verification: Let A = 3 , B = 8 A = 3, B = 8 A = 3 , B = 8 . Then 38 + 83 = 121 38 + 83 = 121 38 + 83 = 121 . Here A = 3 , B = 8 , C = 1 , D = 2 A=3, B=8, C=1, D=2 A = 3 , B = 8 , C = 1 , D = 2 . All letters are distinct digits. D D D is conclusively 2 2 2 .

Worked Example 2: Three-Scale Mass Balance

Problem: Three balance scales are in equilibrium:

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

Scale 3: How many Cubes balance 2 2 2 Spheres ( 2 S = ? K 2S = ? K 2 S = ? K )?

Step 1: Set a base currency.

Let 1 Cube ( K ) = 2 units 1 \text{ Cube} (K) = 2 \text{ units} 1 Cube ( K ) = 2 units .

Scale 1: 2 C = 3 × 2 = 6 ⟹ 1 C = 3 units 2C = 3 \times 2 = 6 \implies 1C = 3 \text{ units} 2 C = 3 × 2 = 6 ⟹ 1 C = 3 units .

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

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

Step 3: Calculate Scale 3.

We need the mass of 2 2 2 Spheres: 2 S = 2 × 5 = 10 units 2S = 2 \times 5 = 10 \text{ units} 2 S = 2 × 5 = 10 units

Since each Cube is 2 2 2 units: Number of Cubes = 10 2 = 5 Cubes \text{Number of Cubes} = \frac{10}{2} = \mathbf{5 \text{ Cubes}} Number of Cubes = 2 10 ​ = 5 Cubes

Pacing Pitfalls, Scratchpad Protocol & Elimination Discipline

The Algebraic Setup Trap: Writing out x + y = 35 x + y = 35 x + y = 35 and 2 x + 4 y = 98 2x + 4y = 98 2 x + 4 y = 98 followed by row reduction takes 50 seconds. Use the Extremal All-Chicken assumption to solve it in your head in 6 seconds.

The Zero-Letter Trap: Never assign 0 0 0 to the first letter of a number. If an option claims that leading letter M = 0 M = 0 M = 0 , eliminate that option immediately.

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.