(n) distinct objects को (r) distinct boxes में onto तरीके से भेजने में inclusion-exclusion का सही सूत्र कौन-सा है?
Which inclusion-exclusion formula counts onto mappings from (n) distinct objects to (r) distinct boxes?
Explanation opens after your attempt
A. (\sum_{k=0}^{r}(-1)^k{}^{r}C_k(r-k)^n)
Concept
Cases with empty boxes are removed from total functions by inclusion-exclusion. In exams read onto as every box being non-empty.
Why this answer is correct
The correct answer is A. (\sum_{k=0}^{r}(-1)^k{}^{r}C_k(r-k)^n). Cases with empty boxes are removed from total functions by inclusion-exclusion. In exams read onto as every box being non-empty.
Exam Tip
Total functions से empty boxes वाले cases inclusion-exclusion द्वारा हटते हैं। परीक्षा में onto का अर्थ हर box non-empty समझें।
Login to save your score, XP, coins and progress.
