• edited by
4,995 views
47 47 votes

How many pairs of sets $(A, B)$ are there that satisfy the condition $A, B \subseteq \left\{1, 2,...,5\right\}, A \cap B = \{\}?$

  1. $125$
  2. $127$
  3. $130$
  4. $243$
  5. $257$

2 Answers

Best answer
57 57 votes

Correct Option: $C$ $243$.

First take $A$ as $\emptyset$ and $B$ as power set of $\{1,2,3,4,5\} $ which is $2^5$. Then take $A$ as set of one element ex: when $A$=$\left \{ 1 \right \}$ then set $B$ could be any of the $2^4$ elements of power set. This will give us $16 \times 5$ . In similar fashion when $A$ consists of $2$ elements we get total pairs $5C2\times 2^3$; when $A$ is of three elements we get $40$; for $4$ elements we get $10$ pairs and when $A$ is of $5$ elements we get one pair which is $A$=$\left \{ 1,2,3,4,5 \right \}$ and $B=\left \{ \right \}.$ So, in total $=32+80+80+40+10+1=243$


Alternative Solution:

for each element in $[n]$, you have 3 choices:

  1. Include it in $A$ but not in $B$
  2. Include it in $B$, but not in $A  $
  3. Include it in neither

so this gives $3^n$ pairs.

 for set $\{1,2,,...,5\}$, $n=5$, $3^5=243$

• edited by
Answer:
Position:
Show:

Related questions

15 15 votes
3 3 answers
3.9k
3.9k views
Misbah Ghaya asked Oct 31, 2015
3,863 views
Let $R$ be a binary relation over a set $S$. The binary relation $R$ is called an equivalence relation if it is reflexive transitive and symmetric. The relation is called...
17 17 votes
4 4 answers
8.5k
8.5k views
Misbah Ghaya asked Oct 31, 2015
8,531 views
Let $\wedge $, $\vee $ denote the meet and join operations of lattice. A lattice is called distributive if for all $x, y, z,$$x\wedge \left ( y\vee z \right )= \left ( x\...
18 18 votes
4 answers 4 answers
3.5k
3.5k views
Misbah Ghaya asked Oct 30, 2015
3,470 views
For $x, y\in \left\{0, 1\right\}^{n}$, let $x ⊕ y$ be the element of $\left\{0, 1\right\}^{n}$ obtained by the component-wise exclusive-or of $x$ and $y$. A Boolean funct...
20 20 votes
2 answers 2 answers
4.4k
4.4k views
Misbah Ghaya asked Oct 31, 2015
4,431 views
Consider the parse treeAssume that $*$ has higher precedence than $+$, $-$ and operators associate right to left (i.e $(a + b + c= (a + (b + c)))$. Consider$2 + a - b$$2 ...