The Gateway to Computer Science Excellence
+1 vote
40 views

Let $A$ and $B$ be disjoint sets containing $m$ and $n$ elements respectively, and let $C=A \cup B$. Then the number of subsets $S$ (of $C$) which contains $p$ elements and also has the property that $S \cap A$ contains $q$ elements, is

  1. $\begin{pmatrix} m \\ q \end{pmatrix}$
  2. $\begin{pmatrix} n \\ q \end{pmatrix}$
  3. $\begin{pmatrix} m \\ q \end{pmatrix} \times \begin{pmatrix} n \\ p-q \end{pmatrix}$
  4. $\begin{pmatrix} m \\ p-q \end{pmatrix} \times \begin{pmatrix} n \\ q \end{pmatrix}$
in Set Theory & Algebra by Veteran (431k points)
recategorized by | 40 views
0
Anyone know this que??

1 Answer

+1 vote

The question actually asks how many ways are there to find a collection of $p$ elements of which it contains exactly $q$ elements from $A$ and the rest from $B$. Obviously $q\le m$ and $p\le (m+n)$.

Here, $|A|=m, ~|B|=n$

So, there are $\begin{pmatrix} m\\ q \end{pmatrix}$ ways to find $q$ elements from the set $A$

and the rest $(p-q)$ elements can be chosen from the $B$ which has $\begin{pmatrix} n\\ p-q \end{pmatrix}$ ways.

$\therefore~$The required number of ways $=\begin{pmatrix} m\\ q \end{pmatrix}\times\begin{pmatrix} n\\ p-q \end{pmatrix}$.

 

So the correct answer is C.

by Active (3.6k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,373 answers
198,511 comments
105,285 users