Study guide

7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

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

7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

Key Takeaways Explain This Topic AI

A single person who is n n n -th from the front and m m m -th from the back stands in a queue of total size N = n + m − 1 N = n + m - 1 N = n + m − 1 .

When A A A is n n n -th from the front, B B B is m m m -th from the back, and k k k people stand strictly between them, the non-overlapping maximum is N max ⁡ = n + m + k N_{\max} = n + m + k N m a x ​ = n + m + k and the overlapping minimum is N min ⁡ = n + m − k − 2 N_{\min} = n + m - k - 2 N m i n ​ = n + m − k − 2 .

In circular seating around an even 2 k 2k 2 k -seat table, fix one person as the rotational anchor and pair diametrically opposite seats at index offset + k ( m o d 2 k ) +k \pmod{2k} + k ( mod 2 k ) .

A conditional statement p ⇒ q ≡ ¬ p ∨ q p \Rightarrow q \equiv \neg p \lor q p ⇒ q ≡ ¬ p ∨ q is false only in the 1 ⇒ 0 ≡ 0 1 \Rightarrow 0 \equiv 0 1 ⇒ 0 ≡ 0 case, and is logically equivalent to its contrapositive ¬ q ⇒ ¬ p \neg q \Rightarrow \neg p ¬ q ⇒ ¬ p .

In 'exactly one statement is true' puzzles (İfadelerden yalnız biri doğrudur), locating two mutually contradictory statements ( S 1 = ¬ S 2 S_1 = \neg S_2 S 1 ​ = ¬ S 2 ​ ) confines the single truth to { S 1 , S 2 } \{S_1, S_2\} { S 1 ​ , S 2 ​ } and immediately forces all other statements to be false.

Last updated: October 2026

7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

To keep the examination accessible across multiple languages, TR-YÖS designs its deductive reasoning items ( Sayısal/Sözel Mantık, Sıralama ve Doğruluk Kurguları ) around compact symbolic rules rather than long paragraphs of prose. These problems fall into three recurring categories: linear queue and floor-stacking orderings , circular seating and attribute-matching grids , and propositional truth-value puzzles .

  • 1. Linear Ordering, Queue Position & Floor-Stacking Puzzles ( Sıralama ve Kuyruk Problemleri )
  • Queue Position Formulas ( Kuyruk / Sıra Problemleri )

Single Person Ranked from Both Ends: If a person is n n n -th from the front ( baştan n n n . sırada ) and m m m -th from the back ( sondan m m m . sırada ), adding n + m n + m n + m counts that person twice. The total number of people in the queue is: N = n + m − 1 N = n + m - 1 N = n + m − 1

Two People with k k k People Strictly Between Them: Suppose Person A A A is n n n -th from the front , Person B B B is m m m -th from the back , and there are k k k people strictly between A A A and B B B . Because the problem does not state whether A A A stands ahead of B B B or B B B stands ahead of A A A , two configurations exist:

Maximum Queue Size (Non-Overlapping — A A A is ahead of B B B ): The first n n n people (ending at A A A ), the k k k people in the middle, and the last m m m people (starting at B B B ) are completely disjoint: N max ⁡ = n + m + k N_{\max} = n + m + k N m a x ​ = n + m + k

Minimum Queue Size (Overlapping — B B B is ahead of A A A ): Here B B B , A A A , and the k k k people between them are counted inside both the front n n n prefix and the back m m m suffix (an overlap of k + 2 k + 2 k + 2 people): N min ⁡ = n + m − k − 2 N_{\min} = n + m - k - 2 N m i n ​ = n + m − k − 2 *(Feasibility check: the overlapping case requires $k + 2 \le \min(n, m)$ so that neither $A$ nor $B$ extends past the ends of the line. Note also that $N_{\max} - N_{\min} = 2k + 2$.)*

Block-Glue Notation & Slot Templates for Linear/Floor Arrangements

When ordering N N N items across numbered slots 1 , 2 , … , N 1, 2, \dots, N 1 , 2 , … , N (such as books on a shelf or tenants on floors 1 1 1 through 6 6 6 ):

Adjacent Glue Block ( [AB] or [BA] ): If " A A A and B B B are on consecutive floors" without specifying order, fuse them into a single 2 2 2 -slot block [AB/BA] and mark its internal swap factor ( 2 ! = 2 2! = 2 2 ! = 2 ).

Fixed Gap Template ( A _ _ B ): If "exactly 2 2 2 people sit between A A A and B B B ," their slot indices satisfy ∣ i A − i B ∣ = 3 \lvert i_A - i_B \rvert = 3 ∣ i A ​ − i B ​ ∣ = 3 . Write down the valid index pairs ( 1 , 4 ) , ( 2 , 5 ) , ( 3 , 6 ) (1,4), (2,5), (3,6) ( 1 , 4 ) , ( 2 , 5 ) , ( 3 , 6 ) immediately to eliminate impossible branches.

Strict Inequality Chains ( A < B < C A < B < C A < B < C ): Place the longest chain first; any entity with the highest number of constraints acts as your anchor.

  • 2. Circular Seating & Attribute-Matching Matrices ( Dairesel Masa ve Eşleştirme Tabloları )
  • Circular Seating Rules ( Yuvarlak Masa Sıralaması )

In a circle of N N N equally spaced seats, rotating everyone clockwise by 1 1 1 seat produces the exact same relative arrangement:

Fix the Anchor at 12 O'Clock (Seat 1 1 1 ): Always place the most constrained person at the top seat first. This eliminates the N N N -fold rotational ambiguity and reduces the remaining N − 1 N - 1 N − 1 seats to a fixed linear benchmark.

Immediate Neighbors vs. Diametrically Opposite Seats:

"Immediately next to X X X " ( X X X 'in hemen yanında ) means Seat ( i X − 1 ) (i_X - 1) ( i X ​ − 1 ) or ( i X + 1 ) ( m o d N ) (i_X + 1) \pmod N ( i X ​ + 1 ) ( mod N ) .

"Directly opposite X X X " ( X X X 'in tam karşısında ) in an even 2 k 2k 2 k -seat circle means the seat at index offset + k ( m o d 2 k ) +k \pmod{2k} + k ( mod 2 k ) . For example, around a 6 6 6 -person table ( 2 k = 6 ⟹ k = 3 2k = 6 \implies k = 3 2 k = 6 ⟹ k = 3 ), opposite pairs are ( 1 , 4 ) (1, 4) ( 1 , 4 ) , ( 2 , 5 ) (2, 5) ( 2 , 5 ) , and ( 3 , 6 ) (3, 6) ( 3 , 6 ) . Around an 8 8 8 -person table ( k = 4 k = 4 k = 4 ), opposite pairs are ( 1 , 5 ) (1, 5) ( 1 , 5 ) , ( 2 , 6 ) (2, 6) ( 2 , 6 ) , ( 3 , 7 ) (3, 7) ( 3 , 7 ) , and ( 4 , 8 ) (4, 8) ( 4 , 8 ) .

Elimination Matrix ( ✓ / × \checkmark / \times ✓ / × ) for Multi-Attribute Matching

When matching n n n people to n n n cities and n n n professions under one-to-one bijections, draw an n × n n \times n n × n grid. The moment you deduce a positive match ( ✓ \checkmark ✓ ) at cell ( r , c ) (r, c) ( r , c ) , immediately place × \times × across all other cells in row r r r and column c c c . If n − 1 n - 1 n − 1 cells in a row or column contain × \times × , the single remaining cell in that line must be ✓ \checkmark ✓ .

  • 3. Propositional Logic & Knights-and-Knaves Truth Puzzles ( Doğruluk Tabloları ve Doğrucu-Yalancı Kurguları )
  • Symbolic Connectives & Truth-Value Rules

Each proposition p p p takes a truth value in { 1 (True) , 0 (False) } \{1\text{ (True)}, 0\text{ (False)}\} { 1 (True) , 0 (False) } :

Conjunction ( p ∧ q p \land q p ∧ q , AND): 1 1 1 only when p = 1 p = 1 p = 1 and q = 1 q = 1 q = 1 ( 1 ∧ 1 ≡ 1 1 \land 1 \equiv 1 1 ∧ 1 ≡ 1 ).

Disjunction ( p ∨ q p \lor q p ∨ q , OR): 0 0 0 only when p = 0 p = 0 p = 0 and q = 0 q = 0 q = 0 ( 0 ∨ 0 ≡ 0 0 \lor 0 \equiv 0 0 ∨ 0 ≡ 0 ).

Exclusive OR ( p ∨ ‾ q p \underline{\lor} q p ∨ ​ q , XOR): 1 1 1 when p ≠ q p \neq q p  = q ; 0 0 0 when p = q p = q p = q .

Implication ( p ⇒ q p \Rightarrow q p ⇒ q , IF-THEN): Equivalent to ¬ p ∨ q \neg p \lor q ¬ p ∨ q . It is False ( 0 0 0 ) in only one case : when a true hypothesis leads to a false conclusion ( 1 ⇒ 0 ≡ 0 1 \Rightarrow 0 \equiv 0 1 ⇒ 0 ≡ 0 ). Its contrapositive ¬ q ⇒ ¬ p \neg q \Rightarrow \neg p ¬ q ⇒ ¬ p has the exact same truth value: ( p ⇒ q ) ≡ ( ¬ q ⇒ ¬ p ) (p \Rightarrow q) \equiv (\neg q \Rightarrow \neg p) ( p ⇒ q ) ≡ ( ¬ q ⇒ ¬ p ) .

Biconditional ( p ⇔ q p \Leftrightarrow q p ⇔ q , IFF): 1 1 1 when p = q p = q p = q (both True or both False); 0 0 0 when p ≠ q p \neq q p  = q . Note that ( p ⇔ q ) ≡ ¬ ( p ∨ ‾ q ) (p \Leftrightarrow q) \equiv \neg(p \underline{\lor} q) ( p ⇔ q ) ≡ ¬ ( p ∨ ​ q ) .

De Morgan's Negation Laws: ¬ ( p ∧ q ) ≡ ¬ p ∨ ¬ q \neg(p \land q) \equiv \neg p \lor \neg q ¬ ( p ∧ q ) ≡ ¬ p ∨ ¬ q and ¬ ( p ∨ q ) ≡ ¬ p ∧ ¬ q \neg(p \lor q) \equiv \neg p \land \neg q ¬ ( p ∨ q ) ≡ ¬ p ∧ ¬ q .

The Contradiction Shortcut for "Exactly One Statement Is True" ( İfadelerden Yalnız Biri Doğrudur )

Logic / Ordering Concept Core Formula / Equivalence Key Deduction Trigger

Single-Person Queue N = n + m − 1 N = n + m - 1 N = n + m − 1 Subtract 1 1 1 because the person is counted from both ends

Two-Person Queue ( k k k between) N max ⁡ = n + m + k N_{\max} = n + m + k N m a x ​ = n + m + k ; N min ⁡ = n + m − k − 2 N_{\min} = n + m - k - 2 N m i n ​ = n + m − k − 2 N max ⁡ − N min ⁡ = 2 k + 2 N_{\max} - N_{\min} = 2k + 2 N m a x ​ − N m i n ​ = 2 k + 2 ; requires k + 2 ≤ min ⁡ ( n , m ) k + 2 \le \min(n, m) k + 2 ≤ min ( n , m )

Circular Opposite Seats ( 2 k 2k 2 k ) Opposite ( i ) ≡ i + k ( m o d 2 k ) \text{Opposite}(i) \equiv i + k \pmod{2k} Opposite ( i ) ≡ i + k ( mod 2 k ) Fix anchor at Seat 1 1 1 ; pair ( 1 , k + 1 ) , ( 2 , k + 2 ) , … (1, k+1), (2, k+2), \dots ( 1 , k + 1 ) , ( 2 , k + 2 ) , …

Implication ( p ⇒ q p \Rightarrow q p ⇒ q ) p ⇒ q ≡ ¬ p ∨ q ≡ ¬ q ⇒ ¬ p p \Rightarrow q \equiv \neg p \lor q \equiv \neg q \Rightarrow \neg p p ⇒ q ≡ ¬ p ∨ q ≡ ¬ q ⇒ ¬ p False solely when p = 1 p = 1 p = 1 and q = 0 q = 0 q = 0 ( 1 ⇒ 0 ≡ 0 1 \Rightarrow 0 \equiv 0 1 ⇒ 0 ≡ 0 )

Contradictory Pair ( S 1 = ¬ S 2 S_1 = \neg S_2 S 1 ​ = ¬ S 2 ​ ) S 1 + S 2 = 1 S_1 + S_2 = 1 S 1 ​ + S 2 ​ = 1 (one True, one False) In "only 1 True" puzzles, every S m ∉ { S 1 , S 2 } S_m \notin \{S_1, S_2\} S m ​ ∈ / { S 1 ​ , S 2 ​ } is False

  • Worked Examples
  • Worked Example 7.3.1: Overlapping vs. Non-Overlapping Queue Positions

Problem: In a single-file ticket line, Kerem is 17 17 17 -th from the front and Pelin is 14 14 14 -th from the back. There are exactly 5 5 5 people standing strictly between Kerem and Pelin. Find (a) the maximum and minimum possible number of people in the line, and (b) Pelin's position from the front in the minimum-queue case.

Solution:

Maximum Queue Size (Non-Overlapping — Kerem ahead of Pelin): N max ⁡ = n + m + k = 17 + 14 + 5 = 36 people N_{\max} = n + m + k = 17 + 14 + 5 = 36\text{ people} N m a x ​ = n + m + k = 17 + 14 + 5 = 36 people

Minimum Queue Size (Overlapping — Pelin ahead of Kerem): N min ⁡ = n + m − k − 2 = 17 + 14 − 5 − 2 = 24 people N_{\min} = n + m - k - 2 = 17 + 14 - 5 - 2 = 24\text{ people} N m i n ​ = n + m − k − 2 = 17 + 14 − 5 − 2 = 24 people

Pelin's Position from the Front when N = 24 N = 24 N = 24 : Using the single-person formula N = n Pelin + m Pelin − 1 N = n_{\text{Pelin}} + m_{\text{Pelin}} - 1 N = n Pelin ​ + m Pelin ​ − 1 : 24 = n Pelin + 14 − 1 ⟹ n Pelin = 11 -th from the front 24 = n_{\text{Pelin}} + 14 - 1 \implies n_{\text{Pelin}} = 11\text{-th from the front} 24 = n Pelin ​ + 14 − 1 ⟹ n Pelin ​ = 11 -th from the front

Verification: With Pelin at 11 11 11 -th and Kerem at 17 17 17 -th from the front, the people at positions 12 , 13 , 14 , 15 , 16 12, 13, 14, 15, 16 12 , 13 , 14 , 15 , 16 are the 5 5 5 people strictly between them.

Worked Example 7.3.2: Contradiction Shortcut in a 4-Box Truth Puzzle

Problem: A gold coin is placed inside one of four locked boxes ( A , B , C , D A, B, C, D A , B , C , D ). Each box bears a printed statement:

  • Box A A A : "The coin is in Box A A A ."
  • Box B B B : "The coin is in Box C C C ."
  • Box C C C : "The coin is not in Box C C C ."
  • Box D D D : "The coin is not in Box D D D ."

If only one of the four statements is true and the other three are false, which box contains the gold coin, and which box's statement is true?

Solution:

Identify the contradictory pair: Box B B B ( "The coin is in Box C C C " ) and Box C C C ( "The coin is not in Box C C C " ) are exact logical negations ( S B = ¬ S C S_B = \neg S_C S B ​ = ¬ S C ​ ). Therefore, one of { S B , S C } \{S_B, S_C\} { S B ​ , S C ​ } is True and the other is False.

Deduce the truth values of the remaining statements: Since only one statement in total is true, both Box A A A 's statement and Box D D D 's statement must be False ( 0 0 0 ) .

Negate the false statement on Box D D D : Box D D D claims "The coin is not in Box D D D ." Since this statement is False , its negation is True: the coin is in Box D D D !

Verify all four labels when the coin is in Box D D D :

Box A A A ("in A A A "): False ( 0 0 0 ).

Box B B B ("in C C C "): False ( 0 0 0 ).

Box C C C ("not in C C C "): True ( 1 1 1 ) .

Box D D D ("not in D D D "): False ( 0 0 0 ).

Thus, the coin is in Box D D D and Box C C C has the sole true statement.

Review the Method

In 'exactly one statement is true' puzzles (İfadelerden yalnız biri doğrudur), locating two mutually contradictory statements ( S 1 = ¬ S 2 S_1 = \neg S_2 S 1 ​ = ¬ S 2 ​ ) confines the single truth to { S 1 , S 2 } \{S_1, S_2\} { S 1 ​ , S 2 ​ } and immediately forces all other statements to be false.