2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators

Key Takeaways

  • In cryptarithmetic (Harfli İşlemler), distinct letters or symbols represent distinct base-10 digits (0–9), and the leading leftmost digit of any multi-digit number cannot be 0

  • Place-value decomposition converts multi-digit strings into algebraic expressions (ABC = 100A + 10B + C, AB + BA = 11(A + B), ABC + BCA + CAB = 111(A + B + C))

  • Carry-over (elde) bounds strictly constrain leading digits: adding two 2-digit numbers carries at most 1 into the hundreds place, forcing a 3-digit sum's leading digit to equal 1

  • Custom symbolic operators (Sembolik İşlemler) hide a two-input formula a ★ b = f(a, b) that must be inferred and verified across all three given numerical examples

Last updated: October 2026

Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators


1. Cryptarithmetic (Harfli İşlemler / Kriptaritmetik)

In a cryptarithmetic puzzle, base-10 digits (0,1,2,…,90, 1, 2, \dots, 9) in a vertical addition, subtraction, multiplication, or division layout are replaced by capital letters (A,B,C,K,L,MA, B, C, K, L, M) or geometric icons (▲, ■, ●). Three universal conventions govern these problems:

  1. Bijection Rule: Identical letters represent the exact same digit everywhere in the operation; distinct letters represent distinct digits (unless the problem stem explicitly allows equal values).
  2. No Leading Zero Rule: The leftmost digit of any multi-digit number can never be 00 (for example, in ABC‾\overline{ABC}, A∈{1,2,…,9}A \in \{1, 2, \dots, 9\}).
  3. Base-10 Carry (Elde) Bounds:
    • Adding two single digits (X+YX + Y, plus a possible incoming carry of 11) has a maximum sum of 9+9+1=199 + 9 + 1 = 19, so the outgoing carry to the next column left is at most 11.
    • Adding three single digits (X+Y+ZX + Y + Z, plus an incoming carry of at most 22) has a maximum sum of 9+9+9+2=299 + 9 + 9 + 2 = 29, so the outgoing carry is at most 22.

Place-Value Decomposition (Basamak Çözümlemesi)

Whenever letters appear symmetrically across units, tens, and hundreds columns, expand each multi-digit integer in powers of 1010 rather than guessing column by column:

  • AB‾=10A+B\overline{AB} = 10A + B and BA‾=10B+A  ⟹  AB‾+BA‾=11(A+B)\overline{BA} = 10B + A \implies \overline{AB} + \overline{BA} = 11(A + B) and AB‾−BA‾=9(A−B)\overline{AB} - \overline{BA} = 9(A - B)
  • AA‾=11A\overline{AA} = 11A and AAA‾=111A=3×37×A\overline{AAA} = 111A = 3 \times 37 \times A (Note the prime factor 3737—it can simplify BBB‾\overline{BBB} multiplication puzzle!)
  • ABC‾+BCA‾+CAB‾=111(A+B+C)\overline{ABC} + \overline{BCA} + \overline{CAB} = 111(A + B + C)

Units-Digit Invariants (Birler Basamağı Sabitleri)

Look for self-reproducing digits in the units column:

  • Additive Zero Invariant: A+B≡A(mod10)  ⟹  B=0A + B \equiv A \pmod{10} \implies B = 0 (if there is no incoming carry) or B=9B = 9 (if there is an incoming carry of 11 from the column to the right).
  • Idempotent Square Digits: B×B≡B(mod10)  ⟹  B∈{0,1,5,6}B \times B \equiv B \pmod{10} \implies B \in \{0, 1, 5, 6\} because 02=00^2 = 0, 12=11^2 = 1, 52=255^2 = 25, and 62=366^2 = 36.

Worked Example 1: Carry-Bound & Place-Value Addition

In the base-10 vertical addition AB‾+BC‾=BCB‾\overline{AB} + \overline{BC} = \overline{BCB}, A,B,A, B, and CC are distinct digits. Find A+B+CA + B + C.

  1. Apply the Leading Carry Bound: AB‾\overline{AB} and BC‾\overline{BC} are two 2-digit numbers, so their sum BCB‾\overline{BCB} is a 3-digit number less than 199199. Therefore, the hundreds digit BB must equal 11 (B=1B = 1).
  2. Substitute B=1B = 1 and expand by place value:
A1‾+1C‾=1C1‾  ⟹  (10A+1)+(10+C)=100+10C+1\overline{A1} + \overline{1C} = \overline{1C1} \implies (10A + 1) + (10 + C) = 100 + 10C + 1
  1. Simplify the linear Diophantine equation:
10A+11+C=101+10C  ⟹  10A−9C=90  ⟹  10(A−9)=9C10A + 11 + C = 101 + 10C \implies 10A - 9C = 90 \implies 10(A - 9) = 9C

Since A∈{1,…,9}A \in \{1, \dots, 9\} and C∈{0,…,9}C \in \{0, \dots, 9\}, the only solution is A=9A = 9 and C=0C = 0 (checking: 91+10=10191 + 10 = 101). 4. Compute the sum: A+B+C=9+1+0=10A + B + C = 9 + 1 + 0 = 10.


2. Letter-to-Number and Symbol Coding (Şifreler)

Column-Frequency Matching

Never try to match entire words by eye. Instead, count how many times each character appears in Column 1 (first letter) and Column nn (last letter):

  1. Count First-Column Multiplicities: If the five words start with letters having frequency distribution (2,2,1)(2, 2, 1)—meaning two words start with KK, two start with MM, and one starts with SS—then the unique singleton starter SS is identified immediately by finding the single numeric code whose first digit appears only once!
  2. Read Off the Entire Singleton Row: Once the unique word is matched to its unique code, you instantly know the digit for every letter in that word.
  3. Cross-Reference Last-Column or Repeated Internal Letters: Use a word with repeated letters (such as MASA, which has identical 2nd and 4th letters) to lock in the remaining ambiguity and eliminate wrong options.

Worked Example 2: Cracking a 5-Word Coding Matrix

Five words (KASA, KIRA, SIRA, MARK, MASA) are paired in scrambled order with the five numeric codes 4232, 4752, 3752, 8254, 8232. What is the code for KIRA?

  1. Inspect First Letters (K, K, S, M, M) vs. First Digits (4, 4, 3, 8, 8): S is the only first letter appearing once, and 3 is the only first digit appearing once. Thus S = 3 and SIRA = 3752, which immediately gives I = 7, R = 5, and A = 2!
  2. Inspect Last Letters (A, A, A, K, A) vs. Last Digits (2, 2, 2, 4, 2): Four words end in A = 2, while only MARK ends in K. The only code ending in 4 is 8254, so MARK = 8254, giving M = 8 and K = 4.
  3. Assemble KIRA: Since K = 4, I = 7, R = 5, A = 2, the code for KIRA is 4752.

3. Custom Symbolic Operators (Sembolik İşlemler)

Unlike standard algebraic operators where the formula for a⋆ba \star b is explicitly given, Sembolik İşlemler in the aptitude section give three numerical input-output equations and ask you to discover the hidden formula f(a,b)f(a, b) before evaluating a fourth expression.

When testing candidate rules for a⋆b=ca \star b = c, check these four families in order:

  1. Linear & Bilinear Combinations: a⋅b±(a+b)a \cdot b \pm (a + b), a⋅b±(a−b)a \cdot b \pm (a - b), or m⋅a+n⋅bm \cdot a + n \cdot b.
  2. Asymmetric Power Rules: a2±ba^2 \pm b, a2±b2a^2 \pm b^2, ab±ba^b \pm b, or (a±b)2(a \pm b)^2.
  3. Rational Quotients: a+ba−b\frac{a + b}{a - b} or a⋅ba+b\frac{a \cdot b}{a + b}.
  4. Positional Digit Concatenation: Writing a+ba + b next to a−ba - b (for example, 7⋆3=1047 \star 3 = 104 because 7+3=107 + 3 = 10 and 7−3=47 - 3 = 4 concatenated give 104).

Worked Example 3: Deducing a Hidden Binary Operator

Given the three operational examples:

6▲2=34,5▲3=22,7▲4=456 \blacktriangle 2 = 34, \qquad 5 \blacktriangle 3 = 22, \qquad 7 \blacktriangle 4 = 45

Find the value of 8▲58 \blacktriangle 5.

  1. Analyze the first pair (6,2→346, 2 \to 34): Notice that 3434 is just below 62=366^2 = 36, specifically 62−2=346^2 - 2 = 34.
  2. Verify on Example 2 (5,3→225, 3 \to 22): 52−3=25−3=225^2 - 3 = 25 - 3 = 22 (Confirmed).
  3. Verify on Example 3 (7,4→457, 4 \to 45): 72−4=49−4=457^2 - 4 = 49 - 4 = 45 (Confirmed).
  4. Evaluate target (8▲58 \blacktriangle 5): Using a▲b=a2−ba \blacktriangle b = a^2 - b, we obtain 82−5=64−5=598^2 - 5 = 64 - 5 = 59.

Cryptarithmetic & Coding Quick-Reference Table

Pattern / SubtypeStructural Identity or BoundImmediate DeductionTime-Saving Application
Symmetric 2-Digit SumAB‾+BA‾=11(A+B)\overline{AB} + \overline{BA} = 11(A + B)Sum is always divisible by 1111Divide right-hand side by 1111 to get A+BA + B
Symmetric 2-Digit DiffAB‾−BA‾=9(A−B)\overline{AB} - \overline{BA} = 9(A - B)Difference is always divisible by 99Divide right-hand side by 99 to get A−BA - B
Cyclic 3-Digit SumABC‾+BCA‾+CAB‾=111(A+B+C)\overline{ABC} + \overline{BCA} + \overline{CAB} = 111(A+B+C)Sum is divisible by 111=3×37111 = 3 \times 37Divide total by 111111 to get A+B+CA + B + C
Repdigit 3-Digit ProductBBB‾=111B=3×37×B\overline{BBB} = 111B = 3 \times 37 \times BContains prime factor 3737If the integer multiplier kk is coprime to 3737, then AB‾\overline{AB} must be a multiple of 3737 (3737 or 7474)
2-Term Carry BoundAB‾+CD‾=EFG‾\overline{AB} + \overline{CD} = \overline{EFG}Max sum is 99+98=197<20099 + 98 = 197 < 200Leading hundreds digit EE is guaranteed to equal 11
Units Square InvariantB×B≡B(mod10)B \times B \equiv B \pmod{10}Units digit reproduces itselfRestricts BB to {0,1,5,6}\{0, 1, 5, 6\} immediately

Review the Method

Custom symbolic operators (Sembolik İşlemler) hide a two-input formula a ★ b = f(a, b) that must be inferred and verified across all three given numerical examples

Test Your Knowledge

In the base-10 cryptarithmetic addition AB + BA = 143, A and B are non-zero digits satisfying A - B = 3. What is the product A × B?

A

40

B

36

C

42

D

28

Test Your Knowledge

In the vertical multiplication AB × 6 = BBB, where A and B represent distinct non-zero base-10 digits, what is the sum A + B?

A

9

B

10

C

12

D

11

Test Your Knowledge

The five words TALA, KALA, TAKI, KATI, and LAKA are encoded in scrambled order as 9282, 3282, 9237, 3297, and 8232. Which numeric code represents the word KATI?

A

9237

B

3297

C

3282

D

8232

Test Your Knowledge

A hidden binary operator ◊ on positive integers satisfies 4 ◊ 3 = 22, 6 ◊ 2 = 40, and 5 ◊ 4 = 33. What is the value of 7 ◊ 3?

A

46

B

52

C

55

D

61

Sections you finish are checked off in the contents.