Computer Sciences > GATE 2023 > Discrete Mathematics
Let U = {1, 2,...,n}, where n is a large positive integer greater than 1000. Let k be a positive integer less than n. Let A, B be subsets of U with |A| = |B| = k and A ∩ B = ∅. We say that a permutation of U separates A from B if one of the following is true.
- All members of A appear in the permutation before any of the members of B.
- All members of B appear in the permutation before any of the members of A.
How many permutations of U separate A from B?
- All members of A appear in the permutation before any of the members of B.
- All members of B appear in the permutation before any of the members of A.
How many permutations of U separate A from B?
Correct : d
Similar Questions
Let f: A → B be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation ~ on the set A as a1 ~ a2 if f(a1) = f(a2), wh...
Let f: A → B be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation ~ on the set A as a1 ~ a2 if f(a1) = f(a2), wh...
Let f: A → B be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation ~ on the set A as a1 ~ a2 if f(a1) = f(a2), wh...
Total Unique Visitors
Loading......