Study guide
3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)
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
3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)
Key Takeaways Explain This Topic AI
In a TR-YÖS Odd-One-Out (Farklı Olanı Bulma) problem, exactly 4 of the 5 figures (A–E) belong to the same equivalence class under a mathematical invariant, while 1 figure violates that invariant
Use the 10-second clockwise vertex-labeling method (A → B → C) to test 2D chirality: rotations preserve cyclic landmark order; matching order alone does not prove that two arbitrary figures are identical, whereas the fifth with reversed order is a mirror reflection
Topological invariants remain unchanged under bending or stretching; count closed bounded regions (kapalı bölge sayısı), line intersections (kesişim noktası), or apply Euler's planar graph formula F_bounded = E - V + 1
A connected line figure can be drawn in a single continuous stroke without lifting the pen (Tek Hamlede Çizilebilirlik / Eulerian path) if and only if the number of odd-degree vertices (tek dereceli düğümler) is 0 or 2
Check symmetry axis counts (reflectional vs. pure rotational pinwheel symmetry), polygon convexity vs. concavity (dışbükey vs. içbükey), and exact shaded area fractions when chirality and topology do not isolate a unique outlier
Last updated: October 2026
3.3 Visual Classification, Topological Invariants & Odd-One-Out ( Farklı Olanı Bulma )
Quick Method: In a TR-YÖS Odd-One-Out ( Farklı Olanı Bulma ) question, you are given 5 figures (A, B, C, D, E) with no sequence arrows and no analogy colon. Four of the five figures share a strict geometric, topological, or combinatorial invariant , while one figure breaks that rule. Never guess based on vague visual aesthetics. Run a fast, prioritized diagnostic checklist across the six classification checks used in this guide : (1) Rigid Rotation vs. Mirror Chirality, (2) Closed Regions & Intersection Counts, (3) Single-Stroke Graph Traversability, (4) Reflection vs. Rotational Symmetry, (5) Convexity vs. Concavity & Element Ratios, and (6) Shaded Area Fractions.
How Farklı Olanı Bulma Works on TR-YÖS
Unlike Şekil Dizileri (where order matters) or Analojiler (where a reference pair defines an operator), Farklı Olanı Bulma tests equivalence class recognition . Two figures belong to the same equivalence class if they share a preserved property P ( F ) P(F) P ( F ) under a specific set of transformations.
Because a candidate only needs to examine 3 figures to identify the majority invariant whenever the first two disagree ( P ( F A ) ≠ P ( F B ) ⟹ P ( F C ) P(F_A) \neq P(F_B) \implies P(F_C) P ( F A ) = P ( F B ) ⟹ P ( F C ) breaks the tie immediately!), a mathematical diagnostic method lets you solve these items in 10 to 15 seconds.
- Six Useful Classification Checks
- Invariant Class 1: Rigid Rotation vs. Reflection (Chirality / Yönelim ve Simetri )
When all 5 options (A–E) appear to be the exact same asymmetric drawing tilted at different angles, the question is testing 2D chirality (planar handedness) . Four of the figures can be obtained from one another by pure 2D rotation in the plane of the page without lifting the figure into 3D space. The fifth figure is a mirror reflection (enantiomorph) that can only be produced by flipping the shape over.
The 10-Second Clockwise Vertex-Labeling Method ( A → B → C A \to B \to C A → B → C )
Do not crane your neck or rotate the exam booklet wildly. Instead, use the Cyclic Landmark Test :
Choose three unmistakable asymmetric landmarks on the figure and label them A A A , B B B , and C C C (for example: A = A = A = the black dot, B = B = B = the sharp acute tip, C = C = C = the square hook).
Stand inside the centroid of each figure and trace the shortest perimeter path from A → B → C A \to B \to C A → B → C .
Record whether the loop A → B → C A \to B \to C A → B → C runs Clockwise ( Saat Yönü / CW) or Counterclockwise ( Saat Yönünün Tersi / CCW) .
Because pure 2D rotations preserve cyclic orientation and any single reflection reverses it, 4 options will share the same cyclic direction (e.g., CW) and 1 option will have the opposite direction (CCW) . That single opposite option is guaranteed to be the odd one out!
Invariant Class 2: Euler Characteristic, Closed Regions & Intersection Counts
When the 5 figures look completely different in shape (e.g., curved loops, overlapping polygons, or abstract line networks), the invariant is topological or combinatorial :
Closed Bounded Regions ( Kapalı Bölge Sayısı ): Count the number of completely enclosed interior white cells (minimal non-overlapping regions bounded by edges). Four figures might each divide the plane into exactly 5 5 5 closed regions, while the fifth divides it into 6 6 6 closed regions.
Euler's Planar Graph Formula: For any connected planar drawing with V V V vertices (endpoints and intersection nodes) and E E E non-crossing edge segments between vertices, Euler's formula states: V − E + F = 2 ⟺ F bounded = E − V + 1 V - E + F = 2 \quad \Longleftrightarrow \quad F_{\text{bounded}} = E - V + 1 V − E + F = 2 ⟺ F bounded = E − V + 1
where F F F includes the unbounded exterior face and F bounded = F − 1 F_{\text{bounded}} = F - 1 F bounded = F − 1 is the exact count of enclosed interior regions.
Line-Segment Intersections ( Kesişim Noktası ): Four figures contain lines that cross each other at exactly k k k interior points, whereas the fifth has k − 1 k-1 k − 1 or k + 1 k+1 k + 1 crossings.
Open Endpoints ( Açık Uç Sayısı ): Count the number of degree-1 dangling line tips.
Invariant Class 3: Graph Traversability (Eulerian Path / Tek Hamlede Çizilebilirlik )
A classic topological invariant asks which of five complex wireframes can (or cannot) be drawn in a single continuous stroke without lifting the pencil or retracing any line segment ( Tek Hamlede Çizilebilirlik ).
Instead of trying to trace the figure by hand—which wastes time and fails on complex grids—apply Euler's Degree Theorem by counting the degree d ( v ) d(v) d ( v ) of each vertex v v v (the exact number of line ends meeting at node v v v ). Specifically, count how many vertices have an odd degree ( d ( v ) ∈ { 1 , 3 , 5 , 7 , … } d(v) \in \{1, 3, 5, 7, \dots\} d ( v ) ∈ { 1 , 3 , 5 , 7 , … } , called tek dereceli düğümler ): N odd = number of vertices where an odd number of line ends meet N_{\text{odd}} = \text{number of vertices where an odd number of line ends meet} N odd = number of vertices where an odd number of line ends meet
By the Handshaking Lemma ( ∑ d ( v ) = 2 E \sum d(v) = 2E ∑ d ( v ) = 2 E ), N odd N_{\text{odd}} N odd is always an even integer ( 0 , 2 , 4 , 6 , … 0, 2, 4, 6, \dots 0 , 2 , 4 , 6 , … ):
N odd = 0 N_{\text{odd}} = 0 N odd = 0 (All vertices have even degree 2 , 4 , 6 2, 4, 6 2 , 4 , 6 ): The figure has an Eulerian circuit . It can be drawn in one continuous stroke starting at any vertex and ending back at that same starting vertex.
N odd = 2 N_{\text{odd}} = 2 N odd = 2 (Exactly two odd-degree vertices): The figure has an Eulerian path . It can be drawn in one continuous stroke, provided you start at one odd-degree vertex and finish at the other odd-degree vertex.
N odd ≥ 4 N_{\text{odd}} \ge 4 N odd ≥ 4 ( 4 , 6 , 8 , … 4, 6, 8, \dots 4 , 6 , 8 , … odd-degree vertices): The figure cannot be drawn in a single stroke without lifting the pen! In fact, a connected graph with 2 k 2k 2 k odd vertices ( k ≥ 1 k \ge 1 k ≥ 1 ) requires a minimum of exactly k = N odd 2 k = \frac{N_{\text{odd}}}{2} k = 2 N odd separate pen strokes .
Invariant Class 4: Symmetry Axis Count & Rotational vs. Reflectional Symmetry
When the 5 figures are geometric medallions, stars, or polygons, compare their symmetry groups :
Invariant Class 5: Convexity vs. Concavity & Quantitative Element Ratios
Convex ( Dışbükey ) vs. Concave ( İçbükey ) Polygons: A polygon is convex ( dışbükey ) if every interior angle is strictly less than 180 ∘ 180^\circ 18 0 ∘ (so any line segment connecting two interior points stays completely inside the polygon). A polygon is concave ( içbükey ) if at least one interior angle is a reflex angle ( > 180 ∘ > 180^\circ > 18 0 ∘ ) , creating an inward-pointing dent or cave.
Sides-to-Dots Algebraic Invariant: Each figure consists of a polygon with S S S sides accompanied by D in D_{\text{in}} D in interior dots and D out D_{\text{out}} D out exterior dots. Check the algebraic relation across all 5 choices, such as S = D in + D out S = D_{\text{in}} + D_{\text{out}} S = D in + D out , or S − D in = 2 S - D_{\text{in}} = 2 S − D in = 2 , or even/odd parity of S + D S + D S + D .
Invariant Class 6: Shading Area Fractions
When each of the 5 figures is a square, circle, or regular hexagon partitioned by grid lines or diagonals into shaded and unshaded pieces, calculate the exact fraction of total area shaded : Area Fraction = Area shaded Area total \text{Area Fraction} = \frac{\text{Area}_{\text{shaded}}}{\text{Area}_{\text{total}}} Area Fraction = Area total Area shaded
Subdivide each figure into congruent unit triangles (for example, drawing both diagonals and both midlines of a square creates 8 8 8 congruent right triangles, each equal to 1 8 \frac{1}{8} 8 1 of the square's area). Four figures will have shaded triangles totaling 4 8 = 1 2 \frac{4}{8} = \frac{1}{2} 8 4 = 2 1 (or 2 8 = 1 4 \frac{2}{8} = \frac{1}{4} 8 2 = 4 1 ), while the fifth figure will have 3 8 \frac{3}{8} 8 3 shaded.
Invariant Class Visual Clue Across Options A–E Fast Diagnostic Test Typical Outlier Mechanism
1. 2D Chirality ( Yönelim ) All 5 shapes look identical but rotated Label 3 landmarks A → B → C A \to B \to C A → B → C ; check CW vs. CCW 4 trace CW, 1 is a mirror image tracing CCW
2. Closed Regions / Euler Different abstract loops or line networks Count enclosed cells F bounded = E − V + 1 F_{\text{bounded}} = E - V + 1 F bounded = E − V + 1 or crossings 4 figures have k k k closed cells; 1 has k ± 1 k \pm 1 k ± 1
3. Eulerian Traversability Complex wireframes or connected graphs Count odd-degree vertices N odd N_{\text{odd}} N odd 4 have N odd ∈ { 0 , 2 } N_{\text{odd}} \in \{0, 2\} N odd ∈ { 0 , 2 } (1 stroke); 1 has N odd ≥ 4 N_{\text{odd}} \ge 4 N odd ≥ 4
4. Symmetry Group Symmetric medallions, polygons, pinwheels Count mirror axes vs. pure rotational symmetry 4 have reflection axes; 1 has rotational-only ( 0 0 0 mirror axes)
5. Convexity / Parity Diverse polygons or polygons with dots Check for reflex angle > 180 ∘ > 180^\circ > 18 0 ∘ or compute S − D S - D S − D 4 are convex ( dışbükey ); 1 is concave ( içbükey )
6. Shaded Area Fraction Partitioned squares, circles, or hexagons Count unit triangles/sectors to find A shaded A total \frac{A_{\text{shaded}}}{A_{\text{total}}} A total A shaded 4 have exactly 1 2 \frac{1}{2} 2 1 (or 1 4 \frac{1}{4} 4 1 ) shaded; 1 has 3 8 \frac{3}{8} 8 3
- Worked Step-by-Step Examples
- Worked Example 1: The 10-Second A → B → C A \to B \to C A → B → C Chirality Test
Problem Setup: Five options (A–E) each show a circle containing three peripheral symbols attached to its inner rim: a Black Square ( A A A ) , a White Triangle ( B B B ) , and a Cross ( C C C ) , spaced at 90 ∘ 90^\circ 9 0 ∘ intervals with one empty quadrant.
Option A: A A A at North, B B B at East, C C C at South (West is empty).
Option B: A A A at East, B B B at South, C C C at West (North is empty).
Option C: A A A at South, B B B at East, C C C at North (West is empty).
Option D: A A A at West, B B B at North, C C C at East (South is empty).
Option E: A A A at South, B B B at West, C C C at North (East is empty).
Step-by-Step Solution: Trace the cyclic direction from A → B → C A \to B \to C A → B → C through the occupied quadrant path:
Option A: North → East → South \text{North} \to \text{East} \to \text{South} North → East → South = Clockwise (CW) .
Option B: East → South → West \text{East} \to \text{South} \to \text{West} East → South → West = Clockwise (CW) .
Option C: South → East → North \text{South} \to \text{East} \to \text{North} South → East → North = Counterclockwise (CCW) .
Option D: West → North → East \text{West} \to \text{North} \to \text{East} West → North → East = Clockwise (CW) .
Option E: South → West → North \text{South} \to \text{West} \to \text{North} South → West → North = Clockwise (CW) .
Conclusion: Option C reverses the cyclic order to CCW and is the mirror-reflected outlier.
Worked Example 2: Eulerian Traversability ( Tek Hamlede Çizilebilirlik )
Problem Setup: You are given 5 connected wireframe graphs and asked to find the odd one out:
Figure A: A square with both diagonals drawn, plus a rooftop triangle attached to the top two corners.
Figure B: Two squares sharing one common vertical edge (forming a 1 × 2 1 \times 2 1 × 2 grid of squares).
Figure C: A regular pentagon with an inscribed 5-pointed star (every vertex connects to 4 edges).
Figure D: Two triangles sharing a single central vertex (an hourglass/bowtie figure).
Figure E: A circle divided into 4 quadrants by one vertical diameter and one horizontal diameter.
Step-by-Step Solution: Count the odd-degree vertices ( N odd N_{\text{odd}} N odd ) in each graph:
Figure A (House with X): Top peak has degree 2 2 2 (even). Top-left and top-right corners each have 4 4 4 edges meeting (even). Bottom-left and bottom-right corners each have 3 3 3 edges meeting (odd). Center crossing has degree 4 4 4 (even). Total N odd = 2 ⟹ N_{\text{odd}} = 2 \implies N odd = 2 ⟹ Traversable in 1 stroke .
Figure B (Two adjacent squares): Outer 4 corners have degree 2 2 2 (even). The 2 shared middle vertices each have 3 3 3 edges meeting (odd). Total N odd = 2 ⟹ N_{\text{odd}} = 2 \implies N odd = 2 ⟹ Traversable in 1 stroke .
Figure C (Pentagon + Star): Every vertex has degree 4 4 4 (and any interior crossings have degree 4 4 4 ). Total N odd = 0 ⟹ N_{\text{odd}} = 0 \implies N odd = 0 ⟹ Traversable in 1 stroke .
Figure D (Hourglass/Bowtie): The 4 outer corners have degree 2 2 2 (even) and the shared center vertex has degree 4 4 4 (even). Total N odd = 0 ⟹ N_{\text{odd}} = 0 \implies N odd = 0 ⟹ Traversable in 1 stroke .
Figure E (Circle with + cross): Center has degree 4 4 4 (even), but the 4 rim junctions where diameters meet the circle each have 3 3 3 branches meeting (2 arc segments + 1 radius). Thus N odd = 4 ⟹ N_{\text{odd}} = 4 \implies N odd = 4 ⟹ Requires 4 2 = 2 \frac{4}{2} = 2 2 4 = 2 strokes (NOT traversable in 1 stroke) .
Conclusion: Figure E is the unique non-traversable outlier.
Connectivity and Relabeling: Preserve Edges, Not Positions
A graph picture represents objects by vertices and relationships by edges . Moving a vertex on the page does not change the graph if exactly the same vertex pairs remain connected. The released 2026-/1 booklet includes this type of relationship-preservation task; use the original example below to learn the method without copying the official item.
Suppose the first drawing has edges AB, AC, AD, BC and DE. Its neighbour sets are:
- Vertex Neighbours Degree
- A B, C, D 3
- B A, C 2
- C A, B 2
- D A, E 2
- E D 1
A rearranged drawing labels its positions U, V, W, X, Y and has edges UV, UW, UX, VW and XY. U is the only degree-3 vertex, so it maps to A. Y is the only degree-1 vertex, so it maps to E. The neighbour of E must be D, hence X maps to D. V and W map to B and C in either order: both connect to A and to each other. Without another distinguishing condition, their individual labels cannot be uniquely determined. This is a useful stopping point, not a reason to guess a label.
Check all five edges after any proposed mapping. Equal degree counts are necessary but not sufficient: two graphs can have identical degree lists yet different adjacency. Crossings of edges are not automatically vertices in a relationship diagram; follow the question's convention about marked junctions. This differs from a single-stroke drawing where an actual junction is a vertex. Preserve both required edges and required non-edges, and state any remaining ambiguity.
Review the Method
Check symmetry axis counts (reflectional vs. pure rotational pinwheel symmetry), polygon convexity vs. concavity (dışbükey vs. içbükey), and exact shaded area fractions when chirality and topology do not isolate a unique outlier