Single correct option
The number of one-one functions such that for every is
- A.
- B.
- C.
- D.
Show answer and solution
Answer: (C)
Use inclusion-exclusion on the bad events . The total number of one-one maps is . If chosen elements are fixed, the remaining elements map injectively into the other values, giving maps. So the count is . Stopping before the last alternating terms gives the nearby wrong values or .
Saved on this device. Sign in or create a free account to keep it on every device.