Combinatorics
Permutations and Derangements
GRB_1000_SCQ
Grade Class 12
Question:
Let $A = \{1, 2, 3, 4, 5, 6, 7\}$. The number of surjective functions defined from $A$ to $A$ such that $f(i) = i$ for at least four values of $i$ from $i = 1, 2, \ldots, 7$, is:
Step-by-Step Solution
Key Concept: Derangements and counting permutations with fixed points
Step 1: Understand the problem requirement.
We need to find surjective functions $f: A \to A$ where $A = \{1, 2, 3, 4, 5, 6, 7\}$ such that $f(i) = i$ for at least four values of $i$. Since the domain and codomain are the same finite set, a surjective function must be bijective (a permutation).
Step 2: Identify all possible cases based on the number of fixed points.
Since we need at least 4 fixed points, we consider:
- Case 1: Exactly 4 fixed points
- Case 2: Exactly 5 fixed points
- Case 3: Exactly 6 fixed points
- Case 4: Exactly 7 fixed points (all elements are fixed)
Step 3: Analyze Case 1 (Exactly 4 fixed points).
Choose 4 elements from 7 to be fixed points: $\binom{7}{4}$ ways.
The remaining 3 elements must map to themselves in no way (they form a derangement). The number of derangements of 3 elements is:
$$D_3 = 3! \left(1 - \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!}\right) = 6 \left(\frac{1}{3}\right) = 2$$
Count for Case 1: $\binom{7}{4} \times D_3 = 35 \times 2 = 70$
Step 4: Analyze Case 2 (Exactly 5 fixed points).
Choose 5 elements from 7 to be fixed points: $\binom{7}{5}$ ways.
The remaining 2 elements must form a derangement. The number of derangements of 2 elements is:
$$D_2 = 2! \left(1 - \frac{1}{1!} + \frac{1}{2!}\right) = 2 \left(\frac{1}{2}\right) = 1$$
Count for Case 2: $\binom{7}{5} \times D_2 = 21 \times 1 = 21$
Step 5: Analyze Case 3 (Exactly 6 fixed points).
Choose 6 elements from 7 to be fixed points: $\binom{7}{6}$ ways.
The remaining 1 element must form a derangement. However, a single element cannot be deranged (it must map to itself):
$$D_1 = 0$$
Count for Case 3: $\binom{7}{6} \times D_1 = 7 \times 0 = 0$
Step 6: Analyze Case 4 (Exactly 7 fixed points).
All 7 elements are fixed points, meaning $f(i) = i$ for all $i$. There is exactly one such function (the identity function).
Count for Case 4: $1$
Step 7: Calculate the total number of surjective functions.
Add the counts from all cases:
$$\text{Total} = 70 + 21 + 0 + 1 = 92$$
The number of surjective functions from $A$ to $A$ such that $f(i) = i$ for at least four values of $i$ is $\boxed{92}$.
The answer is **Option 2: 92**.
Correct Answer: 2