Study guide

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

TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy

1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing

2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic

2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators

3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out

3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)

4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic

4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections

6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic

6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings

7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic

7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals

8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)

9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities

9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)

10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems

10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems

11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics

11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas

12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus

12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment

13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons

13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares

14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry

14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles

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

Key Takeaways Explain This Topic AI

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 , … , 9 0, 1, 2, \dots, 9 0 , 1 , 2 , … , 9 ) in a vertical addition, subtraction, multiplication, or division layout are replaced by capital letters ( A , B , C , K , L , M A, B, C, K, L, M A , B , C , K , L , M ) or geometric icons ( ▲ , ■ , ● ). Three universal conventions govern these problems:

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).

No Leading Zero Rule: The leftmost digit of any multi-digit number can never be 0 0 0 (for example, in A B C ‾ \overline{ABC} A BC , A ∈ { 1 , 2 , … , 9 } A \in \{1, 2, \dots, 9\} A ∈ { 1 , 2 , … , 9 } ).

Base-10 Carry ( Elde ) Bounds:

Adding two single digits ( X + Y X + Y X + Y , plus a possible incoming carry of 1 1 1 ) has a maximum sum of 9 + 9 + 1 = 19 9 + 9 + 1 = 19 9 + 9 + 1 = 19 , so the outgoing carry to the next column left is at most 1 1 1 .

Adding three single digits ( X + Y + Z X + Y + Z X + Y + Z , plus an incoming carry of at most 2 2 2 ) has a maximum sum of 9 + 9 + 9 + 2 = 29 9 + 9 + 9 + 2 = 29 9 + 9 + 9 + 2 = 29 , so the outgoing carry is at most 2 2 2 .

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

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

A B ‾ = 10 A + B \overline{AB} = 10A + B A B = 10 A + B and B A ‾ = 10 B + A ⟹ A B ‾ + B A ‾ = 11 ( A + B ) \overline{BA} = 10B + A \implies \overline{AB} + \overline{BA} = 11(A + B) B A = 10 B + A ⟹ A B + B A = 11 ( A + B ) and A B ‾ − B A ‾ = 9 ( A − B ) \overline{AB} - \overline{BA} = 9(A - B) A B − B A = 9 ( A − B )

A A ‾ = 11 A \overline{AA} = 11A AA = 11 A and A A A ‾ = 111 A = 3 × 37 × A \overline{AAA} = 111A = 3 \times 37 \times A AAA = 111 A = 3 × 37 × A (Note the prime factor 37 37 37 —it can simplify B B B ‾ \overline{BBB} BBB multiplication puzzle!)

A B C ‾ + B C A ‾ + C A B ‾ = 111 ( A + B + C ) \overline{ABC} + \overline{BCA} + \overline{CAB} = 111(A + B + C) A BC + BC A + C A B = 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 ( m o d 10 ) ⟹ B = 0 A + B \equiv A \pmod{10} \implies B = 0 A + B ≡ A ( mod 10 ) ⟹ B = 0 (if there is no incoming carry) or B = 9 B = 9 B = 9 (if there is an incoming carry of 1 1 1 from the column to the right).

Idempotent Square Digits: B × B ≡ B ( m o d 10 ) ⟹ B ∈ { 0 , 1 , 5 , 6 } B \times B \equiv B \pmod{10} \implies B \in \{0, 1, 5, 6\} B × B ≡ B ( mod 10 ) ⟹ B ∈ { 0 , 1 , 5 , 6 } because 0 2 = 0 0^2 = 0 0 2 = 0 , 1 2 = 1 1^2 = 1 1 2 = 1 , 5 2 = 25 5^2 = 25 5 2 = 25 , and 6 2 = 36 6^2 = 36 6 2 = 36 .

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

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

Apply the Leading Carry Bound: A B ‾ \overline{AB} A B and B C ‾ \overline{BC} BC are two 2-digit numbers, so their sum B C B ‾ \overline{BCB} BCB is a 3-digit number less than 199 199 199 . Therefore, the hundreds digit B B B must equal 1 1 1 ( B = 1 B = 1 B = 1 ).

Substitute B = 1 B = 1 B = 1 and expand by place value: A 1 ‾ + 1 C ‾ = 1 C 1 ‾ ⟹ ( 10 A + 1 ) + ( 10 + C ) = 100 + 10 C + 1 \overline{A1} + \overline{1C} = \overline{1C1} \implies (10A + 1) + (10 + C) = 100 + 10C + 1 A 1 + 1 C = 1 C 1 ⟹ ( 10 A + 1 ) + ( 10 + C ) = 100 + 10 C + 1

Simplify the linear Diophantine equation: 10 A + 11 + C = 101 + 10 C ⟹ 10 A − 9 C = 90 ⟹ 10 ( A − 9 ) = 9 C 10A + 11 + C = 101 + 10C \implies 10A - 9C = 90 \implies 10(A - 9) = 9C 10 A + 11 + C = 101 + 10 C ⟹ 10 A − 9 C = 90 ⟹ 10 ( A − 9 ) = 9 C

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

4. Compute the sum: A + B + C = 9 + 1 + 0 = 10 A + B + C = 9 + 1 + 0 = 10 A + 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 n n n (last letter) :

Count First-Column Multiplicities: If the five words start with letters having frequency distribution ( 2 , 2 , 1 ) (2, 2, 1) ( 2 , 2 , 1 ) —meaning two words start with K K K , two start with M M M , and one starts with S S S —then the unique singleton starter S S S is identified immediately by finding the single numeric code whose first digit appears only once!

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.

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 ?

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 !

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 .

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 ⋆ b a \star b a ⋆ 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) f ( a , b ) before evaluating a fourth expression.

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

Linear & Bilinear Combinations: a ⋅ b ± ( a + b ) a \cdot b \pm (a + b) a ⋅ b ± ( a + b ) , a ⋅ b ± ( a − b ) a \cdot b \pm (a - b) a ⋅ b ± ( a − b ) , or m ⋅ a + n ⋅ b m \cdot a + n \cdot b m ⋅ a + n ⋅ b .

Asymmetric Power Rules: a 2 ± b a^2 \pm b a 2 ± b , a 2 ± b 2 a^2 \pm b^2 a 2 ± b 2 , a b ± b a^b \pm b a b ± b , or ( a ± b ) 2 (a \pm b)^2 ( a ± b ) 2 .

Rational Quotients: a + b a − b \frac{a + b}{a - b} a − b a + b ​ or a ⋅ b a + b \frac{a \cdot b}{a + b} a + b a ⋅ b ​ .

Positional Digit Concatenation: Writing a + b a + b a + b next to a − b a - b a − b (for example, 7 ⋆ 3 = 104 7 \star 3 = 104 7 ⋆ 3 = 104 because 7 + 3 = 10 7 + 3 = 10 7 + 3 = 10 and 7 − 3 = 4 7 - 3 = 4 7 − 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 = 45 6 \blacktriangle 2 = 34, \qquad 5 \blacktriangle 3 = 22, \qquad 7 \blacktriangle 4 = 45 6 ▲ 2 = 34 , 5 ▲ 3 = 22 , 7 ▲ 4 = 45

Find the value of 8 ▲ 5 8 \blacktriangle 5 8 ▲ 5 .

Analyze the first pair ( 6 , 2 → 34 6, 2 \to 34 6 , 2 → 34 ): Notice that 34 34 34 is just below 6 2 = 36 6^2 = 36 6 2 = 36 , specifically 6 2 − 2 = 34 6^2 - 2 = 34 6 2 − 2 = 34 .

Verify on Example 2 ( 5 , 3 → 22 5, 3 \to 22 5 , 3 → 22 ): 5 2 − 3 = 25 − 3 = 22 5^2 - 3 = 25 - 3 = 22 5 2 − 3 = 25 − 3 = 22 (Confirmed).

Verify on Example 3 ( 7 , 4 → 45 7, 4 \to 45 7 , 4 → 45 ): 7 2 − 4 = 49 − 4 = 45 7^2 - 4 = 49 - 4 = 45 7 2 − 4 = 49 − 4 = 45 (Confirmed).

Evaluate target ( 8 ▲ 5 8 \blacktriangle 5 8 ▲ 5 ): Using a ▲ b = a 2 − b a \blacktriangle b = a^2 - b a ▲ b = a 2 − b , we obtain 8 2 − 5 = 64 − 5 = 59 8^2 - 5 = 64 - 5 = 59 8 2 − 5 = 64 − 5 = 59 .

Cryptarithmetic & Coding Quick-Reference Table

Pattern / Subtype Structural Identity or Bound Immediate Deduction Time-Saving Application

Symmetric 2-Digit Sum A B ‾ + B A ‾ = 11 ( A + B ) \overline{AB} + \overline{BA} = 11(A + B) A B + B A = 11 ( A + B ) Sum is always divisible by 11 11 11 Divide right-hand side by 11 11 11 to get A + B A + B A + B

Symmetric 2-Digit Diff A B ‾ − B A ‾ = 9 ( A − B ) \overline{AB} - \overline{BA} = 9(A - B) A B − B A = 9 ( A − B ) Difference is always divisible by 9 9 9 Divide right-hand side by 9 9 9 to get A − B A - B A − B

Cyclic 3-Digit Sum A B C ‾ + B C A ‾ + C A B ‾ = 111 ( A + B + C ) \overline{ABC} + \overline{BCA} + \overline{CAB} = 111(A+B+C) A BC + BC A + C A B = 111 ( A + B + C ) Sum is divisible by 111 = 3 × 37 111 = 3 \times 37 111 = 3 × 37 Divide total by 111 111 111 to get A + B + C A + B + C A + B + C

Repdigit 3-Digit Product B B B ‾ = 111 B = 3 × 37 × B \overline{BBB} = 111B = 3 \times 37 \times B BBB = 111 B = 3 × 37 × B Contains prime factor 37 37 37 If the integer multiplier k k k is coprime to 37 37 37 , then A B ‾ \overline{AB} A B must be a multiple of 37 37 37 ( 37 37 37 or 74 74 74 )

2-Term Carry Bound A B ‾ + C D ‾ = E F G ‾ \overline{AB} + \overline{CD} = \overline{EFG} A B + C D = EFG Max sum is 99 + 98 = 197 < 200 99 + 98 = 197 < 200 99 + 98 = 197 < 200 Leading hundreds digit E E E is guaranteed to equal 1 1 1

Units Square Invariant B × B ≡ B ( m o d 10 ) B \times B \equiv B \pmod{10} B × B ≡ B ( mod 10 ) Units digit reproduces itself Restricts B B B to { 0 , 1 , 5 , 6 } \{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