Start Learning Free

Before You Begin

Question #40300

Difficulty: 8/10 | 🟢 Free

The Question

Let S={1,2,3,4,5,6}S = \{1, 2, 3, 4, 5, 6\}. A permutation f:S→Sf: S \to S is called \textit{acceptable} if it satisfies at least one of the following two conditions:

(I) f(i)≠if(i) \neq i for all i∈{1,2,3}i \in \{1, 2, 3\} (II) f(j)≠jf(j) \neq j for all j∈{4,5}j \in \{4, 5\}

Find the number of acceptable permutations of SS.

Options

  • A.

    621

  • B.

    576

  • C.

    411

  • D.

    309

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Bridge

Practice problems that bridge the gap between foundational theory and advanced practical application.

Concepts Behind This Question

Universal Set Relativity|Derangements (Inclusion-Exclusion)|Complementary Counting (Class 11)|Complementary Counting (Class 12)

Why This Question Is Tricky

Common Mistakes

The question tests the Principle of Inclusion-Exclusion (PIE) and the ability to correctly define the universal set when calculating the intersection of complementary events.

The primary trap lies in using De Morgan's laws to find the complement ∣A‾∩B‾∣|\overline{A} \cap \overline{B}| (where A‾\overline{A} means at least one of {1,2,3}\{1,2,3\} is fixed, and B‾\overline{B} means at least one of {4,5}\{4,5\} is fixed).

Students often incorrectly calculate this intersection by simply choosing one fixed point from each set and permuting the rest ((31)×(21)×4!=144\binom{3}{1} \times \binom{2}{1} \times 4! = 144), leading to the trap answer of 720−144=576720 - 144 = 576.

This flawed approach fails to account for the overlapping sub-cases (e.g., fixing elements 1, 4, and 5 simultaneously), which double-counts permutations in the reduced sample space.

The rigorous method requires applying PIE to find ∣A∣|A|, ∣B∣|B|, and ∣A∩B∣|A \cap B| independently.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterSets - Class 11
ConceptUniversal Set Relativity
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree