Given a set of elements N = {1, 2, ..., n} and two arbitrary non-empty subsets…
GATE · 2006 · CS
Given a set of elements N = {1, 2, ..., n} and two arbitrary non-empty subsets A ⊆ N and B ⊆ N, how many of the n! permutations π from N to N satisfy min(π(A)) = min(π(B)), where min(S) is the smallest integer in the set of integers S, and π(S) is the set of integers obtained by applying permutation π to each element of S?
- A.
(n - |A ∪ B|) |A| |B|
- B.
(|A|2 + |B|2)n2
Attempted by 170 students.
Sign up free to check your answer
Sign up freeLoading lesson…