IIM CAT 2026 cheat sheet for Logical Reasoning! 📱 Practice 1 Lakh+ PYQs on ExamBhai.com! - Free Study Material

Chapter Summary: Comprehensive Logical Reasoning for CAT 2026

Mastering Logical Reasoning for the IIM CAT requires a structured approach to analyzing patterns, dependencies, and set relationships. Below is an essential summary of core concepts and problem-solving framework techniques.

1. Seating Arrangements & Linear Ordering

Arrangement problems test spatial organization under specified constraints.

• Linear Arrangements: For \(n\) distinct entities, the total number of unconstrained permutations is \(n!\). When \(k\) specific items must always sit together, treat them as a single block: total arrangements equal \((n - k + 1)! \times k!\).
• Circular Arrangements: For \(n\) distinct entities, the number of circular arrangements is \((n - 1)!\). If clockwise and counter-clockwise arrangements are indistinguishable (e.g., necklace beads), the formula is \(\frac{(n - 1)!}{2}\).

2. Set Theory & Venn Diagrams

Set-based reasoning evaluates overlapping categories and boundary constraints.

• Two-Set Principle: \(|A \cup B| = |A| + |B| - |A \cap B|\)
• Three-Set Principle: \[|A \cup B \cup C| = |A| + |B| + |C| - \bigl(|A \cap B| + |B \cap C| + |C \cap A|\bigr) + |A \cap B \cap C|\]
• Max/Min Optimization: To maximize the intersection \(|A \cap B|\), minimize the elements outside both sets, subject to total universe bound \(U\): \(\max(|A \cap B|) = \min(|A|, |B|)\).

3. Binary Logic & Truth-Teller Problems

Binary logic problems involve analyzing statements made by Truth-tellers (always speak truth), Liars (always lie), and Alternators (alternate between truth and lies).

• Assumption Strategy: Assume a specific character's identity (e.g., "Person A is a Truth-teller"). Evaluate all subsequent statements for logical consistency. If a contradiction arises, invert the initial assumption.
• Equivalence Rule: If statement \(P\) leads to a contradiction under both hypotheses \(P = \text{True}\) and \(P = \text{False}\), the scenario constraints are mutually exclusive.

4. Selection & Team Formation

Problems involve forming sub-groups from a pool of candidates under specific conditional rules:

• Conditional Inclusion: "If A is selected, then B must be selected" translates to \(A \to B\). The contrapositive \(\neg B \to \neg A\) is logically equivalent.
• Mutual Exclusion: "A and B cannot be selected together" implies at most one of \(\{A, B\}\) is present.