Study guide

11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik)

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

11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik)

Key Takeaways Explain This Topic AI

An n-element set has 2^n total subsets and 2^n - 1 proper subsets (öz alt küme); fixing p specific elements as included or excluded leaves 2^(n-p) subsets, while requiring at least one of two elements {a, b} gives 2^n - 2^(n-2) subsets.

The Inclusion-Exclusion Principle governs union cardinalities: s(A ∪ B) = s(A) + s(B) - s(A ∩ B), while De Morgan's Laws relate complements via (A ∪ B)' = A' ∩ B' and s(A) + s(A') = s(E).

For a Cartesian product A × B, s(A × B) = s(A) · s(B) and the smallest circle enclosing all lattice points of A × B has radius R = (1/2)√((Δx_max)^2 + (Δy_max)^2).

For a binary operation, check a two-sided identity and inverse; an absorbing element must satisfy the defining operation on both sides.

In modular arithmetic, large exponents are reduced by finding the smallest positive period k where a^k ≡ 1 (mod m), provided gcd(a,m)=1 and replacing the exponent with its remainder modulo k.

Last updated: October 2026

Sets ( Kümeler ), Cartesian Products, Binary Operations & Modular Arithmetic

On the TR-YÖS , set theory, abstract binary operations ( işlem ), and modular arithmetic ( modüler aritmetik ) bridge foundational arithmetic and structural algebra. Questions in this domain rarely ask for long proofs; instead, they test whether you can immediately translate element constraints into powers of 2 2 2 , apply inclusion-exclusion without double-counting, extract identity and inverse elements from a custom algebraic rule, and collapse giant exponents using modular periods.

1. Sets ( Kümeler ) & Constrained Subset Counting

Let A A A be a finite set with cardinality ( eleman sayısı ) s ( A ) = n s(A) = n s ( A ) = n . Every element in A A A has two independent choices when forming a subset: either it is included or it is excluded.

  • Total Subsets ( Alt Küme Sayısı ): 2 n 2^n 2 n
  • Proper Subsets ( Öz Alt Küme Sayısı ): 2 n − 1 2^n - 1 2 n − 1 (all subsets except the set A A A itself)

k k k -Element Subsets ( $k$ Elemanlı Alt Küme Sayısı ): ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} ( k n ​ ) = k ! ( n − k )! n ! ​ , where ( n 0 ) + ( n 1 ) + ⋯ + ( n n ) = 2 n \binom{n}{0} + \binom{n}{1} + \cdots + \binom{n}{n} = 2^n ( 0 n ​ ) + ( 1 n ​ ) + ⋯ + ( n n ​ ) = 2 n and ( n k ) = ( n n − k ) \binom{n}{k} = \binom{n}{n-k} ( k n ​ ) = ( n − k n ​ ) .

Subsets with Element Constraints

Whenever a problem locks the status of p p p specific elements (either forcing them in or forcing them out ), those p p p elements lose their freedom of choice, leaving n − p n - p n − p free elements:

Contains (or does NOT contain) p p p specific elements: Both yield 2 n − p 2^{n-p} 2 n − p subsets. Even if p 1 p_1 p 1 ​ elements must be in and p 2 p_2 p 2 ​ elements must be out , the count is 2 n − ( p 1 + p 2 ) 2^{n - (p_1 + p_2)} 2 n − ( p 1 ​ + p 2 ​ ) .

Contains at least one of { a , b } \{a, b\} { a , b } ( $a$ veya $b$ bulunur ): Subtract the subsets containing neither a a a nor b b b from the total: Total − Neither ( a , b ) = 2 n − 2 n − 2 \text{Total} - \text{Neither}(a, b) = 2^n - 2^{n-2} Total − Neither ( a , b ) = 2 n − 2 n − 2

More generally, the number of subsets containing at least one of p p p specified elements is 2 n − 2 n − p 2^n - 2^{n-p} 2 n − 2 n − p .

3. Contains a a a OR b b b , but NOT both: Either a ∈ S , b ∉ S a \in S, b \notin S a ∈ S , b ∈ / S ( 2 n − 2 2^{n-2} 2 n − 2 ways) or a ∉ S , b ∈ S a \notin S, b \in S a ∈ / S , b ∈ S ( 2 n − 2 2^{n-2} 2 n − 2 ways), giving 2 ⋅ 2 n − 2 = 2 n − 1 2 \cdot 2^{n-2} = 2^{n-1} 2 ⋅ 2 n − 2 = 2 n − 1 subsets.

2. Set Operations, Complements & Inclusion-Exclusion

For sets A , B , C A, B, C A , B , C inside a universal set E E E ( evrensel küme ), the Inclusion-Exclusion Principle ( Birleşim Kümesinin Eleman Sayısı ) prevents double-counting elements in intersections: s ( A ∪ B ) = s ( A ) + s ( B ) − s ( A ∩ B ) s(A \cup B) = s(A) + s(B) - s(A \cap B) s ( A ∪ B ) = s ( A ) + s ( B ) − s ( A ∩ B )

Partitioning A ∪ B A \cup B A ∪ B into three mutually disjoint regions ( ayrık bölgeler ) gives the high-speed alternative: s ( A ∪ B ) = s ( A ∖ B ) + s ( B ∖ A ) + s ( A ∩ B ) s(A \cup B) = s(A \setminus B) + s(B \setminus A) + s(A \cap B) s ( A ∪ B ) = s ( A ∖ B ) + s ( B ∖ A ) + s ( A ∩ B )

For three sets: s ( A ∪ B ∪ C ) = s ( A ) + s ( B ) + s ( C ) − s ( A ∩ B ) − s ( A ∩ C ) − s ( B ∩ C ) + s ( A ∩ B ∩ C ) s(A \cup B \cup C) = s(A) + s(B) + s(C) - s(A \cap B) - s(A \cap C) - s(B \cap C) + s(A \cap B \cap C) s ( A ∪ B ∪ C ) = s ( A ) + s ( B ) + s ( C ) − s ( A ∩ B ) − s ( A ∩ C ) − s ( B ∩ C ) + s ( A ∩ B ∩ C )

Complements ( Tümleyen ) & De Morgan's Laws

The complement A ′ A' A ′ consists of all elements in E E E outside A A A :

Universal Partition: s ( A ) + s ( A ′ ) = s ( E ) s(A) + s(A') = s(E) s ( A ) + s ( A ′ ) = s ( E ) , which implies s ( A ) + s ( B ′ ) + s ( A ′ ) + s ( B ) = 2 ⋅ s ( E ) s(A) + s(B') + s(A') + s(B) = 2 \cdot s(E) s ( A ) + s ( B ′ ) + s ( A ′ ) + s ( B ) = 2 ⋅ s ( E ) .

Set Difference Conversion: A ∖ B = A ∩ B ′ A \setminus B = A \cap B' A ∖ B = A ∩ B ′ .

De Morgan's Laws: ( A ∪ B ) ′ = A ′ ∩ B ′ (A \cup B)' = A' \cap B' ( A ∪ B ) ′ = A ′ ∩ B ′ and ( A ∩ B ) ′ = A ′ ∪ B ′ (A \cap B)' = A' \cup B' ( A ∩ B ) ′ = A ′ ∪ B ′ .

3. Cartesian Products ( Kartezyen Çarpım )

The Cartesian product of A A A and B B B is the set of all ordered pairs A × B = { ( x , y ) ∣ x ∈ A and y ∈ B } A \times B = \{(x, y) \mid x \in A \text{ and } y \in B\} A × B = {( x , y ) ∣ x ∈ A and y ∈ B } .

Cardinality: s ( A × B ) = s ( A ) ⋅ s ( B ) s(A \times B) = s(A) \cdot s(B) s ( A × B ) = s ( A ) ⋅ s ( B ) , and s ( A × ( B ∪ C ) ) = s ( A ) ⋅ s ( B ∪ C ) s(A \times (B \cup C)) = s(A) \cdot s(B \cup C) s ( A × ( B ∪ C )) = s ( A ) ⋅ s ( B ∪ C ) .

Geometric Enclosing Formulas: When A , B ⊂ R A, B \subset \mathbb{R} A , B ⊂ R are finite sets of numbers, plotting A × B A \times B A × B on the coordinate plane creates a rectangular grid of lattice points with horizontal span Δ x max ⁡ = max ⁡ ( A ) − min ⁡ ( A ) \Delta x_{\max} = \max(A) - \min(A) Δ x m a x ​ = max ( A ) − min ( A ) and vertical span Δ y max ⁡ = max ⁡ ( B ) − min ⁡ ( B ) \Delta y_{\max} = \max(B) - \min(B) Δ y m a x ​ = max ( B ) − min ( B ) :

Smallest Enclosing Rectangle Area: Δ x max ⁡ ⋅ Δ y max ⁡ \Delta x_{\max} \cdot \Delta y_{\max} Δ x m a x ​ ⋅ Δ y m a x ​

Smallest Enclosing Circle Radius ( En Küçük Çemberin Yarıçapı ): The diagonal of the bounding rectangle is the diameter d = ( Δ x max ⁡ ) 2 + ( Δ y max ⁡ ) 2 d = \sqrt{(\Delta x_{\max})^2 + (\Delta y_{\max})^2} d = ( Δ x m a x ​ ) 2 + ( Δ y m a x ​ ) 2 ​ , so the radius is: R = 1 2 ( Δ x max ⁡ ) 2 + ( Δ y max ⁡ ) 2 R = \frac{1}{2}\sqrt{(\Delta x_{\max})^2 + (\Delta y_{\max})^2} R = 2 1 ​ ( Δ x m a x ​ ) 2 + ( Δ y m a x ​ ) 2 ​

4. Abstract Binary Operations ( İşlem )

An abstract binary operation ⋆ \star ⋆ on a set S S S assigns a formula to x ⋆ y x \star y x ⋆ y (for example, x ⋆ y = x + y − 1 2 x y x \star y = x + y - \frac{1}{2}xy x ⋆ y = x + y − 2 1 ​ x y ). Never guess the identity element to be 0 0 0 or 1 1 1 —always solve from the axioms in strict order:

Identity Element ( Birim / Etkisiz Eleman e e e ): Set x ⋆ e = x x \star e = x x ⋆ e = x (and e ⋆ x = x e \star x = x e ⋆ x = x ) and solve for e e e so that e e e is independent of x x x .

Inverse of an Element ( $x$'in Tersi x − 1 x^{-1} x − 1 ): Using the exact number e e e found in Step 1, set: x ⋆ x − 1 = e x \star x^{-1} = e x ⋆ x − 1 = e

and solve for x − 1 x^{-1} x − 1 . Check x − 1 ⋆ x = e x^{-1} \star x=e x − 1 ⋆ x = e as well; the two conditions coincide for a commutative operation.

3. Absorbing Element ( Yutan Eleman y y y ): An element y y y is absorbing if x ⋆ y = y x \star y=y x ⋆ y = y and y ⋆ x = y y \star x=y y ⋆ x = y for every x x x in the set. For the specific commutative operation x ⋆ y = x + y − 1 2 x y x \star y=x+y-\frac12xy x ⋆ y = x + y − 2 1 ​ x y , the identity is 0 0 0 and 2 2 2 is absorbing: x ⋆ 2 = x + 2 − x = 2 x \star 2=x+2-x=2 x ⋆ 2 = x + 2 − x = 2 . Since 2 ⋆ z 2 \star z 2 ⋆ z always equals 2 2 2 , it cannot equal the identity 0 0 0 , so 2 2 2 has no inverse. Do not infer an absorbing element merely from a vanishing factor in an identity equation; substitute it into both defining conditions.

Important

In a finite operation table ( işlem tablosu ), the identity element e e e must have a row that copies the column headers and a column that copies the row headers. To find a candidate a − 1 a^{-1} a − 1 , locate e e e inside row a a a and read its column header, then confirm that the reversed product also equals e e e .

5. Modular Arithmetic ( Modüler Aritmetik )

For integers a , b a, b a , b and modulus m ≥ 2 m \ge 2 m ≥ 2 , we write a ≡ b ( m o d m ) a \equiv b \pmod m a ≡ b ( mod m ) if and only if m m m divides ( a − b ) (a - b) ( a − b ) , meaning a a a and b b b leave the same remainder when divided by m m m .

Algebraic Compatibility: If a ≡ b ( m o d m ) a \equiv b \pmod m a ≡ b ( mod m ) and c ≡ d ( m o d m ) c \equiv d \pmod m c ≡ d ( mod m ) , then a ± c ≡ b ± d ( m o d m ) a \pm c \equiv b \pm d \pmod m a ± c ≡ b ± d ( mod m ) , a ⋅ c ≡ b ⋅ d ( m o d m ) a \cdot c \equiv b \cdot d \pmod m a ⋅ c ≡ b ⋅ d ( mod m ) , and a n ≡ b n ( m o d m ) a^n \equiv b^n \pmod m a n ≡ b n ( mod m ) .

Cyclic Power Reduction: To evaluate a N ( m o d m ) a^N \pmod m a N ( mod m ) for N ≥ 0 N\ge0 N ≥ 0 when gcd ⁡ ( a , m ) = 1 \gcd(a,m)=1 g cd ( a , m ) = 1 :

Reduce the base modulo m m m : replace a a a with r ≡ a ( m o d m ) r \equiv a \pmod m r ≡ a ( mod m ) (using negative remainders like m − 1 ≡ − 1 ( m o d m ) m - 1 \equiv -1 \pmod m m − 1 ≡ − 1 ( mod m ) whenever convenient).

Compute successive powers r 1 , r 2 , r 3 , … ( m o d m ) r^1, r^2, r^3, \dots \pmod m r 1 , r 2 , r 3 , … ( mod m ) until you find the smallest positive period k k k such that r k ≡ 1 ( m o d m ) r^k \equiv 1 \pmod m r k ≡ 1 ( mod m ) (by Fermat's Little Theorem, if p p p is prime and p ∤ a p \nmid a p ∤ a , then a p − 1 ≡ 1 ( m o d p ) a^{p-1} \equiv 1 \pmod p a p − 1 ≡ 1 ( mod p ) , so the period k k k divides p − 1 p - 1 p − 1 ).

Divide the exponent N N N by k k k : if N = k ⋅ q + s N = k \cdot q + s N = k ⋅ q + s with 0 ≤ s < k 0 \le s < k 0 ≤ s < k , then: a N ≡ ( r k ) q ⋅ r s ≡ 1 q ⋅ r s ≡ r s ( m o d m ) a^N \equiv (r^k)^q \cdot r^s \equiv 1^q \cdot r^s \equiv r^s \pmod m a N ≡ ( r k ) q ⋅ r s ≡ 1 q ⋅ r s ≡ r s ( mod m )

Units Digit ( Birler Basamağı ) Problems: Asking for the units digit of a number is identical to computing that number ( m o d 10 ) \pmod{10} ( mod 10 ) . For instance, to find the units digit of 2027 2026 2027^{2026} 202 7 2026 , reduce the base 2027 ≡ 7 ( m o d 10 ) 2027 \equiv 7 \pmod{10} 2027 ≡ 7 ( mod 10 ) . The powers of 7 7 7 modulo 10 10 10 cycle with period k = 4 k = 4 k = 4 : 7 1 ≡ 7 7^1 \equiv 7 7 1 ≡ 7 , 7 2 ≡ 9 7^2 \equiv 9 7 2 ≡ 9 , 7 3 ≡ 3 7^3 \equiv 3 7 3 ≡ 3 , 7 4 ≡ 1 ( m o d 10 ) 7^4 \equiv 1 \pmod{10} 7 4 ≡ 1 ( mod 10 ) . Dividing the exponent 2026 2026 2026 by 4 4 4 gives remainder 2 2 2 ( 2026 = 4 ⋅ 506 + 2 2026 = 4 \cdot 506 + 2 2026 = 4 ⋅ 506 + 2 ), so 2027 2026 ≡ 7 2 ≡ 9 ( m o d 10 ) 2027^{2026} \equiv 7^2 \equiv 9 \pmod{10} 202 7 2026 ≡ 7 2 ≡ 9 ( mod 10 ) .

Summary Reference Table

Concept / Topic Core Formula / Rule TR-YÖS Exam Shortcut

Constrained Subsets p p p fixed elements ( ∈ \in ∈ or ∉ \notin ∈ / ): 2 n − p 2^{n-p} 2 n − p "At least one of { a , b } \{a, b\} { a , b } ": 2 n − 2 n − 2 2^n - 2^{n-2} 2 n − 2 n − 2

Inclusion-Exclusion s ( A ∪ B ) = s ( A ) + s ( B ) − s ( A ∩ B ) s(A \cup B) = s(A) + s(B) - s(A \cap B) s ( A ∪ B ) = s ( A ) + s ( B ) − s ( A ∩ B ) Disjoint form: s ( A ∖ B ) + s ( B ∖ A ) + s ( A ∩ B ) s(A \setminus B) + s(B \setminus A) + s(A \cap B) s ( A ∖ B ) + s ( B ∖ A ) + s ( A ∩ B )

Cartesian Circle R = 1 2 ( Δ x max ⁡ ) 2 + ( Δ y max ⁡ ) 2 R = \frac{1}{2}\sqrt{(\Delta x_{\max})^2 + (\Delta y_{\max})^2} R = 2 1 ​ ( Δ x m a x ​ ) 2 + ( Δ y m a x ​ ) 2 ​ Δ x max ⁡ = x max ⁡ − x min ⁡ \Delta x_{\max} = x_{\max} - x_{\min} Δ x m a x ​ = x m a x ​ − x m i n ​ , Δ y max ⁡ = y max ⁡ − y min ⁡ \Delta y_{\max} = y_{\max} - y_{\min} Δ y m a x ​ = y m a x ​ − y m i n ​

Binary Identity ( e e e ) x ⋆ e = e ⋆ x = x x \star e = e \star x = x x ⋆ e = e ⋆ x = x Solve for e e e first; never assume e = 0 e = 0 e = 0 or e = 1 e = 1 e = 1

Binary Inverse ( x − 1 x^{-1} x − 1 ) x ⋆ x − 1 = e x \star x^{-1} = e x ⋆ x − 1 = e Substitute the absorbing element to see which x x x has no inverse

Modular Power Cycle a k ≡ 1 ( m o d m ) ⟹ a k q + s ≡ a s a^k \equiv 1 \pmod m \implies a^{kq+s} \equiv a^s a k ≡ 1 ( mod m ) ⟹ a k q + s ≡ a s Units digit ⟺ ( m o d 10 ) \iff \pmod{10} ⟺ ( mod 10 ) ; use − 1 -1 − 1 when a ≡ m − 1 a \equiv m - 1 a ≡ m − 1

  • Worked Examples
  • Worked Example 1: Constrained Subsets & Minimum Enclosing Circle of A × B A \times B A × B

Problem: Let A = { − 3 , − 1 , 0 , 2 , 4 , 5 , 7 } A = \{-3, -1, 0, 2, 4, 5, 7\} A = { − 3 , − 1 , 0 , 2 , 4 , 5 , 7 } and B = { − 2 , 1 , 6 } B = \{-2, 1, 6\} B = { − 2 , 1 , 6 } .

How many subsets of A A A contain element 0 0 0 , do not contain element 7 7 7 , and contain at least one of the negative elements { − 3 , − 1 } \{-3, -1\} { − 3 , − 1 } ?

What is the radius of the smallest circle in the coordinate plane that encloses all points of A × B A \times B A × B ?

Solution:

Here s ( A ) = 7 s(A) = 7 s ( A ) = 7 . First, lock the two mandatory conditions: 0 0 0 must be included and 7 7 7 must be excluded. That removes 2 2 2 elements from consideration, leaving 7 − 2 = 5 7 - 2 = 5 7 − 2 = 5 free elements { − 3 , − 1 , 2 , 4 , 5 } \{-3, -1, 2, 4, 5\} { − 3 , − 1 , 2 , 4 , 5 } , which generate 2 5 = 32 2^5 = 32 2 5 = 32 subsets. From these 32 32 32 subsets, subtract those that contain neither − 3 -3 − 3 nor − 1 -1 − 1 . Locking − 3 -3 − 3 and − 1 -1 − 1 out leaves only { 2 , 4 , 5 } \{2, 4, 5\} { 2 , 4 , 5 } ( 3 3 3 free elements), or 2 3 = 8 2^3 = 8 2 3 = 8 subsets. Thus, 32 − 8 = 24 32 - 8 = \mathbf{24} 32 − 8 = 24 subsets satisfy all constraints.

For A × B A \times B A × B , the horizontal span is Δ x max ⁡ = 7 − ( − 3 ) = 10 \Delta x_{\max} = 7 - (-3) = 10 Δ x m a x ​ = 7 − ( − 3 ) = 10 and the vertical span is Δ y max ⁡ = 6 − ( − 2 ) = 8 \Delta y_{\max} = 6 - (-2) = 8 Δ y m a x ​ = 6 − ( − 2 ) = 8 . The diameter of the smallest enclosing circle is d = 10 2 + 8 2 = 164 = 2 41 d = \sqrt{10^2 + 8^2} = \sqrt{164} = 2\sqrt{41} d = 1 0 2 + 8 2 ​ = 164 ​ = 2 41 ​ , so its radius is R = d 2 = 41 R = \frac{d}{2} = \mathbf{\sqrt{41}} R = 2 d ​ = 41 ​ .

Worked Example 2: Abstract Binary Operation & Modular Exponent Reduction

Problem:

On R \mathbb{R} R , define x ⋆ y = x + y − 1 2 x y x \star y = x + y - \frac{1}{2}xy x ⋆ y = x + y − 2 1 ​ x y . Find the identity element e e e , the absorbing element y y y , and the inverse 6 − 1 6^{-1} 6 − 1 .

Find the remainder when 2027 2026 + 19 103 2027^{2026} + 19^{103} 202 7 2026 + 1 9 103 is divided by 10 10 10 .

Solution:

Set x ⋆ e = x x \star e = x x ⋆ e = x : x + e − 1 2 x e = x ⟹ e ( 1 − x 2 ) = 0 ⟹ e = 0 x + e - \frac{1}{2}xe = x \implies e\left(1 - \frac{x}{2}\right) = 0 \implies e = \mathbf{0} x + e − 2 1 ​ x e = x ⟹ e ( 1 − 2 x ​ ) = 0 ⟹ e = 0

The factor 1 − x 2 1 - \frac{x}{2} 1 − 2 x ​ vanishes when x = 2 x = \mathbf{2} x = 2 , which is the absorbing element (indeed, 2 ⋆ y = 2 + y − y = 2 2 \star y = 2 + y - y = 2 2 ⋆ y = 2 + y − y = 2 for every y y y ). Now find 6 − 1 6^{-1} 6 − 1 using 6 ⋆ 6 − 1 = e = 0 6 \star 6^{-1} = e = 0 6 ⋆ 6 − 1 = e = 0 : 6 + 6 − 1 − 1 2 ( 6 ) ( 6 − 1 ) = 0 ⟹ 6 − 2 ( 6 − 1 ) = 0 ⟹ 6 − 1 = 3 6 + 6^{-1} - \frac{1}{2}(6)(6^{-1}) = 0 \implies 6 - 2(6^{-1}) = 0 \implies 6^{-1} = \mathbf{3} 6 + 6 − 1 − 2 1 ​ ( 6 ) ( 6 − 1 ) = 0 ⟹ 6 − 2 ( 6 − 1 ) = 0 ⟹ 6 − 1 = 3

Modulo 10 10 10 , we already know 2027 2026 ≡ 7 4 ( 506 ) + 2 ≡ 7 2 ≡ 9 ( m o d 10 ) 2027^{2026} \equiv 7^{4(506)+2} \equiv 7^2 \equiv 9 \pmod{10} 202 7 2026 ≡ 7 4 ( 506 ) + 2 ≡ 7 2 ≡ 9 ( mod 10 ) . For the second term, 19 ≡ − 1 ( m o d 10 ) 19 \equiv -1 \pmod{10} 19 ≡ − 1 ( mod 10 ) , so 19 103 ≡ ( − 1 ) 103 = − 1 ( m o d 10 ) 19^{103} \equiv (-1)^{103} = -1 \pmod{10} 1 9 103 ≡ ( − 1 ) 103 = − 1 ( mod 10 ) . Adding the two gives 9 + ( − 1 ) ≡ 8 ( m o d 10 ) 9 + (-1) \equiv \mathbf{8} \pmod{10} 9 + ( − 1 ) ≡ 8 ( mod 10 ) .

If the base and modulus are not coprime, a power need not return to 1. For example 2 N 2^N 2 N modulo 8 is 0 for all N ≥ 3 N\ge3 N ≥ 3 . Track the initial nonrepeating terms before any eventual cycle. For a noncommutative operation, identity, inverse and absorbing conditions must hold on both sides. An identity-row factor vanishing does not by itself prove absorption; substitute the proposed element into the operation and check the defining conditions.

Review the Method

In modular arithmetic, large exponents are reduced by finding the smallest positive period k where a^k ≡ 1 (mod m), provided gcd(a,m)=1 and replacing the exponent with its remainder modulo k.