Study guide

8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği)

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

8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği)

Key Takeaways Explain This Topic AI

In Turkish mathematics notation, the set of natural numbers includes zero ( N = { 0 , 1 , 2 , 3 , … } \mathbb{N} = \{0, 1, 2, 3, \dots\} N = { 0 , 1 , 2 , 3 , … } ), whereas counting numbers (Sayma Sayıları) start at one ( N + = Z + = { 1 , 2 , 3 , … } \mathbb{N}^+ = \mathbb{Z}^+ = \{1, 2, 3, \dots\} N + = Z + = { 1 , 2 , 3 , … } ).

Parity rules ( O ± O = E O \pm O = E O ± O = E , E ± O = O E \pm O = O E ± O = O , O × O = O O \times O = O O × O = O ) and positive-exponent power rules apply strictly when variables are known to be integers; if a ∈ R a \in \mathbb{R} a ∈ R or exponents can be zero or negative, test non-integer and zero-power counterexamples.

For any arithmetic sequence with constant step d d d , the number of terms is Last − First d + 1 \frac{\text{Last} - \text{First}}{d} + 1 d Last − First ​ + 1 and the sum is ( Number of Terms ) × First + Last 2 (\text{Number of Terms}) \times \frac{\text{First} + \text{Last}}{2} ( Number of Terms ) × 2 First + Last ​ .

Legendre's formula counts the exact power of a prime p p p dividing n ! n! n ! via ∑ k ≥ 1 ⌊ n p k ⌋ \sum_{k \ge 1} \lfloor \frac{n}{p^k} \rfloor ∑ k ≥ 1 ​ ⌊ p k n ​ ⌋ ; the number of trailing zeros of n ! n! n ! equals the exponent of 5 5 5 in its prime factorization.

A positional numeral ( d k … d 1 d 0 ) b = ∑ i = 0 k d i b i (d_k \dots d_1 d_0)_b = \sum_{i=0}^k d_i b^i ( d k ​ … d 1 ​ d 0 ​ ) b ​ = ∑ i = 0 k ​ d i ​ b i is valid if and only if the base b ≥ 2 b \ge 2 b ≥ 2 , the leading digit d k ≠ 0 d_k \ne 0 d k ​  = 0 , and every digit satisfies 0 ≤ d i < b 0 \le d_i < b 0 ≤ d i ​ < b .

Last updated: October 2026

  • 8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base- n n n Arithmetic (Taban Aritmetiği)
  • 1. Turkish Exam Number Set Notation ( Temel Kavramlar ve Sayı Kümeleri )

Before solving any equation or inequality, inspect the set membership symbol ( ∈ \in ∈ ) given at the top of the question. Turkish mathematics conventions use strict definitions that differ slightly from some international textbooks:

Digits ( Rakamlar ): The ten base-10 symbols used to write numerals: Rakamlar = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } \text{Rakamlar} = \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\} Rakamlar = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }

Every digit is a number, but multi-digit or negative integers are not digits. If a question specifies that a , b , c a, b, c a , b , c are rakamlar , they are automatically bounded by 0 ≤ a , b , c ≤ 9 0 \le a, b, c \le 9 0 ≤ a , b , c ≤ 9 . Read carefully whether the problem says rakamları farklı (distinct digits).

Natural Numbers ( Doğal Sayılar , N \mathbb{N} N ): In the Turkish curriculum, zero is a natural number : N = { 0 , 1 , 2 , 3 , 4 , … } \mathbb{N} = \{0, 1, 2, 3, 4, \dots\} N = { 0 , 1 , 2 , 3 , 4 , … }

Counting Numbers ( Sayma Sayıları , N + \mathbb{N}^+ N + or Z + \mathbb{Z}^+ Z + ): Positive integers starting at 1 1 1 : N + = Z + = { 1 , 2 , 3 , 4 , … } \mathbb{N}^+ = \mathbb{Z}^+ = \{1, 2, 3, 4, \dots\} N + = Z + = { 1 , 2 , 3 , 4 , … }

Integers ( Tam Sayılar , Z \mathbb{Z} Z ): The union of negative integers, zero, and positive integers: Z = Z − ∪ { 0 } ∪ Z + = { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } \mathbb{Z} = \mathbb{Z}^- \cup \{0\} \cup \mathbb{Z}^+ = \{\dots, -3, -2, -1, 0, 1, 2, 3, \dots\} Z = Z − ∪ { 0 } ∪ Z + = { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … }

Crucially, 0 0 0 is neither positive nor negative ( 0 ∉ Z + 0 \notin \mathbb{Z}^+ 0 ∈ / Z + and 0 ∉ Z − 0 \notin \mathbb{Z}^- 0 ∈ / Z − ). Whenever a question asks for the minimum natural number, consider 0 0 0 ; whenever it asks for the minimum counting number or positive integer, start at 1 1 1 .

Rational ( Rasyonel , Q \mathbb{Q} Q ), Irrational ( İrrasyonel , Q ′ \mathbb{Q}' Q ′ or I \mathbb{I} I ), and Real Numbers ( Gerçek / Reel Sayılar , R \mathbb{R} R ): Q = { a b | a , b ∈ Z , b ≠ 0 } , R = Q ∪ Q ′ \mathbb{Q} = \left\{\frac{a}{b} \;\middle|\; a, b \in \mathbb{Z},\; b \ne 0\right\}, \qquad \mathbb{R} = \mathbb{Q} \cup \mathbb{Q}' Q = { b a ​ ​ a , b ∈ Z , b  = 0 } , R = Q ∪ Q ′

Sum-Product Extremum Rules ( Toplam-Çarpım Ekstremum Kuralları )

Fixed Sum, Extremize Product ( a + b = S a + b = S a + b = S for a , b ∈ N + a, b \in \mathbb{N}^+ a , b ∈ N + ):

To maximize a ⋅ b a \cdot b a ⋅ b , choose a a a and b b b as close to each other as possible (equal if permitted; otherwise the closest distinct integers compatible with the sum).

To minimize a ⋅ b a \cdot b a ⋅ b , choose a a a and b b b as far apart as possible (e.g., 1 1 1 and S − 1 S - 1 S − 1 in N + \mathbb{N}^+ N + , or 0 0 0 and S S S in N \mathbb{N} N ).

Fixed Product, Extremize Sum ( a ⋅ b = P a \cdot b = P a ⋅ b = P for a , b ∈ N + a, b \in \mathbb{N}^+ a , b ∈ N + ):

To maximize a + b a + b a + b , choose factors as far apart as possible ( 1 1 1 and P P P ).

To minimize a + b a + b a + b , choose factors as close together as possible .

The Domain Trap ( Z \mathbb{Z} Z vs. R \mathbb{R} R ):

If a , b ∈ Z a, b \in \mathbb{Z} a , b ∈ Z (allowing negatives) and a ⋅ b = 24 a \cdot b = 24 a ⋅ b = 24 , the minimum value of a + b a + b a + b is not 4 + 6 = 10 4 + 6 = 10 4 + 6 = 10 , but ( − 1 ) + ( − 24 ) = − 25 (-1) + (-24) = -25 ( − 1 ) + ( − 24 ) = − 25 !

If a , b ∈ R + a, b \in \mathbb{R}^+ a , b ∈ R + and a + b = 9 a + b = 9 a + b = 9 , you are not restricted to integers 4 4 4 and 5 5 5 ; the maximum product occurs at a = b = 9 2 = 4.5 a = b = \frac{9}{2} = 4.5 a = b = 2 9 ​ = 4.5 , yielding a ⋅ b = 81 4 = 20.25 a \cdot b = \frac{81}{4} = 20.25 a ⋅ b = 4 81 ​ = 20.25 .

2. Parity ( Tek ve Çift Sayılar ), Sign Analysis ( İşaret İncelemesi ), and Consecutive Sums ( Ardışık Sayılar )

Parity Rules ( Tek = O, Çift = E )

Parity is a property of integers only ( Z \mathbb{Z} Z ); non-integer fractions have neither odd nor even parity. Let O O O denote an odd integer ( 2 k − 1 2k - 1 2 k − 1 ) and E E E denote an even integer ( 2 k 2k 2 k , including 0 0 0 and negative evens like − 4 -4 − 4 ): O ± O = E , E ± E = E , O ± E = O O \pm O = E, \qquad E \pm E = E, \qquad O \pm E = O O ± O = E , E ± E = E , O ± E = O O × O = O , E × O = E , E × E = E O \times O = O, \qquad E \times O = E, \qquad E \times E = E O × O = O , E × O = E , E × E = E

A product x 1 x 2 ⋯ x m x_1 x_2 \cdots x_m x 1 ​ x 2 ​ ⋯ x m ​ of integers is odd if and only if every single factor is odd ; if at least one factor is even, the entire product is even.

For positive integer exponents ( n ∈ Z + n \in \mathbb{Z}^+ n ∈ Z + ), exponentiation preserves parity: O n = O O^n = O O n = O and E n = E E^n = E E n = E . However, watch for two classic TR-YÖS traps:

Zero or Negative Exponents: If n ∈ N n \in \mathbb{N} n ∈ N or n ∈ Z n \in \mathbb{Z} n ∈ Z , an even base raised to the zero power becomes odd ( 2 0 = 1 2^0 = 1 2 0 = 1 ), and negative exponents yield non-integers ( 2 − 2 = 1 4 2^{-2} = \frac{1}{4} 2 − 2 = 4 1 ​ ).

Unconstrained Base ( a ∈ R a \in \mathbb{R} a ∈ R ): If a problem states " a 2 a^2 a 2 is an even integer" without declaring a ∈ Z a \in \mathbb{Z} a ∈ Z , you cannot conclude that a a a is an even integer (for example, a = 6 a = \sqrt{6} a = 6 ​ gives a 2 = 6 a^2 = 6 a 2 = 6 , which is even, yet a 3 = 6 6 a^3 = 6\sqrt{6} a 3 = 6 6 ​ is not even an integer).

Sign Analysis ( İşaret İncelemesi )

When determining signs of x , y , z ∈ R ∖ { 0 } x, y, z \in \mathbb{R} \setminus \{0\} x , y , z ∈ R ∖ { 0 } from inequalities such as x 2 k ⋅ y 2 m + 1 < 0 x^{2k} \cdot y^{2m+1} < 0 x 2 k ⋅ y 2 m + 1 < 0 :

Any even power x 2 k x^{2k} x 2 k is strictly positive ( x 2 k > 0 x^{2k} > 0 x 2 k > 0 ) regardless of whether x x x is positive or negative. Cancel x 2 k x^{2k} x 2 k from multiplicative sign inequalities immediately (retaining only that x ≠ 0 x \ne 0 x  = 0 ), without flipping the inequality sign.

Any odd power y 2 m + 1 y^{2m+1} y 2 m + 1 has the exact same sign as y y y : replace y 2 m + 1 y^{2m+1} y 2 m + 1 with y 1 = y y^1 = y y 1 = y .

Consecutive Numbers & Gauss Summation ( Ardışık Sayılar ve Toplam Formülleri )

Consecutive integers advance by 1 1 1 ( n , n + 1 , n + 2 n, n+1, n+2 n , n + 1 , n + 2 ), while consecutive even or consecutive odd integers both advance by step 2 2 2 ( n , n + 2 , n + 4 n, n+2, n+4 n , n + 2 , n + 4 ). Consequently, the difference between any two consecutive terms in an even or odd sequence is ± 2 \pm 2 ± 2 , independent of n n n .

For any arithmetic progression a 1 , a 2 , … , a k a_1, a_2, \dots, a_k a 1 ​ , a 2 ​ , … , a k ​ with constant step d d d : Number of Terms (Terim Sayısı) = Last Term − First Term d + 1 \text{Number of Terms (Terim Sayısı)} = \frac{\text{Last Term} - \text{First Term}}{d} + 1 Number of Terms (Terim Say ı s ı ) = d Last Term − First Term ​ + 1 Sum (Toplam) = ( Number of Terms ) × ( First Term + Last Term 2 ) \text{Sum (Toplam)} = (\text{Number of Terms}) \times \left(\frac{\text{First Term} + \text{Last Term}}{2}\right) Sum (Toplam) = ( Number of Terms ) × ( 2 First Term + Last Term ​ )

Memorize the three foundational Gauss formulas starting at 1 1 1 :

First n n n counting numbers: 1 + 2 + 3 + ⋯ + n = n ( n + 1 ) 2 1 + 2 + 3 + \dots + n = \frac{n(n+1)}{2} 1 + 2 + 3 + ⋯ + n = 2 n ( n + 1 ) ​

First n n n positive even integers: 2 + 4 + 6 + ⋯ + 2 n = n ( n + 1 ) 2 + 4 + 6 + \dots + 2n = n(n+1) 2 + 4 + 6 + ⋯ + 2 n = n ( n + 1 )

First n n n positive odd integers: 1 + 3 + 5 + ⋯ + ( 2 n − 1 ) = n 2 1 + 3 + 5 + \dots + (2n-1) = n^2 1 + 3 + 5 + ⋯ + ( 2 n − 1 ) = n 2

3. Factorials ( Faktöriyel ) & Legendre's Formula

For n ∈ N n \in \mathbb{N} n ∈ N , the factorial n ! n! n ! is defined by 0 ! = 1 0! = 1 0 ! = 1 , 1 ! = 1 1! = 1 1 ! = 1 , and n ! = n ⋅ ( n − 1 ) ! n! = n \cdot (n-1)! n ! = n ⋅ ( n − 1 )! for n ≥ 1 n \ge 1 n ≥ 1 . Using the elementary factorial definition, n ! n! n ! is defined for non-negative integers, an expression containing ( n − 4 ) ! (n - 4)! ( n − 4 )! and ( 4 − n ) ! (4 - n)! ( 4 − n )! simultaneously forces both n − 4 ≥ 0 n - 4 \ge 0 n − 4 ≥ 0 and 4 − n ≥ 0 4 - n \ge 0 4 − n ≥ 0 , which immediately pins down n = 4 n = 4 n = 4 .

When simplifying fractions with sums or differences of factorials, factor out the smallest factorial : ( n + 1 ) ! − n ! ( n − 1 ) ! = n ! ( n + 1 − 1 ) ( n − 1 ) ! = n ⋅ ( n − 1 ) ! ⋅ n ( n − 1 ) ! = n 2 \frac{(n+1)! - n!}{(n-1)!} = \frac{n!(n + 1 - 1)}{(n-1)!} = \frac{n \cdot (n-1)! \cdot n}{(n-1)!} = n^2 ( n − 1 )! ( n + 1 )! − n ! ​ = ( n − 1 )! n ! ( n + 1 − 1 ) ​ = ( n − 1 )! n ⋅ ( n − 1 )! ⋅ n ​ = n 2

Legendre's Formula ( Faktöriyel İçindeki Asal Çarpan Sayısı )

To find the largest integer exponent x x x such that p x p^x p x divides n ! n! n ! (where p p p is prime ), divide n n n successively by p p p and sum the integer quotients: E p ( n ! ) = ⌊ n p ⌋ + ⌊ n p 2 ⌋ + ⌊ n p 3 ⌋ + ⋯ E_p(n!) = \left\lfloor \frac{n}{p} \right\rfloor + \left\lfloor \frac{n}{p^2} \right\rfloor + \left\lfloor \frac{n}{p^3} \right\rfloor + \cdots E p ​ ( n !) = ⌊ p n ​ ⌋ + ⌊ p 2 n ​ ⌋ + ⌊ p 3 n ​ ⌋ + ⋯

Composite Base Case: If asked for the maximum x x x in n ! = k x ⋅ m n! = k^x \cdot m n ! = k x ⋅ m where k k k is composite, factor k k k into primes first. For k = ∏ p i e i k=\prod p_i^{e_i} k = ∏ p i e i ​ ​ , the maximum exponent is min ⁡ i ⌊ E p i ( n ! ) / e i ⌋ \min_i\lfloor E_{p_i}(n!)/e_i\rfloor min i ​ ⌊ E p i ​ ​ ( n !) / e i ​ ⌋ . Check every prime-power constraint; the largest prime alone need not control the result.

Trailing Zeros ( Sondan Kaç Basamağı Sıfırdır ): Every trailing zero in base 10 10 10 corresponds to a factor of 10 = 2 × 5 10 = 2 \times 5 10 = 2 × 5 . Because E 2 ( n ! ) > E 5 ( n ! ) E_2(n!) > E_5(n!) E 2 ​ ( n !) > E 5 ​ ( n !) for all n ≥ 2 n \ge 2 n ≥ 2 , the number of trailing zeros of n ! n! n ! (and likewise the number of trailing 9 9 9 s of n ! − 1 n! - 1 n ! − 1 ) equals E 5 ( n ! ) E_5(n!) E 5 ​ ( n !) .

4. Positional Digit Decomposition ( Basamak Kavramı ) & Base- b b b Arithmetic ( Taban Aritmetiği )

A numeral ( d k … d 2 d 1 d 0 ) b (d_k \dots d_2 d_1 d_0)_b ( d k ​ … d 2 ​ d 1 ​ d 0 ​ ) b ​ written in integer base b ≥ 2 b \ge 2 b ≥ 2 represents the polynomial expansion: ( d k … d 2 d 1 d 0 ) b = d k b k + ⋯ + d 2 b 2 + d 1 b 1 + d 0 b 0 (d_k \dots d_2 d_1 d_0)_b = d_k b^k + \dots + d_2 b^2 + d_1 b^1 + d_0 b^0 ( d k ​ … d 2 ​ d 1 ​ d 0 ​ ) b ​ = d k ​ b k + ⋯ + d 2 ​ b 2 + d 1 ​ b 1 + d 0 ​ b 0

subject to the strict digit constraint : 0 ≤ d i < b for all i , d k ≠ 0 0 \le d_i < b \quad \text{for all } i, \qquad d_k \ne 0 0 ≤ d i ​ < b for all i , d k ​  = 0

In base 10 10 10 , memorize the fast algebraic identities for two- and three-digit integers ( a b ) 10 = 10 a + b (ab)_{10} = 10a + b ( ab ) 10 ​ = 10 a + b and ( a b c ) 10 = 100 a + 10 b + c (abc)_{10} = 100a + 10b + c ( ab c ) 10 ​ = 100 a + 10 b + c :

( a b ) 10 + ( b a ) 10 = 11 ( a + b ) (ab)_{10} + (ba)_{10} = 11(a + b) ( ab ) 10 ​ + ( ba ) 10 ​ = 11 ( a + b )

( a b ) 10 − ( b a ) 10 = 9 ( a − b ) (ab)_{10} - (ba)_{10} = 9(a - b) ( ab ) 10 ​ − ( ba ) 10 ​ = 9 ( a − b )

( a b c ) 10 − ( c b a ) 10 = 99 ( a − c ) (abc)_{10} - (cba)_{10} = 99(a - c) ( ab c ) 10 ​ − ( c ba ) 10 ​ = 99 ( a − c ) (notice the middle digit b b b cancels completely!)

( a b c ) 10 + ( b c a ) 10 + ( c a b ) 10 = 111 ( a + b + c ) (abc)_{10} + (bca)_{10} + (cab)_{10} = 111(a + b + c) ( ab c ) 10 ​ + ( b c a ) 10 ​ + ( c ab ) 10 ​ = 111 ( a + b + c )

Direct Operations in Base b b b

Addition in Base b b b : Add column by column from right to left. Whenever a column sum S ≥ b S \ge b S ≥ b , write down the remainder ( S m o d b ) (S \bmod b) ( S mod b ) and carry the quotient ⌊ S / b ⌋ \lfloor S / b \rfloor ⌊ S / b ⌋ to the next column.

Subtraction in Base b b b : When the top digit is smaller than the bottom digit in a column, borrow 1 1 1 unit from the next left column, which adds + b +b + b (not + 10 +10 + 10 !) to the current column.

Multiplication in Base b b b : Multiply digit by digit from right to left just as in base 10 10 10 , but divide every intermediate product P P P (plus any incoming carry) by the base b b b : write down the remainder ( P m o d b ) (P \bmod b) ( P mod b ) in the current column and carry the quotient ⌊ P / b ⌋ \lfloor P / b \rfloor ⌊ P / b ⌋ to the next left column, then add the shifted partial products in base b b b .

Parity of ( d k … d 1 d 0 ) b (d_k \dots d_1 d_0)_b ( d k ​ … d 1 ​ d 0 ​ ) b ​ : If the base b b b is even , parity depends solely on the last digit d 0 d_0 d 0 ​ . If the base b b b is odd , parity equals the parity of the sum of the digits d k + ⋯ + d 1 + d 0 d_k + \dots + d_1 + d_0 d k ​ + ⋯ + d 1 ​ + d 0 ​ .

Summary Reference Table

Concept / Structure Formula or Rule Critical Exam Condition

Natural vs. Counting Numbers N = { 0 , 1 , 2 , … } \mathbb{N} = \{0, 1, 2, \dots\} N = { 0 , 1 , 2 , … } vs. N + = { 1 , 2 , … } \mathbb{N}^+ = \{1, 2, \dots\} N + = { 1 , 2 , … } 0 ∈ N 0 \in \mathbb{N} 0 ∈ N , 0 ∉ Z + 0 \notin \mathbb{Z}^+ 0 ∈ / Z + , 0 ∉ Z − 0 \notin \mathbb{Z}^- 0 ∈ / Z −

Arithmetic Sum ( Ardışık Toplam ) ( Last − First Step + 1 ) ⋅ ( Last + First 2 ) \left(\frac{\text{Last} - \text{First}}{\text{Step}} + 1\right) \cdot \left(\frac{\text{Last} + \text{First}}{2}\right) ( Step Last − First ​ + 1 ) ⋅ ( 2 Last + First ​ ) Constant step d d d between consecutive terms

Legendre's Formula E p ( n ! ) = ∑ k ≥ 1 ⌊ n / p k ⌋ E_p(n!) = \sum_{k \ge 1} \lfloor n / p^k \rfloor E p ​ ( n !) = ∑ k ≥ 1 ​ ⌊ n / p k ⌋ p p p must be a prime number

Base-10 Reversal Identities ( a b ) − ( b a ) = 9 ( a − b ) (ab) - (ba) = 9(a-b) ( ab ) − ( ba ) = 9 ( a − b ) ; ( a b c ) − ( c b a ) = 99 ( a − c ) (abc) - (cba) = 99(a-c) ( ab c ) − ( c ba ) = 99 ( a − c ) a , c ≠ 0 a, c \ne 0 a , c  = 0 if both numerals are 2- or 3-digit

Base- b b b Decomposition ( a b c ) b = a b 2 + b 1 b + c (abc)_b = a b^2 + b_1 b + c ( ab c ) b ​ = a b 2 + b 1 ​ b + c b ≥ 2 b \ge 2 b ≥ 2 , a ≠ 0 a \ne 0 a  = 0 , and 0 ≤ a , b 1 , c < b 0 \le a, b_1, c < b 0 ≤ a , b 1 ​ , c < b

  • Worked Examples
  • Worked Example 8.1.1: Factorial Composite Divisors and Trailing Zeros

Problem: Let 63 ! = 15 x ⋅ 12 y ⋅ K 63! = 15^x \cdot 12^y \cdot K 63 ! = 1 5 x ⋅ 1 2 y ⋅ K , where x , y , K ∈ Z + x, y, K \in \mathbb{Z}^+ x , y , K ∈ Z + . Find the maximum possible value of x + y x + y x + y .

Solution:

Decompose the composite bases into primes: 15 x ⋅ 12 y = ( 3 ⋅ 5 ) x ⋅ ( 2 2 ⋅ 3 ) y = 2 2 y ⋅ 3 x + y ⋅ 5 x 15^x \cdot 12^y = (3 \cdot 5)^x \cdot (2^2 \cdot 3)^y = 2^{2y} \cdot 3^{x+y} \cdot 5^x 1 5 x ⋅ 1 2 y = ( 3 ⋅ 5 ) x ⋅ ( 2 2 ⋅ 3 ) y = 2 2 y ⋅ 3 x + y ⋅ 5 x

Count the available prime factors in 63 ! 63! 63 ! using Legendre's formula:

For p = 5 p = 5 p = 5 : ⌊ 63 / 5 ⌋ + ⌊ 12 / 5 ⌋ = 12 + 2 = 14 \lfloor 63/5 \rfloor + \lfloor 12/5 \rfloor = 12 + 2 = 14 ⌊ 63/5 ⌋ + ⌊ 12/5 ⌋ = 12 + 2 = 14 . Thus x ≤ 14 x \le 14 x ≤ 14 .

For p = 3 p = 3 p = 3 : ⌊ 63 / 3 ⌋ + ⌊ 21 / 3 ⌋ + ⌊ 7 / 3 ⌋ = 21 + 7 + 2 = 30 \lfloor 63/3 \rfloor + \lfloor 21/3 \rfloor + \lfloor 7/3 \rfloor = 21 + 7 + 2 = 30 ⌊ 63/3 ⌋ + ⌊ 21/3 ⌋ + ⌊ 7/3 ⌋ = 21 + 7 + 2 = 30 . Thus x + y ≤ 30 x + y \le 30 x + y ≤ 30 .

For p = 2 p = 2 p = 2 : ⌊ 63 / 2 ⌋ + ⌊ 31 / 2 ⌋ + ⌊ 15 / 2 ⌋ + ⌊ 7 / 2 ⌋ + ⌊ 3 / 2 ⌋ = 31 + 15 + 7 + 3 + 1 = 57 \lfloor 63/2 \rfloor + \lfloor 31/2 \rfloor + \lfloor 15/2 \rfloor + \lfloor 7/2 \rfloor + \lfloor 3/2 \rfloor = 31 + 15 + 7 + 3 + 1 = 57 ⌊ 63/2 ⌋ + ⌊ 31/2 ⌋ + ⌊ 15/2 ⌋ + ⌊ 7/2 ⌋ + ⌊ 3/2 ⌋ = 31 + 15 + 7 + 3 + 1 = 57 . Thus 2 y ≤ 57 ⟹ y ≤ 28 2y \le 57 \implies y \le 28 2 y ≤ 57 ⟹ y ≤ 28 .

Maximize x + y x + y x + y : The prime 3 3 3 directly bounds x + y ≤ 30 x + y \le 30 x + y ≤ 30 . Check whether x + y = 30 x + y = 30 x + y = 30 is achievable while satisfying x ≤ 14 x \le 14 x ≤ 14 and y ≤ 28 y \le 28 y ≤ 28 : choosing x = 14 x = 14 x = 14 and y = 16 y = 16 y = 16 satisfies 14 ≤ 14 14 \le 14 14 ≤ 14 , 16 ≤ 28 16 \le 28 16 ≤ 28 , and x , y ∈ Z + x, y \in \mathbb{Z}^+ x , y ∈ Z + . Therefore, max ⁡ ( x + y ) = 30 \max(x + y) = 30 max ( x + y ) = 30 .

Worked Example 8.1.2: Base- b b b Subtraction and Domain Constraints

Problem: Given the valid base- 7 7 7 subtraction ( a 4 c ) 7 − ( c 4 a ) 7 = ( 2 x 4 ) 7 (a4c)_7 - (c4a)_7 = (2x4)_7 ( a 4 c ) 7 ​ − ( c 4 a ) 7 ​ = ( 2 x 4 ) 7 ​ , determine the digit x x x and the difference a − c a - c a − c .

Solution:

Method 1 (Column Borrowing in Base 7 7 7 ): Since the difference ( 2 x 4 ) 7 (2x4)_7 ( 2 x 4 ) 7 ​ is positive, a > c a > c a > c .

Units column: Since c < a c < a c < a , we cannot subtract a a a from c c c directly. Borrow 1 1 1 from the sevens column, adding + 7 +7 + 7 to the units digit: ( c + 7 ) − a = 4 ⟹ a − c = 3 (c + 7) - a = 4 \implies a - c = 3 ( c + 7 ) − a = 4 ⟹ a − c = 3 .

Sevens column: The top digit 4 4 4 became 3 3 3 after lending 1 1 1 . Now 3 < 4 3 < 4 3 < 4 , so we borrow 1 1 1 from the 7 2 7^2 7 2 column, adding + 7 +7 + 7 : ( 3 + 7 ) − 4 = 6 ⟹ x = 6 (3 + 7) - 4 = 6 \implies x = 6 ( 3 + 7 ) − 4 = 6 ⟹ x = 6 .

Method 2 (Polynomial Expansion Verification): ( a 4 c ) 7 − ( c 4 a ) 7 = ( 49 a + 28 + c ) − ( 49 c + 28 + a ) = 48 ( a − c ) (a4c)_7 - (c4a)_7 = (49a + 28 + c) - (49c + 28 + a) = 48(a - c) ( a 4 c ) 7 ​ − ( c 4 a ) 7 ​ = ( 49 a + 28 + c ) − ( 49 c + 28 + a ) = 48 ( a − c )

With a − c = 3 a - c = 3 a − c = 3 , the value is 48 × 3 = 144 48 \times 3 = 144 48 × 3 = 144 in base 10 10 10 . Converting 144 144 144 to base 7 7 7 : 144 = 2 × 49 + 6 × 7 + 4 = ( 264 ) 7 144 = 2 \times 49 + 6 \times 7 + 4 = (264)_7 144 = 2 × 49 + 6 × 7 + 4 = ( 264 ) 7 ​ , confirming x = 6 x = 6 x = 6 and a − c = 3 a - c = 3 a − c = 3 .

Review the Method

A positional numeral ( d k … d 1 d 0 ) b = ∑ i = 0 k d i b i (d_k \dots d_1 d_0)_b = \sum_{i=0}^k d_i b^i ( d k ​ … d 1 ​ d 0 ​ ) b ​ = ∑ i = 0 k ​ d i ​ b i is valid if and only if the base b ≥ 2 b \ge 2 b ≥ 2 , the leading digit d k ≠ 0 d_k \ne 0 d k ​  = 0 , and every digit satisfies 0 ≤ d i < b 0 \le d_i < b 0 ≤ d i ​ < b .