in Mathematical Logic edited by
584 views
5 votes
5 votes

Let $S$ be the set $\{1,2,3,  \dots ,8\}$. Let $n$ be the number of sets of two non-empty disjoint subsets of $S$. The value of $n$ is _______.

in Mathematical Logic edited by
by
584 views

1 comment

1
1

2 Answers

2 votes
2 votes
Best answer
(3^8 - 1)/2 - 2^8 + 1 [from matrix diagram and counting only off diagonal 1's and leaving 1's related to phi set]
selected by

3 Comments

Sir, please elaborate the solution.
0
0

see this problem  https://gateoverflow.in/94195/probability-settheory , how it solved and try yourself .

0
0

@Bikram Sir in answer why are you adding 1 related to phi set as in question it is mentioned that two sets are non empty.

0
0
0 votes
0 votes

Lets suppose two sets be A and B.

Elements can be either in A or B or not in both sets.

Therefore, Total possible ordered pairs = $(3)^8$

But cases like,

  1. A={ø} and B = elements
  2. A= elements and B= {ø}

are not allowed, remove them.

So, $3^8$ – $2 *2^8$

But we have subtracted A={ø} and B={ø} two times, so add $1$.

Current total = $3^8$ – $2 * 2 ^ 8$ + $1$ = $ 6050 $

But here we have to consider unordered pairs, so resultant total =  $6050/2$ =$3025$.

 

Answer:

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